Cod sursa(job #279538)
Utilizator | Data | 12 martie 2009 21:02:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<iostream>
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int cmmdc(int a, int b)
{
if (!b) return a;
return cmmdc(b, a % b);
}
int main(void)
{
int n,a,b;
fin>>n;
for(int i = 1; i <= n; i++)
{ fin>>a>>b; fout<<cmmdc(a,b);}
return 0;
}