Cod sursa(job #700266)
Utilizator | Data | 1 martie 2012 08:49:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream f("euclid.in");
ofstream g("euclid.out");
int a,b,c,n,i;
int euclid(int a,int b)
{
int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
{ f>>a>>b; g<<euclid(a,b)<<'\n'; }
return 0;
}