Submission #456168

#	Time	Username	Problem	Language	Result	Execution time	Memory
456168		Jasiekstrz	Lutrija (COCI19_lutrija)	C++17	14 / 70	175 ms	324 KiB

lutrija

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
bool is_prime(long long x)
{
	if(x<=1)
		return false;
	for(long long i=2;i*i<=x;i++)
	{
		if(x%i==0)
			return false;
	}
	return true;
}
bool solve(vector<long long> t)
{
	for(auto v:t)
	{
		if(!is_prime(v))
			return false;
	}
	for(size_t i=1;i<t.size();i++)
	{
		if(!is_prime(abs(t[i]-t[i-1])))
			return false;
	}
	cout<<t.size()<<"\n";
	for(auto v:t)
		cout<<v<<" ";
	cout<<"\n";
	return true;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	long long a,b;
	cin>>a>>b;
	if(a==2)
	{
		if(solve({a,b-2,b}))
			return 0;
		if(solve({a,b+2,b}))
			return 0;
		cout<<"-1\n";
		return 0;
	}
	else if(b==2)
	{
		if(solve({a,a-2,b}))
			return 0;
		if(solve({a,a+2,b}))
			return 0;
		cout<<"-1\n";
		return 0;
	}
	else
	{
		if(solve({a,2,b}))
			return 0;
		if(abs(b-a)<=30)
		{
			vector<long long> tmp;
			if(a<b)
			{
				for(long long i=a;i<=b;i+=2)
					tmp.push_back(i);
			}
			else
			{
				for(long long i=a;i>=b;i-=2)
					tmp.push_back(i);
			}
			if(solve(tmp))
				return 0;
		}
		cout<<"-1\n";
		return 0;
	}
	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 0 / 7
• Subtask 4: 0 / 7
• Subtask 5: 0 / 7
• Subtask 6: 0 / 7
• Subtask 7: 0 / 7
• Subtask 8: 0 / 7
• Subtask 9: 0 / 7
• Subtask 10: 0 / 7