Submission #6037385


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
using namespace std;
string st,st2="25";
long long k=0,bk=0,h;
int main()
{
cin>>st;
while(st.size()>=st2.size())
{
	for(int i=0;i<=st.size()-st2.size();i++)
	{
		for(int j=i;j<=i+st2.size()-1;j++)
		{
			if(st[j]!=st2[k]){bk=1;break;}
			k++;
		}
		if(bk==0){h++;}
		bk=0;
		k=0;
	}
	st2=st2+"25";
}
cout<<h;
return 0;
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User luogu_bot2
Language C++ (GCC 5.4.1)
Score 0
Code Size 440 Byte
Status WA
Exec Time 2103 ms
Memory 512 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
WA × 5
WA × 16
TLE × 2
WA × 18
TLE × 12
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 256 KB
subtask0_sample_02.txt WA 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 WA 1 ms 256 KB
subtask1_01.txt WA 23 ms 256 KB
subtask1_02.txt WA 12 ms 256 KB
subtask1_03.txt WA 23 ms 256 KB
subtask1_04.txt WA 25 ms 256 KB
subtask1_05.txt WA 25 ms 256 KB
subtask1_06.txt WA 25 ms 256 KB
subtask1_07.txt TLE 2103 ms 256 KB
subtask1_08.txt TLE 2103 ms 256 KB
subtask1_09.txt WA 354 ms 256 KB
subtask1_10.txt WA 1 ms 256 KB
subtask1_11.txt WA 1 ms 256 KB
subtask1_12.txt WA 122 ms 256 KB
subtask1_13.txt WA 1 ms 256 KB
subtask2_01.txt TLE 2103 ms 512 KB
subtask2_02.txt TLE 2103 ms 512 KB
subtask2_03.txt TLE 2103 ms 512 KB
subtask2_04.txt TLE 2103 ms 512 KB
subtask2_05.txt TLE 2103 ms 512 KB
subtask2_06.txt TLE 2103 ms 512 KB
subtask2_07.txt TLE 2103 ms 512 KB
subtask2_08.txt TLE 2103 ms 512 KB
subtask2_09.txt WA 1411 ms 256 KB
subtask2_10.txt TLE 2103 ms 256 KB
subtask2_11.txt TLE 2103 ms 256 KB
subtask2_12.txt WA 198 ms 256 KB