Cod sursa(job #543323)
Utilizator | Data | 27 februarie 2011 21:06:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream.h>
using namespace std;
int cmmdc(int a, int b)
{
if(!b) return a;
return cmmdc(b, a % b);
}
int main()
{
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int n, a, b, i;
f >> n;
for(i = 0; i < n; i ++)
{
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
f.close();
g.close();
return 0;
}