Cod sursa(job #1204596)
| Utilizator | Data | 3 iulie 2014 13:52:57 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
long long gcd(long long a, long long b){
long long r;
while(b){
r = a % b;
a = b;
b = r;
}
return a;
}
int main(){
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int n;
long long a,b;
scanf("%d",&n);
for(int i = 0; i < n; i++){
scanf("%lld%lld",&a,&b);
printf("%lld\n",gcd(a,b));
}
}