Cod sursa(job #1652122)
Utilizator | Data | 14 martie 2016 17:59:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
#include <fstream>
using namespace std;
int t, a, b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int x,int y);
int main()
{
f>>t;
for (int i=0;i<t;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<< '\n';
}
return 0;
}
int cmmdc(int x, int y)
{
if(!y)
return x;
return cmmdc(y,x%y);
}