Cod sursa(job #2143359)
Utilizator | Data | 25 februarie 2018 21:00:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,a,b;
int cmmdc(int x,int y)
{
if(y==0)
return x;
return cmmdc(y, x%y);
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}