Cod sursa(job #1809078)
Utilizator | Data | 18 noiembrie 2016 17:21:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
#include <fstream>
using namespace std;
int n,a,b,c;
int cmmdc(int m,int n)
{
if(n==0)
return m;
if(m>n)
return cmmdc(m-n,n);
return cmmdc(m,n-m);
}
int main()
{
fstream f("euclid2.in",ios::in);
FILE *g=fopen("euclid2.out","w");
f >> n;
for(int i=0;i<n;i++)
{
f >> a >> b;
c = cmmdc(a,b);
fprintf(g,"%i\n",c);
}
return 0;
}