Advertisement
Guest User

Untitled

a guest
Jan 23rd, 2018
63
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.60 KB | None | 0 0
  1. #include <fstream>
  2. using namespace std;
  3. ifstream fin("factorial3.in");
  4. ofstream fout("factorial3.out");
  5. int n, t, s, cn;
  6. int prim[100001], ciur[100001];
  7. int main()
  8. {
  9. fin>>n;
  10. ciur[0]=1;
  11. ciur[1]=1;
  12. for(int i=2; i*i<=n; i++)
  13. if(ciur[i]==0)
  14. for(int j=i; j*i<=n; j++)
  15. ciur[i*j]=1;
  16. for(int i=2; i<=n; i++)
  17. if(ciur[i]==0)
  18. prim[++t]=i;
  19. for(int i=1; i<=t; i++)
  20. {
  21. cn=n;
  22. while(cn!=0)
  23. {
  24. s=s+cn/prim[i];
  25. cn=cn/prim[i];
  26. }
  27. }
  28. fout<<s;
  29. return 0;
  30. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement