Submission #290510

#TimeUsernameProblemLanguageResultExecution timeMemory
290510luciocfNice sequence (IZhO18_sequence)C++14
6 / 100
1 ms256 KiB
#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 << "-2 ";
					else cout << "3 ";
				}
			}
			else
			{
				cout << m << "\n";
				for (int i = 1; i <= m; i++)
				{
					if (i%2) cout << "2 ";
					else cout << "-3 ";
				}
			}
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...