#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, m;
cin >> n >> m;
bool tr = false;
if (n > m) {
tr = true;
swap(n, m);
}
vector<int> v;
if (!(m % n)) {
for (int i = 1; i < m; i++)
v.push_back(-1);
}
else {
int x = m / n + 1;
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++)
v.push_back(x);
if (i + 1 != m) v.push_back(-(x * (n - 1) + 1));
}
}
cout << (int)v.size() << '\n';
for (auto i : v)
cout << i * (tr ? -1 : 1) << ' ';
if (!v.empty()) cout << '\n';
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int T;
cin >> T;
while (T--) solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Correct |
1 ms |
336 KB |
Ok |
4 |
Correct |
1 ms |
336 KB |
Ok |
5 |
Correct |
1 ms |
508 KB |
Ok |
6 |
Correct |
1 ms |
336 KB |
Ok |
7 |
Correct |
1 ms |
336 KB |
Ok |
8 |
Correct |
1 ms |
336 KB |
Ok |
9 |
Correct |
1 ms |
336 KB |
Ok |
10 |
Correct |
1 ms |
336 KB |
Ok |
11 |
Correct |
1 ms |
336 KB |
Ok |
12 |
Correct |
1 ms |
336 KB |
Ok |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
504 KB |
there is incorrect sequence |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
508 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Incorrect |
1 ms |
336 KB |
there is incorrect sequence |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
there is incorrect sequence |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Correct |
1 ms |
336 KB |
Ok |
4 |
Correct |
1 ms |
336 KB |
Ok |
5 |
Correct |
1 ms |
508 KB |
Ok |
6 |
Correct |
1 ms |
336 KB |
Ok |
7 |
Correct |
1 ms |
336 KB |
Ok |
8 |
Correct |
1 ms |
336 KB |
Ok |
9 |
Correct |
1 ms |
336 KB |
Ok |
10 |
Correct |
1 ms |
336 KB |
Ok |
11 |
Correct |
1 ms |
336 KB |
Ok |
12 |
Correct |
1 ms |
336 KB |
Ok |
13 |
Correct |
1 ms |
508 KB |
Ok |
14 |
Correct |
1 ms |
336 KB |
Ok |
15 |
Incorrect |
1 ms |
336 KB |
there is incorrect sequence |
16 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Correct |
1 ms |
336 KB |
Ok |
4 |
Correct |
1 ms |
336 KB |
Ok |
5 |
Correct |
1 ms |
508 KB |
Ok |
6 |
Correct |
1 ms |
336 KB |
Ok |
7 |
Correct |
1 ms |
336 KB |
Ok |
8 |
Correct |
1 ms |
336 KB |
Ok |
9 |
Correct |
1 ms |
336 KB |
Ok |
10 |
Correct |
1 ms |
336 KB |
Ok |
11 |
Correct |
1 ms |
336 KB |
Ok |
12 |
Correct |
1 ms |
336 KB |
Ok |
13 |
Incorrect |
1 ms |
504 KB |
there is incorrect sequence |
14 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Ok |
2 |
Correct |
1 ms |
336 KB |
Ok |
3 |
Correct |
1 ms |
336 KB |
Ok |
4 |
Correct |
1 ms |
336 KB |
Ok |
5 |
Correct |
1 ms |
508 KB |
Ok |
6 |
Correct |
1 ms |
336 KB |
Ok |
7 |
Correct |
1 ms |
336 KB |
Ok |
8 |
Correct |
1 ms |
336 KB |
Ok |
9 |
Correct |
1 ms |
336 KB |
Ok |
10 |
Correct |
1 ms |
336 KB |
Ok |
11 |
Correct |
1 ms |
336 KB |
Ok |
12 |
Correct |
1 ms |
336 KB |
Ok |
13 |
Incorrect |
1 ms |
504 KB |
there is incorrect sequence |
14 |
Halted |
0 ms |
0 KB |
- |