Cod sursa(job #812048)
Utilizator | Data | 13 noiembrie 2012 12:22:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream>
using namespace std;
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
int n,a,b;
int cmmdc(int a,int b)
{
if(!b)
return a;
else return cmmdc(b,a%b);
}
int main()
{
f>>n;
while(n--)
{
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}