Saleh127

rte

Jun 3rd, 2020
121
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.85 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define test int t; cin>>t; while (t--)
  4. #define maX 20000000
  5. #define ll long long int
  6. vector<pair<ll,ll> >twin;
  7. bool marked[maX];
  8. vector<ll>prime;
  9. int main()
  10. {
  11. marked[0]=true;
  12. marked[1]=true;
  13. marked[2]=false;
  14. for(ll i=4; i<=maX; i+=2)
  15. {
  16. marked[i]=true;
  17. }
  18. for(ll i=3; i*i<=maX; i+=2)
  19. {
  20. if(marked[i]==false)
  21. {
  22. for(ll j=i*i; j<=maX; j+=i+i)
  23. {
  24. marked[j]=true;
  25. }
  26. }
  27. }
  28.  
  29. for(ll i=3; i<=maX; i++)
  30. {
  31. if(marked[i]==false && marked[i+2]==false)
  32. {
  33. twin.push_back({i,i+2});
  34. }
  35. }
  36.  
  37. ll a,c;
  38. while(scanf("%lld",&a)==1)
  39. {
  40. a=a-1;
  41. printf("(%lld, %lld)\n",twin[a].first,twin[a].second);
  42. }
  43. return 0;
  44. }
Add Comment
Please, Sign In to add comment