Cod sursa(job #2155167)
Utilizator | Data | 7 martie 2018 17:38:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t,a,b;
int cmmdc(int x,int y)
{
if(!y) return x;
return cmmdc(y,x%y);
}
int main()
{
f>>t;
for(int i=1;i<=t;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
return 0;
}