oj.uz

Submission #711114

# Submission time Handle Problem Language Result Execution time Memory
711114 2023-03-16T08:47:17 Z dozer Lutrija (COCI19_lutrija) C++14
0 / 70
 304 ms 308 KB 
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n";
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define N 200005
#define int long long

const int modulo = 1e9 + 7;
int dp[1005][1005];

bool is_prime(int num)
{
	num = abs(num);
	if (num < 2) return 0;
	for (int i = 2; i * i <= num; i++)
		if (num % i == 0) return 0;
	return 1;
}

vector<int> ans;
void solve(int a, int b)
{
	if (a == b) 
	{
		ans.pb(a);
		return;
	}
	if (is_prime(b - a))
	{ 
		ans.pb(a);
		solve(b, b);
	}
	else if (is_prime(a - 2)) 
	{
		ans.pb(a);
		solve(2, b);
	}
	else if (is_prime(a + 2)) 
	{
		ans.pb(a);
		solve(a + 2, b); 
	}
	else if (is_prime(b - 2))
	{
		solve(a, 2);
		ans.pb(b);
	}
	else if (is_prime(b + 2))
	{
		solve(a, b + 2);
		ans.pb(b);
	}
}	


int32_t main()
{
	fastio();

	int a, b;
	cin>>a>>b;
	solve(a, b);
	if (ans.size() > 30) return 1;
	if (ans.size() && ans.back() == b)
	{
		cout<<ans.size()<<endl;
		for (auto i : ans) cout<<i<<sp;
		cout<<endl;
	}
	else cout<<-1<<endl;
	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " seconds\n";
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 304 KB Output is correct
2 Incorrect 176 ms 304 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 304 KB Output is correct
2 Incorrect 177 ms 308 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 308 KB Output is correct
2 Incorrect 162 ms 300 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 308 KB Output is correct
2 Incorrect 125 ms 304 KB Output isn't correct
3 Halted 0 ms 0 KB -