fork download
  1. #include <iostream>
  2. #include <unordered_map>
  3. #include <vector>
  4.  
  5. using namespace std;
  6.  
  7. vector<int> prime = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 };
  8. unordered_map<int, bool> m;
  9.  
  10. int main()
  11. {
  12. for (int i = 0; i < prime.size(); i++)
  13. {
  14. for (int j = i + 1; j < prime.size(); j++)
  15. {
  16. m[prime[i] + prime[j]] = true;
  17. }
  18. }
  19. for (int i = 11; i <= 198; i++)
  20. {
  21. if (!m[i])
  22. cout << i << " ";
  23. }
  24. cout << endl;
  25. system("PAUSE");
  26. return 0;
  27. }
Success #stdin #stdout #stderr 0s 3276KB
stdin
Standard input is empty
stdout
11 17 23 27 29 35 37 41 47 51 53 57 59 65 67 71 77 79 83 87 89 93 95 97 101 103 105 107 109 111 113 115 117 119 121 123 125 127 129 131 133 135 137 139 141 143 145 147 149 151 153 155 157 159 161 163 165 166 167 169 171 173 174 175 177 178 179 181 182 183 184 185 187 188 189 190 191 192 193 194 195 196 197 198 
stderr
sh: 1: PAUSE: not found