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;
const int maxn = 2e5+10;
int a[maxn];
int main(void)
{
int tc;
cin >> tc;
while (tc--)
{
int n, m;
cin >> n >> m;
if (max(n, m)%min(n, m) == 0)
{
if (n > m)
{
cout << n-1 << "\n";
for (int i = 1; i < n; i++)
cout << "1 ";
cout << "\n";
}
else
{
cout << m-1 << "\n";
for (int i = 1; i < m; i++)
cout << "-1 ";
cout << "\n";
}
}
else
{
if (m == 2)
{
cout << n << "\n";
for (int i = 1; i <= n; i++)
{
if (i%2) cout << "-3 ";
else cout << "4 ";
}
cout << "\n";
}
else
{
cout << m << "\n";
for (int i = 1; i <= m; i++)
{
if (i%2) cout << "3 ";
else cout << "-4 ";
}
cout << "\n";
}
}
}
}
# | 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... |