Submission #1061104
Source Code Expand
#include <iostream> #include <algorithm> #include <string> #include <vector> using namespace std; string S; int main() { cin >> S; int m = 0, c = 0; for (int i=0; i<S.length()-1; i++) { if (S[i] == '2' && S[i+1] == '5') { c++; m += c; i++; } else { c = 0; } } cout << m << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ニコニコ文字列 |
User | funcsr |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 369 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 1272 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 | 26 ms | 1012 KB |
subtask0_sample_02.txt | AC | 20 ms | 1012 KB |
subtask0_sample_03.txt | AC | 22 ms | 1016 KB |
subtask0_sample_04.txt | AC | 21 ms | 1012 KB |
subtask0_sample_05.txt | AC | 22 ms | 1016 KB |
subtask1_01.txt | AC | 22 ms | 1012 KB |
subtask1_02.txt | AC | 22 ms | 1016 KB |
subtask1_03.txt | AC | 23 ms | 972 KB |
subtask1_04.txt | AC | 22 ms | 1016 KB |
subtask1_05.txt | AC | 21 ms | 1016 KB |
subtask1_06.txt | AC | 22 ms | 1016 KB |
subtask1_07.txt | AC | 24 ms | 1048 KB |
subtask1_08.txt | AC | 23 ms | 1016 KB |
subtask1_09.txt | AC | 23 ms | 1008 KB |
subtask1_10.txt | AC | 22 ms | 1016 KB |
subtask1_11.txt | AC | 23 ms | 1016 KB |
subtask1_12.txt | AC | 22 ms | 1012 KB |
subtask1_13.txt | AC | 22 ms | 1012 KB |
subtask2_01.txt | AC | 27 ms | 1144 KB |
subtask2_02.txt | AC | 26 ms | 1224 KB |
subtask2_03.txt | AC | 26 ms | 1228 KB |
subtask2_04.txt | AC | 26 ms | 1272 KB |
subtask2_05.txt | AC | 26 ms | 1100 KB |
subtask2_06.txt | AC | 26 ms | 1264 KB |
subtask2_07.txt | AC | 25 ms | 1144 KB |
subtask2_08.txt | AC | 26 ms | 1228 KB |
subtask2_09.txt | AC | 21 ms | 1016 KB |
subtask2_10.txt | AC | 22 ms | 1016 KB |
subtask2_11.txt | AC | 22 ms | 1012 KB |
subtask2_12.txt | AC | 21 ms | 972 KB |