#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
cout << max(0,max(n, m) - 1) << '\n';
for (int i = 0; i < max(n, m)-1; ++i) {
if (m < n) {
cout << "1 ";
}
else cout << "-1 ";
}
cout << "\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Ok |
2 |
Correct |
0 ms |
256 KB |
Ok |
3 |
Correct |
0 ms |
256 KB |
Ok |
4 |
Correct |
1 ms |
256 KB |
Ok |
5 |
Correct |
1 ms |
256 KB |
Ok |
6 |
Correct |
1 ms |
256 KB |
Ok |
7 |
Correct |
1 ms |
256 KB |
Ok |
8 |
Correct |
1 ms |
256 KB |
Ok |
9 |
Correct |
1 ms |
256 KB |
Ok |
10 |
Correct |
1 ms |
256 KB |
Ok |
11 |
Correct |
1 ms |
256 KB |
Ok |
12 |
Correct |
1 ms |
256 KB |
Ok |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Jury has the better answer : jans = 3, pans = 2 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
256 KB |
Jury has the better answer : jans = 3, pans = 2 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Jury has the better answer : jans = 3, pans = 2 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Ok |
2 |
Correct |
0 ms |
256 KB |
Ok |
3 |
Correct |
0 ms |
256 KB |
Ok |
4 |
Correct |
1 ms |
256 KB |
Ok |
5 |
Correct |
1 ms |
256 KB |
Ok |
6 |
Correct |
1 ms |
256 KB |
Ok |
7 |
Correct |
1 ms |
256 KB |
Ok |
8 |
Correct |
1 ms |
256 KB |
Ok |
9 |
Correct |
1 ms |
256 KB |
Ok |
10 |
Correct |
1 ms |
256 KB |
Ok |
11 |
Correct |
1 ms |
256 KB |
Ok |
12 |
Correct |
1 ms |
256 KB |
Ok |
13 |
Incorrect |
1 ms |
256 KB |
Jury has the better answer : jans = 3, pans = 2 |
14 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Ok |
2 |
Correct |
0 ms |
256 KB |
Ok |
3 |
Correct |
0 ms |
256 KB |
Ok |
4 |
Correct |
1 ms |
256 KB |
Ok |
5 |
Correct |
1 ms |
256 KB |
Ok |
6 |
Correct |
1 ms |
256 KB |
Ok |
7 |
Correct |
1 ms |
256 KB |
Ok |
8 |
Correct |
1 ms |
256 KB |
Ok |
9 |
Correct |
1 ms |
256 KB |
Ok |
10 |
Correct |
1 ms |
256 KB |
Ok |
11 |
Correct |
1 ms |
256 KB |
Ok |
12 |
Correct |
1 ms |
256 KB |
Ok |
13 |
Incorrect |
0 ms |
256 KB |
Jury has the better answer : jans = 3, pans = 2 |
14 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Ok |
2 |
Correct |
0 ms |
256 KB |
Ok |
3 |
Correct |
0 ms |
256 KB |
Ok |
4 |
Correct |
1 ms |
256 KB |
Ok |
5 |
Correct |
1 ms |
256 KB |
Ok |
6 |
Correct |
1 ms |
256 KB |
Ok |
7 |
Correct |
1 ms |
256 KB |
Ok |
8 |
Correct |
1 ms |
256 KB |
Ok |
9 |
Correct |
1 ms |
256 KB |
Ok |
10 |
Correct |
1 ms |
256 KB |
Ok |
11 |
Correct |
1 ms |
256 KB |
Ok |
12 |
Correct |
1 ms |
256 KB |
Ok |
13 |
Incorrect |
0 ms |
256 KB |
Jury has the better answer : jans = 3, pans = 2 |
14 |
Halted |
0 ms |
0 KB |
- |