Cod sursa(job #1598618)
| Utilizator | Data | 13 februarie 2016 01:54:00 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
#include <stdlib.h>
long long euc(long long a,long long b)
{
if (b==0) return a;
else return euc(b,a%b);
}
int main()
{
FILE *f,*p;
f=fopen("euclid2.in","r");
p=fopen("euclid2.out","w");
int i;
fscanf(f,"%d",&i);
for (int j=0;j<i;j++)
{
long long a,b;
fscanf(f,"%lld %lld",&a,&b);
fprintf(p,"%lld\n",euc(a,b));
}
fclose(p);fclose(f);
return 0;
}
