Cod sursa(job #1511740)
Utilizator | Data | 27 octombrie 2015 05:55:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <cstdio>
using namespace std;
int t,a,b;
int gcd(int x,int y){
if(!y)return x;
return gcd(y,x%y);
}
int main(){
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
for(scanf("%d ",&t);t;--t){
scanf("%d %d ",&a,&b);
printf("%d\n",gcd(a,b));
}
return 0;
}