oj.uz

Submission #91975

# Submission time Handle Problem Language Result Execution time Memory
91975 2018-12-31T17:43:37 Z emil_physmath Nice sequence (IZhO18_sequence) C++17
6 / 100
 2 ms 376 KB 
#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.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Ok
2 Correct 2 ms 256 KB Ok
3 Correct 2 ms 376 KB Ok
4 Correct 2 ms 376 KB Ok
5 Correct 2 ms 376 KB Ok
6 Correct 2 ms 376 KB Ok
7 Correct 2 ms 256 KB Ok
8 Correct 2 ms 376 KB Ok
9 Correct 2 ms 256 KB Ok
10 Correct 2 ms 376 KB Ok
11 Correct 2 ms 376 KB Ok
12 Correct 2 ms 376 KB Ok

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Jury has the better answer : jans = 3, pans = 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB there is incorrect sequence
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Ok
2 Correct 2 ms 256 KB Ok
3 Correct 2 ms 376 KB Ok
4 Correct 2 ms 376 KB Ok
5 Correct 2 ms 376 KB Ok
6 Correct 2 ms 376 KB Ok
7 Correct 2 ms 256 KB Ok
8 Correct 2 ms 376 KB Ok
9 Correct 2 ms 256 KB Ok
10 Correct 2 ms 376 KB Ok
11 Correct 2 ms 376 KB Ok
12 Correct 2 ms 376 KB Ok
13 Incorrect 2 ms 256 KB Jury has the better answer : jans = 3, pans = 0
14 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Ok
2 Correct 2 ms 256 KB Ok
3 Correct 2 ms 376 KB Ok
4 Correct 2 ms 376 KB Ok
5 Correct 2 ms 376 KB Ok
6 Correct 2 ms 376 KB Ok
7 Correct 2 ms 256 KB Ok
8 Correct 2 ms 376 KB Ok
9 Correct 2 ms 256 KB Ok
10 Correct 2 ms 376 KB Ok
11 Correct 2 ms 376 KB Ok
12 Correct 2 ms 376 KB Ok
13 Incorrect 2 ms 376 KB there is incorrect sequence
14 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Ok
2 Correct 2 ms 256 KB Ok
3 Correct 2 ms 376 KB Ok
4 Correct 2 ms 376 KB Ok
5 Correct 2 ms 376 KB Ok
6 Correct 2 ms 376 KB Ok
7 Correct 2 ms 256 KB Ok
8 Correct 2 ms 376 KB Ok
9 Correct 2 ms 256 KB Ok
10 Correct 2 ms 376 KB Ok
11 Correct 2 ms 376 KB Ok
12 Correct 2 ms 376 KB Ok
13 Incorrect 2 ms 376 KB there is incorrect sequence
14 Halted 0 ms 0 KB -