Cod sursa(job #2374421)
Utilizator | Data | 7 martie 2019 18:35:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a,b;
int euclid(int x, int y){
while(x!=y){
if(x<y)y-=x;
else if (x>y) x-=y;
}
return y;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t;
f>>t;
for(int i=1;i<=t;i++){
f>>a;
f>>b;
g<<euclid(a,b)<<"\n";
}
f.close();
g.close();
return 0;
}