Submission #91975

#	Time	Username	Problem	Language	Result	Execution time	Memory
91975		emil_physmath	Nice sequence (IZhO18_sequence)	C++17	6 / 100	2 ms	376 KiB

sequence

#include <iostream>
#include <stdio.h>
using namespace std;

void SubTaskOne(int n, int m);
void SubTaskTwo(int n, int m);
void SubTaskThree(int n, int m);
void SubTaskFour(int n, int m);
int main()
{
	int T, n, m;
	cin>>T;
	while (T--)
	{
		cin>>n>>m;
		if (max(n, m)%min(n, m)==0)
			SubTaskOne(n, m);
		else if (max(n, m)<=10000 && min(n, m)==2)
			SubTaskTwo(n, m);
		else if (max(n, m)<=10)
			SubTaskThree(n, m);
		else if (max(n, m)-min(n, m)<=2)
			SubTaskFour(n, m);
		else
			return 0;
	}

	char I;
	cin >> I;
	return 0;
}

void SubTaskOne(int n, int m)
{
	int fillNum=(n%m==0)?1:-1;
	cout<<max(n, m)-1<<'\n';
	for (int i=1; i<max(n, m); i++)
		printf("%d ", fillNum);
	cout<<'\n';
}

void SubTaskTwo(int n, int m)
{
}

void SubTaskThree(int n, int m)
{
}

void SubTaskFour(int n, int m)
{
}

• 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