Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- int a[101],n;
- int f[1000]={0};//pt divizorii primi retin exponentul maxim
- cin>>n;
- for(int i=1;i<=n;i++)
- cin>>a[i];
- for(int i=1;i<=n;i++)
- {
- int x=a[i],d=2;
- while(x>1)//descompunere in factori primi
- if(x%d==0)
- {
- int e=0;
- while(x%d==0)
- {//calculez exponentul
- e++;
- x=x/d;
- }
- if(e>f[d]) f[d]=e; //daca e mai mare, retin factorul prim
- }
- else d++;
- }
- int p=1;//cmmdc=produsul factorilor primi la puterea cea mai mare
- for(int i=2;i<=999;i++)
- for(int j=1;j<=f[i];j++)
- p=p*i;
- cout<<p;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement