Cod sursa(job #542859)
Utilizator | Data | 27 februarie 2011 01:24:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
#define FIN "euclid2.in"
#define FOUT "euclid2.out"
int gcd(int a,int b)
{
if(b == 0)
return a;
else return gcd(b, a%b);
}
int main()
{
int n,a,b;
ifstream fin(FIN);
ofstream fout(FOUT);
fin >> n;
for(int i = 0; i < n; ++i)
{
fin >> a >> b;
fout << gcd(a,b) << endl;
}
return 0;
}