Cod sursa(job #350936)
Utilizator | Data | 26 septembrie 2009 13:00:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream.h>
#include <fstream.h>
using namespace std;
long a,b,t;
int gcd(int a, int b)
{if(b==0) return a;
return gcd(b,a%b);
}
int main()
{int i;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>t;
for(i=1;i<=t;i++)
{f>>a>>b;
g<<gcd(a,b);
}
f.close();
g.close();
return 0;
}