Submission #2934325

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
string s1="titech*";
string s;
int point;
int main()
{
	cin>>s;
	for(int i=0;i<=s.size();i++)
	if(s[i]==s1[point])
	point++;
	if(s1[point]=='*')
	cout<<"Yes"<<endl;
	else
	cout<<"No"<<endl;
}

Submission Info

Submission Time
Task G - titech分離
User luogu_bot2
Language C++ (GCC 5.4.1)
Score 0
Code Size 303 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 4
AC × 42
WA × 17
Set Name Test Cases
Sample 00-example1.txt, 00-example2.txt, 00-example3.txt, 00-example4.txt
All 00-example1.txt, 00-example2.txt, 00-example3.txt, 00-example4.txt, 01-hand00.txt, 01-hand01.txt, 01-hand02.txt, 01-hand03.txt, 01-hand04.txt, 01-hand05.txt, 01-hand06.txt, 01-hand07.txt, 01-hand08.txt, 01-hand09.txt, 10-randomA00.txt, 10-randomA01.txt, 10-randomA02.txt, 10-randomA03.txt, 10-randomA04.txt, 10-randomA05.txt, 10-randomA06.txt, 10-randomA07.txt, 10-randomA08.txt, 10-randomA09.txt, 10-randomA10.txt, 10-randomA11.txt, 10-randomA12.txt, 10-randomA13.txt, 10-randomA14.txt, 20-randomB00.txt, 20-randomB01.txt, 20-randomB02.txt, 20-randomB03.txt, 20-randomB04.txt, 20-randomB05.txt, 20-randomB06.txt, 20-randomB07.txt, 20-randomB08.txt, 20-randomB09.txt, 20-randomB10.txt, 20-randomB11.txt, 20-randomB12.txt, 20-randomB13.txt, 20-randomB14.txt, 25-randomC00.txt, 25-randomC01.txt, 25-randomC02.txt, 25-randomC03.txt, 25-randomC04.txt, 25-randomC05.txt, 25-randomC06.txt, 25-randomC07.txt, 25-randomC08.txt, 25-randomC09.txt, 30-special00.txt, 30-special01.txt, 30-special02.txt, 30-special03.txt, 30-special04.txt
Case Name Status Exec Time Memory
00-example1.txt AC 1 ms 256 KB
00-example2.txt AC 1 ms 256 KB
00-example3.txt AC 1 ms 256 KB
00-example4.txt AC 1 ms 256 KB
01-hand00.txt AC 1 ms 256 KB
01-hand01.txt AC 1 ms 256 KB
01-hand02.txt AC 1 ms 256 KB
01-hand03.txt WA 1 ms 256 KB
01-hand04.txt AC 1 ms 256 KB
01-hand05.txt AC 1 ms 256 KB
01-hand06.txt AC 1 ms 256 KB
01-hand07.txt AC 1 ms 256 KB
01-hand08.txt WA 1 ms 256 KB
01-hand09.txt WA 1 ms 256 KB
10-randomA00.txt WA 1 ms 256 KB
10-randomA01.txt AC 1 ms 256 KB
10-randomA02.txt WA 1 ms 256 KB
10-randomA03.txt AC 1 ms 256 KB
10-randomA04.txt AC 1 ms 256 KB
10-randomA05.txt WA 1 ms 256 KB
10-randomA06.txt AC 1 ms 256 KB
10-randomA07.txt WA 1 ms 256 KB
10-randomA08.txt WA 1 ms 256 KB
10-randomA09.txt WA 1 ms 256 KB
10-randomA10.txt AC 1 ms 256 KB
10-randomA11.txt WA 1 ms 256 KB
10-randomA12.txt WA 1 ms 256 KB
10-randomA13.txt AC 1 ms 256 KB
10-randomA14.txt WA 1 ms 256 KB
20-randomB00.txt AC 1 ms 256 KB
20-randomB01.txt AC 1 ms 256 KB
20-randomB02.txt AC 1 ms 256 KB
20-randomB03.txt AC 1 ms 256 KB
20-randomB04.txt AC 1 ms 256 KB
20-randomB05.txt WA 1 ms 256 KB
20-randomB06.txt AC 1 ms 256 KB
20-randomB07.txt AC 1 ms 256 KB
20-randomB08.txt AC 1 ms 256 KB
20-randomB09.txt WA 1 ms 256 KB
20-randomB10.txt AC 1 ms 256 KB
20-randomB11.txt AC 1 ms 256 KB
20-randomB12.txt WA 1 ms 256 KB
20-randomB13.txt WA 1 ms 256 KB
20-randomB14.txt AC 1 ms 256 KB
25-randomC00.txt AC 1 ms 256 KB
25-randomC01.txt AC 1 ms 256 KB
25-randomC02.txt AC 1 ms 256 KB
25-randomC03.txt AC 1 ms 256 KB
25-randomC04.txt AC 1 ms 256 KB
25-randomC05.txt AC 1 ms 256 KB
25-randomC06.txt AC 1 ms 256 KB
25-randomC07.txt AC 1 ms 256 KB
25-randomC08.txt AC 1 ms 256 KB
25-randomC09.txt AC 1 ms 256 KB
30-special00.txt AC 1 ms 256 KB
30-special01.txt AC 1 ms 256 KB
30-special02.txt WA 1 ms 256 KB
30-special03.txt AC 1 ms 256 KB
30-special04.txt AC 1 ms 256 KB