# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
847089 | GrandTiger1729 | Nice sequence (IZhO18_sequence) | C++17 | 6 ms | 1116 KiB |
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;
int main()
{
cin.tie(0)->sync_with_stdio(0);
int t; cin >> t;
while (t--)
{
int n, m; cin >> n >> m;
if (n == m)
{
cout << n - 1 << '\n';
for (int i = 0; i < n - 1; i++)
cout << 1 << " \n"[i == n - 2];
continue;
}
bool flag = 0;
if (n < m)
{
swap(n, m);
flag = 1;
}
vector<int> ans;
if (n % m == 0)
{
ans = vector<int>(n - 1, 1);
if (flag)
{
for (int &i : ans)
i = -i;
}
cout << ans.size() << '\n';
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " \n"[i + 1 == ans.size()];
continue;
}
if (m == 2)
{
ans = vector<int>(n, -1e8);
for (int i = 1; i < n; i += 2)
ans[i] = 1e8 + 1;
if (flag)
{
for (int &i : ans)
i = -i;
}
cout << ans.size() << '\n';
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " \n"[i + 1 == ans.size()];
continue;
}
if (flag)
{
for (int &i : ans)
i = -i;
}
}
return 0;
}
Compilation message (stderr)
# | 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... |