Cod sursa(job #1810788)
Utilizator | Data | 20 noiembrie 2016 16:23:03 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#include <fstream>
using namespace std;
int n,a,b,c;
int cmmdc(int m,int n)
{
if(n==0)
return m;
return cmmdc(n, m%n);
}
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;
}