Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define MAXN 1001
- using namespace std;
- int spf[MAXN],n,x,v[MAXN],a,b;
- int produs_fact_prim(int nr) /// produs factori primi pt. fiecare numar
- {
- int d=2,prodx=1;
- while(nr>1)
- {
- if(nr%d==0)
- {
- prodx*=d;
- while(nr%d==0)
- nr/=d;
- }
- ++d;
- if(d*d>nr)
- {
- prodx*=nr;
- nr=1;
- }
- }
- return prodx;
- }
- int main()
- {
- cin>>n;
- for(int i=1;i<=n;++i)
- {
- cin>>v[i]; /// memorez numere
- spf[i]=produs_fact_prim(v[i]); /// memorez produs factori primi
- }
- for(int i=1;i<n;++i)
- {
- if(spf[i]==spf[i+1]) /// vecini cu acelasi produs factori primi
- {
- if(!a) /// daca nu am gasit nicio pereche
- {
- a=v[i];
- b=v[i+1];
- }
- else /// am cel putin o pereche
- {
- if(a+b<v[i]+v[i+1]) /// daca suma noii perechi e mai mare
- {
- a=v[i];
- b=v[i+1];
- }
- }
- }
- }
- if(a)
- cout<<a<<' '<<b;
- else
- cout<<"NU EXISTA";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement