#E. 最大最大公约数

    Type: Default 1000ms 256MiB

最大最大公约数

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Background

张展奕在做数学题

Description

给定一个nn,输入nn对数字(ai,bi)(a_i, b_i),找出a,ba,b里最大的最大公约数,俗称最大最大公约数

Input

n,a,bn,a,b

0n1000\leq n\leq 100

0a,b327670\leq a,b\leq 32767 .

Output

a,ba,b里最大的最大公约数

Samples

3
9 6
3 7
5 6
3

“五年级”

Not Attended
Status
Done
Rule
ACM/ICPC
Problem
6
Start at
2024-3-22 15:45
End at
2024-4-1 15:45
Duration
240 hour(s)
Host
Partic.
3