Cod sursa(job #940349)
| Utilizator | Data | 16 aprilie 2013 01:28:36 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int gcd(int a, int b){
if(a == 0) return b;
if(b == 0) return a;
if(a > b) return gcd(b, a%b);
else return gcd(a, b%a);
}
int main(){
if(1){
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
}
int t = 0, a = 0, b = 0;
cin>>t;
for (int i = 0; i < t; i++)
{
cin>>a>>b;
int ans = gcd(a,b);
printf("%d\n", ans);
}
return 0;
}
