Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define test int t; cin>>t; while (t--)
- #define maX 20000000
- #define ll long long int
- vector<pair<ll,ll> >twin;
- bool marked[maX];
- vector<ll>prime;
- int main()
- {
- marked[0]=true;
- marked[1]=true;
- marked[2]=false;
- for(ll i=4; i<=maX; i+=2)
- {
- marked[i]=true;
- }
- for(ll i=3; i*i<=maX; i+=2)
- {
- if(marked[i]==false)
- {
- for(ll j=i*i; j<=maX; j+=i+i)
- {
- marked[j]=true;
- }
- }
- }
- for(ll i=3; i<=maX; i++)
- {
- if(marked[i]==false && marked[i+2]==false)
- {
- twin.push_back({i,i+2});
- }
- }
- ll a,c;
- while(scanf("%lld",&a)==1)
- {
- a=a-1;
- printf("(%lld, %lld)\n",twin[a].first,twin[a].second);
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment