Cod sursa(job #293432)
| Utilizator | Data | 1 aprilie 2009 20:40:00 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
long long n,a,b;
long long cmmdc(long long, long long);
int main(){
freopen("euclid2.in", "r",stdin);
freopen("euclid2.out", "w", stdout);
scanf("%D",&n);
for(long long i=1;i<=n;i++){scanf("%D %D", &a,&b);
printf("%D", cmmdc(a,b));}
return 0;}
long long cmmdc(long long a,long long b){if(b==0)return a;
return (b,a%b);}