Cod sursa(job #1747357)
| Utilizator | Data | 24 august 2016 19:58:01 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t,i,a,b;
int cmmdc(int x, int y)
{
if(y==0)
return x;
return cmmdc(y,x%y);
}
int main()
{
fin>>t;
for(i=1; i<=t; i++)
{
fin>>a>>b;
fout<<cmmdc(a,b)<<'\n';
}
fin.close();
fout.close();
return 0;
}
