Submission #326058
Source Code Expand
#include <iostream> #include <string> typedef long long ll; using namespace std; int main() { string s; while (cin>>s) { int n=s.size(); ll res=0, c=0; for(int i=0;i+1<n;) { if (s[i]=='2' and s[i+1]=='5') { ++c; i+=2; } else { res+=c*(c+1)/2; c=0; ++i; } } res+=c*(c+1)/2; cout<<res<<endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - ニコニコ文字列 |
User | hogeover30 |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 507 Byte |
Status | AC |
Exec Time | 37 ms |
Memory | 1276 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 36 ms | 984 KB |
subtask0_sample_02.txt | AC | 28 ms | 976 KB |
subtask0_sample_03.txt | AC | 28 ms | 1028 KB |
subtask0_sample_04.txt | AC | 28 ms | 1016 KB |
subtask0_sample_05.txt | AC | 28 ms | 1036 KB |
subtask1_01.txt | AC | 29 ms | 980 KB |
subtask1_02.txt | AC | 31 ms | 972 KB |
subtask1_03.txt | AC | 30 ms | 1012 KB |
subtask1_04.txt | AC | 30 ms | 1012 KB |
subtask1_05.txt | AC | 28 ms | 972 KB |
subtask1_06.txt | AC | 30 ms | 1108 KB |
subtask1_07.txt | AC | 31 ms | 996 KB |
subtask1_08.txt | AC | 29 ms | 976 KB |
subtask1_09.txt | AC | 31 ms | 988 KB |
subtask1_10.txt | AC | 30 ms | 916 KB |
subtask1_11.txt | AC | 30 ms | 1036 KB |
subtask1_12.txt | AC | 30 ms | 952 KB |
subtask1_13.txt | AC | 30 ms | 952 KB |
subtask2_01.txt | AC | 36 ms | 1228 KB |
subtask2_02.txt | AC | 37 ms | 1204 KB |
subtask2_03.txt | AC | 36 ms | 1212 KB |
subtask2_04.txt | AC | 36 ms | 1276 KB |
subtask2_05.txt | AC | 35 ms | 1212 KB |
subtask2_06.txt | AC | 34 ms | 1232 KB |
subtask2_07.txt | AC | 34 ms | 1232 KB |
subtask2_08.txt | AC | 35 ms | 1212 KB |
subtask2_09.txt | AC | 27 ms | 1144 KB |
subtask2_10.txt | AC | 28 ms | 1040 KB |
subtask2_11.txt | AC | 29 ms | 972 KB |
subtask2_12.txt | AC | 28 ms | 956 KB |