Cod sursa(job #1354010)
Utilizator | Data | 21 februarie 2015 15:03:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<stdio.h>
int main(){
long a,b,n;
FILE *in,*out;
in=fopen("euclid.in","r");
fscanf(in,"%d\n",&n);
out=fopen("euclid.out","w");
while(n>0){
fscanf(in,"%d %d",&a,&b);
if(b>a){
a=a+b;b=a-b;a=a-b;
}
while((a%b!=0)){
a%=b;a+=b;b=a-b;a=a-b;
}
fprintf(out,"%d\n",b);
n--;
}
return 0;
}