#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10, MOD = 998244353;
void test(){
int n,m;
cin >> n >> m;
if(n == m){
cout << 0 << '\n';
return;
}
if(n > m){
cout << n - 1 << '\n';
for(int i = 1;i <= n - 1;i++){
cout << 1 << ' ';
}
}else{
cout << m - 1 << '\n';
for(int i = 1;i <= m - 1;i++){
cout << -1 << ' ';
}
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int T = 1;
cin >> T;
for(int i = 1;i <= T;i++)
{
test();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
352 KB |
Ok |
2 |
Correct |
0 ms |
348 KB |
Ok |
3 |
Incorrect |
0 ms |
344 KB |
Jury has the better answer : jans = 93, pans = 0 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Jury has the better answer : jans = 1, pans = 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Jury has the better answer : jans = 3, pans = 2 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Jury has the better answer : jans = 3, pans = 2 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
352 KB |
Ok |
2 |
Correct |
0 ms |
348 KB |
Ok |
3 |
Incorrect |
0 ms |
344 KB |
Jury has the better answer : jans = 93, pans = 0 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
352 KB |
Ok |
2 |
Correct |
0 ms |
348 KB |
Ok |
3 |
Incorrect |
0 ms |
344 KB |
Jury has the better answer : jans = 93, pans = 0 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
352 KB |
Ok |
2 |
Correct |
0 ms |
348 KB |
Ok |
3 |
Incorrect |
0 ms |
344 KB |
Jury has the better answer : jans = 93, pans = 0 |
4 |
Halted |
0 ms |
0 KB |
- |