Cod sursa(job #275067)
Utilizator | Data | 10 martie 2009 10:38:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream.h>
#include<fstream.h>
ifstream f("euclid.in");
ofstream g("euclid.out");
long t, a,b;
main()
{
f>>t;
for(long i=1;i<=t;i++)
{
f>>a>>b;
int r,opt;
while (b)
{
r=a%b;
a=b;
b=r;
}
if(a>1) g<<a<<endl;
else g<<'1';}
g.close();
}