#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define MOD (1e9+7)
#define all(x) x.begin(), x.end()
const int N = 1e6, K = 20;
int n, m, sw = 1;
vector<int> ans;
void solve(){
cin >> n >> m;
if(n < m) swap(n, m), sw = -1;
if(n % m == 0){
cout << n - 1;
if(n > 1){
cout << '\n';
for(int i = 0; i < n - 1; ++i) cout << sw << ' ';
}
return;
}else{
cout << n << '\n';
for(int i = 0; i < n; ++i){
if(i % 2) cout << sw * (n/2 + 2) << ' ';
else cout << sw * -(n/2+1) << ' ';
}
return;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int t; cin >> t;
while(t--){
solve();
if(t > 0) cout << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
there is incorrect sequence |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
there is incorrect sequence |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Ok |
2 |
Incorrect |
0 ms |
212 KB |
there is incorrect sequence |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Jury has the better answer : jans = 5, pans = 4 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
there is incorrect sequence |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
there is incorrect sequence |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
there is incorrect sequence |
2 |
Halted |
0 ms |
0 KB |
- |