Cod sursa(job #1459259)
Utilizator | Data | 9 iulie 2015 14:57:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#define fin "euclid2.in"
#define fou "euclid2.out"
using namespace std;
ifstream t1(fin);
ofstream t2(fou);
int cmmdc(int a, int b)
{
if(!b) return a;
else cmmdc(a % b,b);
}
int main()
{
int n, i,a,b;
t1 >> n;
for (i = 1; i <= n;i++)
{
t1 >> a>> b;
t2 << cmmdc(a,b)<<'\n';
}
t1.close();
t2.close();
return 0;
}