Cod sursa(job #800268)
Utilizator | Data | 21 octombrie 2012 11:05:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
int gcd(int a, int b)
{
if (b==0)
return a;
else
return gcd(b,a%b);
}
int main ()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a , b , n;
f>>n;
for (int i=1;i<=n;i++)
{f>>a>>b;
g<<gcd(a,b)<<endl;
}
f.close();
g.close();
}