Cod sursa(job #1900473)
Utilizator | Data | 3 martie 2017 13:24:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n;
int cmmdc(int a, int b)
{
if(b==0)return a;
else return cmmdc(b, a%b);
}
int main()
{
fin>>n;
for(int i=0;i<n;++i)
{
int a, b;
fin>>a>>b;
fout<<cmmdc(a, b)<<'\n';
}
return 0;
}