oj.uz

Submission #205410

# Submission time Handle Problem Language Result Execution time Memory
205410 2020-02-28T20:35:49 Z luciocf Lutrija (COCI19_lutrija) C++14
70 / 70
 265 ms 380 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

bool prime(ll x)
{
	if (x <= 1) return 0;

	for (int i = 2; 1ll*i*i <= x; i++)
		if (x%i == 0)
			return false;

	return true; 
}

int main(void)
{
	ll a, b;
	scanf("%lld %lld", &a, &b);

	if (abs(b-a) == 2)
	{
		printf("2\n%lld %lld\n", a, b);
		return 0;
	}

	if (b-a == 4 && prime(a+2))
	{
		printf("3\n%lld %lld %lld\n", a, a+2, b);
		return 0;
	}

	if (a-b == 4 && prime(b+2))
	{
		printf("3\n%lld %lld %lld\n", b, b+2, a);
		return 0;
	}

	if (a < b)
	{
		if (a == 2)
		{
			if (prime(b-2)) printf("2\n2 %lld\n", b);
			else if (prime(b+2)) printf("3\n2 %lld %lld\n", b+2, b);
			else printf("-1\n");
		}
		else
		{
			if (!prime(a-2) && !prime(a+2)) printf("-1\n");
			else
			{
				if (!prime(b-2) && !prime(b+2)) printf("-1\n");
				else
				{
					if (prime(a-2) && prime(b-2)) printf("3\n%lld 2 %lld\n", a, b);
					else if (prime(a-2) && prime(b+2)) printf("4\n%lld 2 %lld %lld\n", a, b+2, b);
					else if (prime(a+2) && prime(b-2)) printf("4\n%lld %lld 2 %lld\n", a, a+2, b);
					else printf("5\n%lld %lld 2 %lld %lld\n", a, a+2, b+2, b);
				}
			}
		}
	}
	else
	{
		if (b == 2)
		{
			if (prime(a-2)) printf("2\n%lld 2\n", a);
			else if (prime(a+2)) printf("3\n%lld %lld 2\n", a, a+2);
			else printf("-1\n");
		}
		else
		{
			if (!prime(b-2) && !prime(b+2)) printf("-1\n");
			else
			{
				if (!prime(a-2) && !prime(a+2)) printf("-1\n");
				else
				{
					if (prime(b-2) && prime(a-2)) printf("3\n%lld 2 %lld\n", a, b);
					else if (prime(b-2) && prime(a+2)) printf("4\n%lld 2 %lld %lld\n", a, a+2, b);
					else if (prime(b+2) && prime(a-2)) printf("4\n%lld 2 %lld %lld\n", a, b+2, b);
					else printf("5\n%lld %lld 2 %lld %lld\n", a, a+2, b+2, b);
				}
			}
		}
	}
}

Compilation message

lutrija.cpp: In function 'int main()':
lutrija.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld", &a, &b);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 5 ms 376 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 376 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct