Advertisement
Guest User

Untitled

a guest
Nov 15th, 2017
74
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.60 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. int divizori(int n)
  4. {
  5. int cnt=0,cn=n;
  6. for (int i=2; i*i<=n; i++)
  7. {
  8. if(cn%i==0)
  9. {
  10. cnt++;
  11. while(cn%i==0)
  12. cn=cn/i;
  13. }
  14. }
  15. return cnt;
  16. }
  17. int main()
  18. {
  19. int maxim=0,ca,n,i,a,nrm=0;
  20. cin>>n;
  21. for(i=1; i<=n; i++)
  22. {
  23. cin>>a;
  24. ca=a;
  25. a=divizori(a);
  26. if(maxim==a)
  27. if(nrm>ca)
  28. nrm=ca;
  29. if(maxim<a)
  30. {
  31. maxim=a;
  32. nrm=ca;
  33. }
  34. }
  35. cout<<nrm;
  36. return 0;
  37. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement