Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define mx 1000010
- long vp[10001000];
- vector<long>prime;
- void sive()
- {
- long long i,j,k;
- for(i=2; i<mx; i++)
- {
- if(vp[i])
- continue;
- prime.push_back(i);
- for(j=i+i; j<=mx; j+=i)
- vp[j]=i;
- }
- }
- int main()
- {
- sive();
- int a;
- while(scanf("%d",&a)!=EOF)
- {
- long long cnt=0,cnt1=0,i,j;
- long n=a;
- for(i=0;prime[i]<=n; i++)
- {
- a=n;
- while(a/prime[i])
- {
- cnt+=a/prime[i];
- a=a/prime[i];
- }
- }
- printf("%lld\n",cnt);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement