Cod sursa(job #285194)
Utilizator | Data | 22 martie 2009 13:53:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
if(!b)
return a;
else
return gcd(b,a%b);
}
int main()
{
long a,b,t,i;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>t;
for(i=1;i<=t;i++)
{
f>>a>>b;
g<<gcd(a,b)<<"\n";
}
f.close();
g.close();
}