Cod sursa(job #752699)
| Utilizator | Data | 29 mai 2012 10:53:07 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[1005];
int main()
{
ifstream f("economie.in");
ofstream g("economie.out");
int N,i,j;
f>>N;
for(i=1;i<=N;i++)
f>>v[i];
sort(v+1,v+N+1);
g<<2<<"\n";
g<<v[1]<<"\n";
int ok=1,x;
i=2;
while(ok&&i<N+1)
{
if(v[i]%v[1]!=0){x=v[i];ok=0;}
i++;
}
if(i<N+1)g<<x;
f.close();
g.close();
return 0;
}