Cod sursa(job #2254069)
Utilizator | Data | 4 octombrie 2018 19:13:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>;
using namespace std;
int main()
{
int n, v[20000];
cin>>n;
for(int i=0;i<n;i++){
cin>>v[i];
}
for(int i=n;i>=0;i--){
for(int j=i-1;j>=0;j--){
if(v[j]!=v[i]){
if(v[j]+v[i]==42000000){
if(v[i]>v[j]){
cout<<v[j]<<endl;
cout<<v[i]<<endl;
return 0;
}else{
cout<<v[i]<<endl;
cout<<v[j]<<endl;
return 0;
}
}
}
}
}
}