Cod sursa(job #975880)
| Utilizator | Data | 21 iulie 2013 22:36:54 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(unsigned long a, unsigned long b);
int main()
{
ifstream fi("euclid2.in");
ofstream fo;
fo.open("euclid2.out");
int T;
fi>>T;
unsigned long a,b;
for(int i=1;i<=T;i++)
{
fi>>a>>b;
if(a>b) fo<<cmmdc(b,a)<<endl;
else fo<<cmmdc(a,b)<<endl;
}
return 0;
}
int cmmdc(unsigned long a, unsigned long b)
{
if(b%a==0)return a;
else cmmdc(b%a,a);
}
