Submission #341930

#	Time	Username	Problem	Language	Result	Execution time	Memory
341930		_ani	Nice sequence (IZhO18_sequence)	C++17	15 / 100	13 ms	876 KiB

sequence

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n, m;
		cin >> n >> m;
		if (max(n, m) % min(n, m) == 0)
		{
			cout << max(n, m) - 1 << '\n';
			if (n < m)
				for (int i = 0; i < max(n, m) - 1; i++)
					cout << -1 << ' ';
			else
				for (int i = 0; i < max(n, m) - 1; i++)
					cout << 1 << ' ';
			cout << '\n';
		}
		//n - <0
		//m - >0
		else if (min(n, m) == 2)
		{
			int q = max(n, m);
			cout << q << '\n';
			int N = 1'000'000;
			if(n < m)
				for (int i = 0; i < q; i++)
				{
					if (i % 2)cout << -(N + 1) << ' ';
					else cout << N << ' ';
				}
			else
				for (int i = 0; i < q; i++)
				{
					if (i % 2)cout << N + 1 << ' ';
					else cout << -N << ' ';
				}
			cout << '\n';
		}
	}
	return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 9 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24