#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define sz(v) (int)(v).size()
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 <= n; i++) {
for (int j = 1; j < n; j++)
v.push_back(x);
if (i < n) v.push_back(-(x * (n - 1) + 1));
}
}
if (tr) {
swap(n, m);
for (auto &i : v)
i *= -1;
}
ll sm1 = 0, sm2 = 0;
for (int i = 0; i < sz(v); i++) {
sm1 += v[i] - (n <= i ? v[i - n] : 0);
sm2 += v[i] - (m <= i ? v[i - m] : 0);
if (n - 1 <= i) assert(sm1 < 0);
if (m - 1 <= i) {
// if (sm2 <= 0) {
// cout << i - m + 1 << ' ' << i << ' ' << sm2 << '\n';
// }
assert(sm2 > 0);
}
}
cout << sz(v) << '\n';
for (auto i : v)
cout << i * (tr ? -1 : 1) << ' ';
if (!v.empty()) cout << '\n';
}
int32_t main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int T;
cin >> T;
while (T--) solve();
}
# |
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 |
Incorrect |
1 ms |
336 KB |
there is incorrect sequence |
2 |
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 |
Runtime error |
2 ms |
592 KB |
Execution killed with signal 6 |
2 |
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 |
Incorrect |
1 ms |
336 KB |
there is incorrect sequence |
2 |
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 |
- |