This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
if (n == 2 && m % 2 == 1 && m > n) {
cout << m << '\n';
for (int i = 0; i < m / 2; ++i) {
cout << m << ' ' << -m - 1 << ' ';
}
cout << m << '\n';
return;
}
if (m == 2 && n % 2 == 1 && n > m) {
cout << n << '\n';
cout << '\n';
for (int i = 0; i < n / 2; ++i) {
cout << -n << ' ' << n + 1 << ' ';
}
cout << -n << '\n';
return;
}
if (n <= m) {
cout << m - 1 << '\n';
for (int i = 0; i < m - 1; ++i) {
cout << -1 << ' ';
}
cout << '\n';
return;
}
if (m <= n) {
cout << n - 1 << '\n';
for (int i = 0; i < n - 1; ++i) {
cout << 1 << ' ';
}
cout << '\n';
return;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |