Cod sursa(job #656869)
Utilizator | Data | 5 ianuarie 2012 14:00:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("euclid.in");
ofstream g("euclid.out");
int x,y,n,i;
int euclid(int a,int b)
{
int r;
while (b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
f>> n;
for(i=1; i<=n; i++)
{
f>>x>>y;
g<<euclid(x,y)<<'\n';
}
f.close();
g.close();
return 0;
}