Cod sursa(job #739354)
Utilizator | Data | 22 aprilie 2012 20:02:18 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long euclid(long x,long y)
{
long r;
while(y)
{
r=x%y;
x=y;
y=r;
}
return x;
}
int main()
{
int n;
long x,y;
f>>n;
for(int i=1;i<=n;i++)
{
f>>x>>y;
g<<euclid(x,y)<<endl;
}
return 0;
}