Submission #7817174
Source Code Expand
#include<cstdio> const int N=2000002; int a[N],n,i,m,u; long long v; char s[N]; int main(){ scanf("%s",s+1); while(s[n+1])n++; for(i=1;i<n;i++) if(s[i]=='2'&&s[i+1]=='5') a[++m]=1,i++; else a[++m]=0; n=m; for(i=1;i<=n;i++) if(a[i]==1) u++,v+=u; else u=0; printf("%lld",v); //while(1); }
Submission Info
Submission Time | |
---|---|
Task | B - ニコニコ文字列 |
User | iwprc |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 336 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 2432 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:7:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",s+1); ^
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 | WA | 1 ms | 128 KB |
subtask0_sample_02.txt | WA | 1 ms | 128 KB |
subtask0_sample_03.txt | WA | 1 ms | 128 KB |
subtask0_sample_04.txt | WA | 1 ms | 128 KB |
subtask0_sample_05.txt | WA | 1 ms | 128 KB |
subtask1_01.txt | WA | 1 ms | 128 KB |
subtask1_02.txt | WA | 1 ms | 128 KB |
subtask1_03.txt | WA | 1 ms | 128 KB |
subtask1_04.txt | WA | 1 ms | 128 KB |
subtask1_05.txt | WA | 1 ms | 128 KB |
subtask1_06.txt | WA | 1 ms | 128 KB |
subtask1_07.txt | WA | 1 ms | 128 KB |
subtask1_08.txt | WA | 1 ms | 128 KB |
subtask1_09.txt | WA | 1 ms | 128 KB |
subtask1_10.txt | WA | 1 ms | 128 KB |
subtask1_11.txt | WA | 1 ms | 128 KB |
subtask1_12.txt | WA | 1 ms | 128 KB |
subtask1_13.txt | WA | 0 ms | 128 KB |
subtask2_01.txt | WA | 1 ms | 2432 KB |
subtask2_02.txt | WA | 1 ms | 2432 KB |
subtask2_03.txt | WA | 1 ms | 2432 KB |
subtask2_04.txt | WA | 2 ms | 2432 KB |
subtask2_05.txt | WA | 1 ms | 2432 KB |
subtask2_06.txt | WA | 2 ms | 2432 KB |
subtask2_07.txt | WA | 1 ms | 2432 KB |
subtask2_08.txt | WA | 1 ms | 2432 KB |
subtask2_09.txt | WA | 1 ms | 256 KB |
subtask2_10.txt | WA | 1 ms | 256 KB |
subtask2_11.txt | WA | 1 ms | 128 KB |
subtask2_12.txt | WA | 1 ms | 256 KB |