Cod sursa(job #293468)
| Utilizator |  FMI Dogan Adrian Ioan Lucian Tyber |
Data | 1 aprilie 2009 20:54:06 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
int n,a,b;
int cmmdc(int,int);
int main(){
freopen("euclid2.in", "r",stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++){scanf("%d %d", &a, &b);
printf("%d\n", cmmdc(a,b));}
return 0;}
int cmmdc(int a,int b){if(!b)return a;
return cmmdc(b,a%b);}