Cod sursa(job #519672)
| Utilizator | Data | 6 ianuarie 2011 10:33:00 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
fstream f("euclid2.in", ios::in), g("euclid2.out", ios::out);
long long x, y, i, n;
int euclid(long long a, long long b)
{
long long rest;
while(b>0)
{
rest=a%b;
a=b;
b=rest;
}
return a;
}
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>x>>y;
g<<euclid(x, y)<<endl;
}
f.close();
g.close();
return 0;
}