Cod sursa(job #2570479)
| Utilizator | Data | 4 martie 2020 17:03:51 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int n,v1[10000],v2[10000], afis[10000];
int main()
{ ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
int u=0;
for( int i=1;i<=n;i++)
{ f>>v1[i]>>v2[i];
while(v1[i]!=v2[i])
{ if(v1[i]>v2[i])
v1[i]=v1[i]-v2[i];
else v2[i]=v2[i]-v1[i];
}
afis[i]=v1[i];
}
for(int i=1;i<=n;i++)
g<<afis[i]<<endl;
f.close();
g.close();
return 0;
}
