Advertisement
Guest User

Untitled

a guest
Nov 11th, 2019
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.52 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int c=0,mx=0;
  4. int keep[1001]={0};
  5. int f(int n,int i){
  6. if(n==i) {
  7. if(n>=mx) mx=n;
  8. keep[n]++;
  9. printf("%d",n);
  10. return 0;
  11. }
  12. if(n%i==0) {
  13. if(n>=mx) mx=n;
  14. keep[i]++;
  15. printf("%dx",i);
  16. return f(n/i,2);
  17. }
  18. return f(n,i+1);
  19. }
  20.  
  21. int main(){
  22. int n;
  23. scanf("%d",&n);
  24. f(n,2);
  25. for(int i=2;i<=mx;i++){
  26. if(keep[i]>0) c++;
  27. }
  28. printf("\n%d",c);
  29.  
  30. return 0;
  31. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement