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