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