Advertisement
Saleh127

Live ar 3399

Aug 16th, 2020
97
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.02 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define maX 10008
  4. #define ll long long
  5. vector<ll>p;
  6. bool marked[maX];
  7. void sieve()
  8. {
  9. marked[0]=1;
  10. marked[1]=1;
  11. for(ll i=4;i<=maX;i+=2)
  12. {
  13. marked[i]=1;
  14. }
  15. p.push_back(2);
  16. for(ll i=3;i<=maX;i+=2)
  17. {
  18. if(marked[i]==0)
  19. {
  20. p.push_back(i);
  21. for(ll j=i*i; j<=maX; j+=i+i)
  22. {
  23. marked[j]=1;
  24. }
  25. }
  26. }
  27. }
  28. int main()
  29. {
  30. ios_base::sync_with_stdio(0);
  31. cin.tie(0);cout.tie(0);
  32.  
  33. sieve();
  34. ll a,c,d,e,f,i,j,k,l;
  35. while(cin>>a &&a)
  36. {
  37.  
  38. l=0;
  39. for(i=0;p[i]<=a;i++)
  40. {
  41. k=0;
  42. for(j=i;p[j]<=a;j++)
  43. {
  44. if(k+p[j]<=a)
  45. {
  46. k+=p[j];
  47. if(k==a)
  48. {
  49. l++;
  50. }
  51. }
  52. else break;
  53. }
  54. }
  55. cout<<l<<endl;
  56. }
  57. return 0;
  58. }
  59.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement