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
അഭി :
20141014 12:14:38
Keep getting internal error. lang=pypy, id=12623106 

SHIVAM DIXIT:
20140928 13:07:32
be careful of follwing test cases


ISHANI:
20140918 16:58:02
after doing this,see this problem http://www.spoj.com/problems/GCD3/ 

Rajat (1307086):
20140817 22:58:26
half of code is already solved in ques.....


rahul nagurtha:
20140725 18:35:02
please enable python 2.7


`Ak:
20140629 07:27:14
1


Sumit Mishra:
20140606 20:20:12
getting WA


agaurav77:
20140606 17:15:10
Here, interpreted languages do better than compiled ones. Euclid's algo works in these languages. 

pvkcse:
20140520 19:52:25
fractions.gcd() got TLE but euclid works fine and got AC with 0.10s in python... 

Arpit Uppal:
20140426 06:42:13
easy one... my 250th classical problem on spoj :) 
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 