Cod sursa(job #779158)
Utilizator | Data | 16 august 2012 21:07:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out("euclid2.out");
int euclid(int a,int b)
{ int r;
while(b)
{ r=a%b;
a=b;
b=r;
} return a;
}
int main ()
{
int a,b,n,i;
in>>n;
for(i=1;i<=n;i++)
{ in>>a>>b;
out<<euclid(a,b)<<'\n';
}
}