Cod sursa(job #744472)
Utilizator | Data | 8 mai 2012 20:06:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<cstdio>
using namespace std;
FILE *fin=fopen("euclid2.in","r");
FILE *fout=fopen("euclid2.out","w");
int a,b,i,n;
int f(int a,int b)
{
if(!b) return a;
else return f(b,a%b);
}
int main()
{
fscanf(fin,"%d",&n);
for(i=1;i<=n;++i)
{
fscanf(fin,"%d%d",&a,&b);
f(a,b);
}
return 0;
}