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
Tejas Meshram:
20150520 14:37:33
got to know about boost :) (y) 

Rahul Jain:
20150214 17:23:05
never thought that my century would end up with solving such a silly problem :( 

Madhav:
20150209 13:15:57
good question..learnt something new!! 

Aayush:
20150107 08:46:05
Just copypasted gcd() in python. AC :/ 

Abhinandan Agarwal:
20150105 08:57:15
guys, add the 0 xepction 

Jackson:
20141213 13:10:55
got WA since forgot to add new line in "0" exception... Easy One... 

reddappa:
20141202 11:16:19
getting WA pls chk id = 13031100 

pankaj:
20141110 15:32:05
after 2 WA


premsai:
20141023 11:04:11
keep getting WA, checked all test cases, id=12699717 Last edit: 20141023 11:05:06 

Vamsi Krishna Avula:
20141021 12:02:58
@atheistaltini pypy and pyth 3.4 are available only in cube cluster. 
Added by:  Frank Rafael Arteaga 
Date:  20080804 
Time limit:  1s 
Source limit:  1000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 LISP sbcl LISP clisp ERL JAVA JSRHINO NODEJS PERL6 PERL PHP PYTHON RUBY VB.NET 
Resource:  My own Resource 