Advertisement
Guest User

Untitled

a guest
Oct 16th, 2019
109
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.69 KB | None | 0 0
  1. #include <iostream>
  2. #include <vector>
  3.  
  4. std::vector<int> givePrimes(int num){
  5. std::vector<int> pri;
  6. for(int i=2; i<=num; i++){
  7. bool isPrime = true;
  8. for(int j=2; j<i; j++){
  9. if(i%j == 0){
  10. isPrime = false;
  11. break;
  12. }
  13. }
  14. if(isPrime){
  15. pri.push_back(i);
  16. }
  17. }
  18. return pri;
  19. }
  20.  
  21. int main(){
  22. int n = 1;
  23. while(!n%2 || n<3){
  24. std::cin >> n;
  25. }
  26. std::vector<int> primes = givePrimes(n);
  27. for(int i=4; i<=n; i+=2){
  28. std::cout << "Liczba: " << i << "\n";
  29. for(int z=0; z<primes.size(); z++){
  30. for(int x=0; x<primes.size(); x++){
  31. if(primes[z]+primes[x] == i){
  32. std::cout << "[" << primes[z] << ", " << primes[x] << "]\n";
  33. }
  34. }
  35. }
  36. }
  37. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement