Cod sursa(job #1643079)
Utilizator | Data | 9 martie 2016 17:29:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
long n,i,x,y;
long cmmdc(long a, long b)
{
if(!b) return a;
else return cmmdc(b,a%b);
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(i=1;i<=n;i++)
{f>>x>>y;
g<<cmmdc(x,y)<<'\n';}
return 0;
}