NINJA3 - STUNNING GCD

You are given three numbers N, a, b. You can build a number X by repeating N 'a' times and the number Y by repeating N 'b' times. Now that you have the numbers X and Y, determine the GCD of the two numbers X and Y.

Input format:

The first line contains an integer T, the number of test cases.

Then for each test case, there are three integers in each line: N, a, b.

Output format:

Print the required answer for each test case in a single line.

Constraints:

1 <= T <= 100

1 <= N, a, b <= 10^18

Sample:

Input:
1
123 2 3

Output:
123

Added by:mombassa
Date:2016-02-17
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU JS-MONKEY

hide comments
2017-06-29 15:53:26
pure maths.

Last edit: 2017-06-29 15:55:13
2017-01-28 18:00:16
@akshayvenkat...tnx dude...till now, had got the qus wrong :P
2017-01-20 15:24:46
Simple one AC in 1 go:-)
2016-08-16 11:55:39
ya i totally agree with coder_hsnake
2016-08-16 10:15:36
very very easy only use concept of gcd AC in one go :-))))
2016-07-03 19:18:45
esy one if u got the question right!
2016-06-23 09:36:35
easy go, once u get the logic
2016-06-09 21:09:30 Francky
@LeBron : I tried an awaited solution and got AC. I tried a weaker code and got TLE. What kind of input would you like to see here. We obviously can't wait in output a 1.8e19 - length number.
Please give a good sample of input that you think is absent.
2016-06-09 13:50:59 LeBron
SPOJ turns into rubbish because of setters providing problems like this one. There are clearly no good test data here, so "constraints" section makes no sense.
2016-05-30 11:29:35
i/p:
2
123 2 4
123 3 9

o/p
123123
123123123
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.