Cod sursa(job #2180234)
Utilizator | Data | 20 martie 2018 18:43:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a,int b)
{
if(a==b)
return a;
if(a>b)
return cmmdc(a-b,b);
else
return cmmdc(a,b-a);
}
int main()
{
int a,b,n;
f>>n;
for(int i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}