Cod sursa(job #1875421)
Utilizator | Data | 11 februarie 2017 02:23:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int cmmdc(int a,int b)
{
if(!b) return a;
if(a>b) return cmmdc(a-b,b);
return cmmdc(a,b-a);
}
int main()
{
int n,a,b;
in>>n;
for(int i=1;i<=n;i++)
{
in>>a>>b;
out<<cmmdc(a,b)<<endl;
}
return 0;
}