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
Shivam Singh:
20150824 03:41:57
its all about getting the first B%A... 

alok singh:
20150821 16:53:52
sahi hai :) 

sarvagya:
20150818 03:02:31
do it in C,C++ if you want to learn else move to another problem . :P 

Anurag Sharma:
20150806 18:33:40
python should also remove.... 

Anurag Sharma:
20150806 18:30:51
why there is not java included.... it sucks :< 

Anurag Sharma:
20150806 18:30:50
why there is not java included.... it sucks :< 

sukriti_verma:
20150801 23:47:44
Last edit: 20150801 23:48:23 

karthik1997:
20150801 21:13:48
https://souvikpal.wordpress.com/2013/02/09/gcdofaverylargenumber/


:?ToRpiDo:
20150726 15:42:16
my...Half Century :) done in 4 languages :) Last edit: 20150726 15:43:03 

Rishabh Joshi:
20150604 16:42:11
Copy paste in python gets AC.

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 