Cod sursa(job #497167)
| Utilizator | Data | 1 noiembrie 2010 19:32:07 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include "stdio.h"
int Euclid(int a,int b){
int tmp;
if(a<b){
b = a + b;
a = b - a;
b = b - a;
}
while(b!=0){
tmp = b;
b = a % b;
a = tmp;
}
return a;
}
int main(){
int a[10000],b[10000],n;
int i;
FILE *f,*g;
f = fopen("euclid2.in","r");
g = fopen("euclid2.out","w");
fscanf(f,"%d",&n);
for(i=0;i<n;i++){
fscanf(f,"%d %d",&a[i],&b[i]);
}
for(i=0;i<n;i++){
fprintf(g,"%d \n",Euclid(a[i],b[i]));
}
return 0;
}