Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int divizori(int n)
- {
- int cnt=0,cn=n;
- for (int i=2; i*i<=n; i++)
- {
- if(cn%i==0)
- {
- cnt++;
- while(cn%i==0)
- cn=cn/i;
- }
- }
- return cnt;
- }
- int main()
- {
- int maxim=0,ca,n,i,a,nrm=0;
- cin>>n;
- for(i=1; i<=n; i++)
- {
- cin>>a;
- ca=a;
- a=divizori(a);
- if(maxim==a)
- if(nrm>ca)
- nrm=ca;
- if(maxim<a)
- {
- maxim=a;
- nrm=ca;
- }
- }
- cout<<nrm;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement