Cod sursa(job #1990922)
Utilizator | Data | 14 iunie 2017 11:54:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc (int x,int y)
{
if (y==0) return x;
return cmmdc(y,x%y);
}
int main()
{int i,n,x,y;
fin>>n;
for (i=1;i<=n;i++)
{
fin>>x>>y;
fout<<cmmdc(x,y)<<"\n";
}
return 0;
}