Cod sursa(job #537358)
Utilizator | Data | 20 februarie 2011 16:00:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream.h>
ifstream f("fisier.in");
ofstream g("fisier.out");
int n,a,b;
int euclid(int a,int b)
{
int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>a>>b;
g<<euclid(a,b)<<"\n";
}
f.close();
g.close();
return 0;
}