Submission #7454210
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for( int i = 0 ; i < n ; i++ ) int main(){ string S ; cin >> S ; int counter = 0 , I , A=0 ; I = S.size(); //cout << I << endl ; //2525が繰り返されている回数をカウントする。 rep(i,I) { if (S[i] == '2') { if (S[i+1] == '5') counter++ ; i = i + 1 ; //cout << "25カウントは" <<counter << endl; if( i+1 == I ) A = A + (counter+1)*counter/2 ; } else { A = A + (counter+1)*counter/2; counter = 0 ; //cout << "カウントは" <<counter << endl; } } cout << A << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - ニコニコ文字列 |
User | fefefe |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 635 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | WA | 1 ms | 256 KB |
subtask0_sample_04.txt | WA | 1 ms | 256 KB |
subtask0_sample_05.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | WA | 1 ms | 256 KB |
subtask1_05.txt | WA | 1 ms | 256 KB |
subtask1_06.txt | WA | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | WA | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | WA | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |
subtask2_01.txt | AC | 4 ms | 512 KB |
subtask2_02.txt | AC | 4 ms | 512 KB |
subtask2_03.txt | AC | 4 ms | 512 KB |
subtask2_04.txt | WA | 5 ms | 512 KB |
subtask2_05.txt | WA | 5 ms | 512 KB |
subtask2_06.txt | WA | 5 ms | 512 KB |
subtask2_07.txt | WA | 4 ms | 512 KB |
subtask2_08.txt | WA | 4 ms | 512 KB |
subtask2_09.txt | AC | 2 ms | 256 KB |
subtask2_10.txt | WA | 2 ms | 256 KB |
subtask2_11.txt | AC | 2 ms | 256 KB |
subtask2_12.txt | AC | 2 ms | 256 KB |