Cod sursa(job #775455)
Utilizator | Data | 8 august 2012 11:01:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
int main()
{
int i;
long T;
long long a,b;
ifstream f("euclid.in");
ofstream g("euclid.out");
f>>T;
for(i=0;i<T;i++)
{
f>>a>>b;
while(a!=b)
{
if(a>b)
a=a-b;
if(b>a)
b=b-a;
}
g<<a<<endl;
}
f.close();
g.close();
return 0;
}