Cod sursa(job #989497)
Utilizator | Data | 25 august 2013 18:39:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int i,t,a,b,r,aux;
ifstream f("euclid.in");
ofstream g("euclid.out");
f>>t;
for(i=1;i<=t;i++)
{
f>>a>>b;
if(b<a)
{
aux=a;
a=b;
b=aux;
}
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
g<<a<<endl;
g.flush();
}
return 0;
}