QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#412749#6569. Splitting Pairsgrass8cow#TL 1ms3780kbC++17415b2024-05-16 18:54:452024-05-16 18:54:46

Judging History

你现在查看的是最新测评结果

  • [2024-05-16 18:54:46]
  • 评测
  • 测评结果：TL
  • 用时：1ms
  • 内存：3780kb
查看
  • [2024-05-16 18:54:45]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int n,a[110];
void sol(){
    scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    while(1){
        int ks=0;
        for(int i=1;i<=n;i++)ks+=(a[i]&1);
        if(ks==n){puts("0");return;}
        if(ks||!(n&1)){puts("1");return;}
        for(int i=1;i<=n;i++)a[i]/=2;
    }
}
int main(){
    int T;scanf("%d",&T);while(T--)sol();
    return 0;
}
Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3728kb

input:

4
3
1 1 1
3
1 1 2
3
2 2 2
4
4 4 4 4

output:

0
1
0
1

result:

ok 4 lines

Test #2:

score: 0
Accepted
time: 0ms
memory: 3772kb

input:

1000
10
16 16 16 16 16 16 16 16 16 16
10
16 16 16 16 16 16 16 16 17 16
10
16 16 16 16 16 16 16 18 16 16
10
16 16 16 19 16 16 16 16 16 16
10
16 16 16 16 20 16 16 16 16 16
10
17 16 16 16 17 16 16 16 16 16
10
16 16 16 16 16 16 16 16 18 17
10
16 16 19 16 16 16 16 17 16 16
10
17 16 16 16 16 16 16 20 16 1...

output:

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

result:

ok 1000 lines

Test #3:

score: 0
Accepted
time: 1ms
memory: 3780kb

input:

1000
2
4 4
2
5 4
2
4 6
2
7 4
2
4 8
2
5 5
2
6 5
2
7 5
2
8 5
2
6 6
2
7 6
2
8 6
2
7 7
2
7 8
2
8 8
3
4 4 4
3
4 5 4
3
4 4 6
3
4 7 4
3
8 4 4
3
4 5 5
3
6 4 5
3
4 5 7
3
8 5 4
3
6 4 6
3
7 4 6
3
8 4 6
3
4 7 7
3
7 8 4
3
8 8 4
3
5 5 5
3
5 6 5
3
5 5 7
3
5 8 5
3
6 5 6
3
6 7 5
3
6 5 8
3
7 7 5
3
8 5 7
3
5 8 8
3
6 6...

output:

1
1
1
1
1
0
1
0
1
1
1
1
0
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
0
1
1
1
1
0
1
1
0
1
1
1
1
1
0
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
0
1
1
1
1
0
1
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

result:

ok 1000 lines

Test #4:

score: 0
Accepted
time: 1ms
memory: 3780kb

input:

1000
3
4 4 4
3
4 5 4
3
4 6 4
3
4 7 4
3
4 4 8
3
5 4 5
3
4 5 6
3
5 4 7
3
4 8 5
3
4 6 6
3
6 4 7
3
6 4 8
3
7 7 4
3
4 7 8
3
8 4 8
3
5 5 5
3
5 6 5
3
5 7 5
3
5 8 5
3
6 5 6
3
7 5 6
3
8 6 5
3
7 7 5
3
7 5 8
3
8 8 5
3
6 6 6
3
6 7 6
3
8 6 6
3
7 7 6
3
6 8 7
3
8 6 8
3
7 7 7
3
7 7 8
3
8 8 7
3
8 8 8
5
4 4 4 4 4
5
4...

output:

0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
0
1
1
1
1
0
1
1
0
1
1
1
1
1
0
1
1
0
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
0
1
1
1
1
0
1
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1
1
1
0
1
1
1
1
1
1
1
1
1
...

result:

ok 1000 lines

Test #5:

score: -100
Time Limit Exceeded

input:

1000
49
70984400896 988463235072 689895899136 448069107712 139972313088 432801841152 571884961792 572723822592 147287179264 253252075520 941688356864 914542821376 100344528896 317945020416 796062121984 504306335744 30417092608 36054237184 652314935296 547994206208 335393325056 959203770368 824583389...

output:

result:
English 繁體中文 简体中文

Server Time: 2024-12-05 08:42:11 | OpenSource Project