a53

optime

a53
May 9th, 2019
143
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.34 KB | None | 0 0
  1. #include <fstream>
  2. using namespace std;
  3.  
  4. bool ciur[1200001];
  5. int i,j,n,k,v[201], mx,c,ct,nrn,x,p;
  6. unsigned int s;
  7. int main()
  8. {ifstream f("optime.in");
  9. ofstream g("optime.out");
  10. f>>c;
  11. n=1200000;
  12. ciur[1]=1;
  13. for(i=2;i*i<=n;i++)
  14. for(j=2;j<=n/i;j++) ciur[i*j]=1;
  15. if(c==1) {f>>k;
  16. nrn=2*k*k;
  17. i=11;
  18. while(ct<nrn) {if(ciur[i]==0 && i%100>=10) {ct++;
  19. if(ciur[i%100]==1) {x++;
  20. s=s+i%100;}
  21. }
  22.  
  23. i=i+2;
  24. }
  25. g<<s;
  26. }
  27. else {f>>k>>x;
  28. nrn=2*k*k;
  29. i=11;
  30. while(ct<nrn) {if(ciur[i]==0 && i%100>=10) {ct++;
  31. if(ct%k!=0) {if(ciur[i%100]==0) v[ct%k]++;}
  32. else if(ciur[i%100]==0) v[k]++;
  33. }
  34. i=i+2;
  35. }
  36. s=0;
  37. for(i=1;i<=x;i++) s=s+v[i];
  38. mx=s; p=1;
  39. for(i=x+1;i<=k;i++) {s=s+v[i]-v[i-x];
  40. if(s>=mx) {mx=s;
  41. p=i-x+1;}
  42.  
  43. }
  44. g<<p<<'\n'<<mx;}
  45. return 0;
  46. }
Advertisement
Add Comment
Please, Sign In to add comment