Cod sursa(job #2226897)
Utilizator | Data | 30 iulie 2018 19:31:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int N, A, B;
int cmmdc(int a, int b)
{
if(b == 0)
return a;
return cmmdc(b, a % b);
}
int main()
{
int i;
f >> N;
for(i = 0; i < N; i++)
{
f >> A >> B;
g << cmmdc(A, B) << endl;
}
return 0;
}