Advertisement
DaniDori

Untitled

Oct 17th, 2020
231
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.57 KB | None | 0 0
  1. #include<iostream>
  2. #include<vector>
  3. #include<string>
  4. using namespace std;
  5. bool prime(long long n) {
  6. for (long long i = 2; i <= sqrt(n); i++)
  7. if (n % i == 0)
  8. return false;
  9. return true;
  10. }
  11. int main(){
  12. int n;
  13. cin >> n;
  14. vector<int>arr(n);
  15. arr[0] = 2;
  16. arr[1] = 2;
  17. arr[2] = 4;
  18. arr[3] = 6;
  19. arr[4] = 9;
  20. for (int i = 5; i < n; i++) {
  21. for (int j = 1; j < 9; j++) {
  22. if (prime(arr[i - 4] * 10000 + arr[i - 3] * 1000 + arr[i - 2] * 100 + arr[i - 1] * 10 + j)) {
  23. arr[i] = j;
  24. break;
  25. }
  26. }
  27. }
  28. for (int i = 0; i < n; i++)
  29. cout << arr[i];
  30. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement