Cod sursa(job #320340)
Utilizator | Data | 4 iunie 2009 15:10:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream.h>
int divizor(int &a,int &b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int a,b,n;
in>>n;
while(n>0)
{
in>>a>>b;
out<<divizor(a,b)<<"\n";
n--;
}
in.close();
out.close();
return 0;
}