Cod sursa(job #1466968)
Utilizator | Data | 1 august 2015 18:38:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc (int a, int b)
{
if(b==0) return a;
else return cmmdc(b, a%b);
}
int a,b,t,i;
int main()
{
fin>>t;
for(i=1;i<=t;i++)
{
fin>>a>>b;
fout<<cmmdc(a,b)<<'\n';
}
return 0;
}