Cod sursa(job #2570458)
Utilizator | Data | 4 martie 2020 16:56:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int n,v1[10000],v2[10000], afis [10000];
ifstream f("euclid.in");
ofstream g("euclid.out");
int main()
{ f>>n;
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];
}
g<<v1[i]<<endl;
}
return 0;
}