제출 #290506

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290506		luciocf	Nice sequence (IZhO18_sequence)	C++14	6 / 100	1 ms	384 KiB

sequence

#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)
			{
				if (n == 3)
				{
					cout << "3\n-3 4 -3\n";
				}
				else
				{
					cout << n-1 << "\n";
					for (int i = 1; i < n; i++)
						cout << "1 ";
					cout << "\n";
				}
			}
			else
			{
				if (m == 3)
				{
					cout << "3\n3 -4 2\n";
				}
				else
				{
					cout << m-1 << "\n";
					for (int i = 1; i < m; i++)
						cout << "-1 ";
					cout << "\n";
				}
			}
		}
	}
}

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