Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- ifstream fin("factorial3.in");
- ofstream fout("factorial3.out");
- int n, t, s, cn;
- int prim[100001], ciur[100001];
- int main()
- {
- fin>>n;
- ciur[0]=1;
- ciur[1]=1;
- for(int i=2; i*i<=n; i++)
- if(ciur[i]==0)
- for(int j=i; j*i<=n; j++)
- ciur[i*j]=1;
- for(int i=2; i<=n; i++)
- if(ciur[i]==0)
- prim[++t]=i;
- for(int i=1; i<=t; i++)
- {
- cn=n;
- while(cn!=0)
- {
- s=s+cn/prim[i];
- cn=cn/prim[i];
- }
- }
- fout<<s;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement