#include using namespace std; typedef long long ll; typedef unsigned long long ull; bool notprime[1001000]; short idx; ll n,i,bound,cnt,test,mid,maybe,UB=1644934082,LB,arr[5000],table[168]={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,101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199,211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293,307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397,401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499,503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599,601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691,701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797,809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887,907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997}; ll calculate(ll k,ll first,ll last){ if(klast)return 0; ll temp=0; while(k=first); return temp; } int main(){ cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0); for(i=0;i<168;i++){ n=table[i]; n*=n; while(n<1000002){ notprime[n]=1; n+=table[i]; } } for(i=2;i<50500;i++){ if(!notprime[i]){ arr[cnt]=i*i; cnt++; } } cin>>n; LB=n; while(1){ mid=(UB+LB)>>1; test=mid-calculate(mid,0,5135); if(test>=n)UB=mid; else if(test

제출 #96458

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: