Cod sursa(job #332776)
Utilizator | Data | 19 iulie 2009 18:37:30 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream.h>
#include <iostream.h>
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(void)
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a[100000],b[100000],r,i,t;
f>>t;
for (i=0;i<t;i++)
f>>a[i]>>b[i];
f.close();
for (i=0;i<t;i++)
g<<gcd(a[i],b[i])<<endl;
g.close();
return 0;
}