Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<vector>
- #include<string>
- using namespace std;
- bool prime(long long n) {
- for (long long i = 2; i <= sqrt(n); i++)
- if (n % i == 0)
- return false;
- return true;
- }
- int main(){
- int n;
- cin >> n;
- vector<int>arr(n);
- arr[0] = 2;
- arr[1] = 2;
- arr[2] = 4;
- arr[3] = 6;
- arr[4] = 9;
- for (int i = 5; i < n; i++) {
- for (int j = 1; j < 9; j++) {
- if (prime(arr[i - 4] * 10000 + arr[i - 3] * 1000 + arr[i - 2] * 100 + arr[i - 1] * 10 + j)) {
- arr[i] = j;
- break;
- }
- }
- }
- for (int i = 0; i < n; i++)
- cout << arr[i];
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement