Cod sursa(job #1467413)
Utilizator | Data | 3 august 2015 13:04:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int divide(int x,int y){
while (x!=0){
if (x<y) swap (x,y);
x=x%y;
}
return y;
}
int main()
{
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
int a,b,t,i;
fi >> t;
for (i=t;i>0;i--){
fi>>a>>b;
fo << divide(a,b) << endl;
}
fi.close();
fo.close();
}