Cod sursa(job #1244871)
Utilizator | Data | 18 octombrie 2014 12:41:42 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <stdio.h>
#include <stdlib.h>
void divi(){
int a,b;
scanf("%d %d" ,&a , &b);
while(a!=b){
if (a>b)
a=a-b;
else b=b-a;}
printf("%d\n",a);
}
int main()
{int t;
scanf("%d", &t);
while(t){
divi();
t--;}
return 0;}