GCD2  GCD2
Frank explained its friend Felman the algorithm of Euclides to calculate the GCD of two numbers. Then Felman implements it algorithm
int gcd(int a, int b) { if (b==0) return a; else return gcd(b,a%b); }and it proposes to Frank that makes it but with a little integer and another integer that has up to 250 digits.
Your task is to help Frank programming an efficient code for the challenge of Felman.
Input
The first line of the input file contains a number representing the number of lines to follow. Each line consists of two number A and B (0 <= A <= 40000 and A <= B < 10^250).
Output
Print for each pair (A,B) in the input one integer representing the GCD of A and B.
Example
Input: 2 2 6 10 11 Output: 2 1
Source limit is 1,000 Bytes.
hide comments
sandeep_4141:
20161026 19:55:49
really take care when a==0,cost 1 WA ..but finally AC! 

sonali9696:
20160708 22:18:19
simple high school mathematics :) 

suraj:
20160628 09:27:43
take care when a=0 

gohanssj9:
20160511 09:49:49
Be careful of a=0 value. And also remove unnecessary details from your code,because I got an error when I tried to submit a code with unnecessary details. After removing those things, it ran successfully. 

hareesh:
20160429 13:26:57
Good one.... Do it in C/C++ 

try2catch:
20160325 10:28:54
You know! I was compromising time with Java for many questions.


manas0008:
20160126 05:44:10
Be careful when a==0.


chinmoy17_c:
20160108 14:12:29
really learnt some new concepts... 

xpshekhar:
20151228 00:28:32
learn some new things.


kamran siddique:
20151105 14:49:35
If python is there then y not Java .. Partiality!!!!! 
Added by:  Frank Rafael Arteaga 
Date:  20080804 
Time limit:  0.25s 
Source limit:  1000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 strict LISP sbcl LISP clisp ERL JAVA JS NODEJS PERL PERL 6 PHP PYTH 2.7 RUBY VB.net 
Resource:  My own Resource 