NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #200723 | #164. 字符串游戏 | yizhiming | 100 | 12ms | 1160kb | C++11 | 677b | 2024-01-11 07:42:49 | 2024-01-11 12:01:33 |
answer
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
using namespace std;
int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int N = 1e3+5;
int T,n;
char s[N];
void init(){
scanf("%s",s+1);
n = strlen(s+1);
int ans = 0;
int las = s[1]-'0';
for(int i=2;i<=n;i++){
if(s[i]-'0'==las){
ans++;
}
las = s[i]-'0';
}
if(ans<2){
cout<<"Zhangzj\n";
}else{
cout<<"Owaski\n";
}
}
int main(){
T = read();
while(T--){
init();
}
return 0;
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1156kb
input:
8 000 001 010 011 100 101 110 111
output:
Owaski Zhangzj Zhangzj Zhangzj Zhangzj Zhangzj Zhangzj Owaski
result:
ok 8 lines
Test #2:
score: 10
Accepted
time: 0ms
memory: 1156kb
input:
16 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111
output:
Owaski Owaski Zhangzj Owaski Zhangzj Zhangzj Zhangzj Owaski Owaski Zhangzj Zhangzj Zhangzj Owaski Zh...
result:
ok 16 lines
Test #3:
score: 10
Accepted
time: 0ms
memory: 1156kb
input:
32 00000 00010 00100 00110 01000 01010 01100 01110 10000 10010 10100 10110 11000 11010 11100 11110 0...
output:
Owaski Owaski Owaski Owaski Owaski Zhangzj Owaski Owaski Owaski Zhangzj Zhangzj Zhangzj Owaski Zhang...
result:
ok 32 lines
Test #4:
score: 10
Accepted
time: 0ms
memory: 1160kb
input:
1000 1100 1100011 1 10010010 01 0 01 1101 110110 0 0000101 00101 111 10000 001111 000111011 10 011 1...
output:
Owaski Owaski Zhangzj Owaski Zhangzj Zhangzj Zhangzj Zhangzj Owaski Zhangzj Owaski Zhangzj Owaski Ow...
result:
ok 1000 lines
Test #5:
score: 10
Accepted
time: 0ms
memory: 1156kb
input:
1000 001010 001100010 0110100 00101 1011000010 100001 0 001101 110 101000 1 1010100000 0001 100 0 11...
output:
Zhangzj Owaski Owaski Zhangzj Owaski Owaski Zhangzj Owaski Zhangzj Owaski Zhangzj Owaski Owaski Zhan...
result:
ok 1000 lines
Test #6:
score: 10
Accepted
time: 0ms
memory: 1160kb
input:
1000 000000101 00 000100110 0111010 1100101101 00 0000 00011 101111110 011 10000010 01010011 1 1000 ...
output:
Owaski Zhangzj Owaski Owaski Owaski Zhangzj Owaski Owaski Owaski Zhangzj Owaski Owaski Zhangzj Owask...
result:
ok 1000 lines
Test #7:
score: 10
Accepted
time: 4ms
memory: 1160kb
input:
1000 10101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101...
output:
Zhangzj Owaski Owaski Zhangzj Zhangzj Zhangzj Zhangzj Owaski Owaski Owaski Zhangzj Zhangzj Zhangzj Z...
result:
ok 1000 lines
Test #8:
score: 10
Accepted
time: 3ms
memory: 1156kb
input:
1000 01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010...
output:
Zhangzj Owaski Owaski Zhangzj Zhangzj Owaski Owaski Zhangzj Owaski Owaski Owaski Owaski Zhangzj Owas...
result:
ok 1000 lines
Test #9:
score: 10
Accepted
time: 5ms
memory: 1160kb
input:
1000 01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010...
output:
Zhangzj Zhangzj Zhangzj Zhangzj Owaski Owaski Zhangzj Zhangzj Owaski Zhangzj Zhangzj Owaski Owaski Z...
result:
ok 1000 lines
Test #10:
score: 10
Accepted
time: 0ms
memory: 1156kb
input:
1000 01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010...
output:
Zhangzj Owaski Owaski Zhangzj Zhangzj Owaski Owaski Owaski Owaski Owaski Zhangzj Zhangzj Owaski Zhan...
result:
ok 1000 lines
