Cod sursa(job #632976)
Utilizator | FMI-M2 Marius Melemciuc Marius_m | Data | 12 noiembrie 2011 16:31:06 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
using namespace std;
long int euclid_impartiri(long int a,long int b)
{ long int x;
while(b!=0) {
x=a%b;
a=b;
b=x; }
return a;
}
int main()
{ long int i,T,x,y;
FILE *c,*d;
c=fopen("euclid2.in","r");
d=fopen("euclid2.out","w");
fscanf(c,"%ld",&T);
for(i=1;i<=T;i++) {
fscanf(c,"%ld %ld",&x,&y);
fprintf(d,"%ld \n",euclid_impartiri(x,y)); }
fclose(c);
fclose(d);
return 0;
}