NINJA3 - STUNNING GCD

no tags 

Problem statement:

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


hide comments
sanyam19: 2018-01-11 17:02:57

easy 1 :)) AC in 1 go...

ayushgupta1997: 2017-12-25 18:38:50

GOod Problem observe :)

satyam_lal: 2017-12-23 18:48:09

idk why am i getting a run time error(NZEC) on python i am getting absolutely correct answers when i execute it on an IDE

shub1025: 2017-12-15 05:53:26

My 50th ..easy Ac at one go

Rafail Loizou: 2017-08-17 01:31:52

Just because the introduction is not clear: lets say you have this case: 3 4 8
You should NOT output: 12.
Instead you should output: 3333. I wanted to share this because the sample case is not explaining the way the output must be done (because if it would that would leak the answer but yet again giving this case doesn't directly leak it nor it makes it completely easy, it just makes this solvable cause otherwise u just have to guess what captain mombasa here really wanted)

namitp: 2017-07-30 16:01:22

After a long a problem in one Go.....
Easy One...

rohit9934: 2017-06-29 15:53:26

pure maths.

Last edit: 2017-06-29 15:55:13
harshahj97: 2017-01-28 18:00:16

@akshayvenkat...tnx dude...till now, had got the qus wrong :P

vengatesh15: 2017-01-20 15:24:46

Simple one AC in 1 go:-)

agarwalg271: 2016-08-16 11:55:39

ya i totally agree with coder_hsnake


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