codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1025B.md (2039B)


      1 Source: https://codeforces.com/problemset/problem/1025/B
      2 
      3 B. Weakened Common Divisor
      4 
      5 time limit per test
      6 
      7 1.5 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 During the research on properties of the greatest common divisor (GCD) of a set of numbers, Ildar, a famous mathematician, introduced a brand new concept of the weakened common divisor (WCD) of a list of pairs of integers.
     22 
     23 For a given list of pairs of integers $(a_1, b_1)$, $(a_2, b_2)$, ..., $(a_n, b_n)$ their WCD is arbitrary integer greater than $1$, such that it divides at least one element in each pair. WCD may not exist for some lists.
     24 
     25 For example, if the list looks like $[(12, 15), (25, 18), (10, 24)]$, then their WCD can be equal to $2$, $3$, $5$ or $6$ (each of these numbers is strictly greater than $1$ and divides at least one number in each pair).
     26 
     27 You're currently pursuing your PhD degree under Ildar's mentorship, and that's why this problem was delegated to you. Your task is to calculate WCD efficiently.
     28 
     29 Input
     30 
     31 The first line contains a single integer $n$ ($1 \le n \le 150\,000$) — the number of pairs.
     32 
     33 Each of the next $n$ lines contains two integer values $a_i$, $b_i$ ($2 \le a_i, b_i \le 2 \cdot 10^9$).
     34 
     35 Output
     36 
     37 Print a single integer — the WCD of the set of pairs.
     38 
     39 If there are multiple possible answers, output any; if there is no answer, print $-1$.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 3  
     47 17 18  
     48 15 24  
     49 12 15
     50 ```
     51 
     52 Output
     53 
     54 ```
     55 6
     56 ```
     57 
     58 Input
     59 
     60 ```
     61 2  
     62 10 16  
     63 7 17
     64 ```
     65 
     66 Output
     67 
     68 ```
     69 -1
     70 ```
     71 
     72 Input
     73 
     74 ```
     75 5  
     76 90 108  
     77 45 105  
     78 75 40  
     79 165 175  
     80 33 30
     81 ```
     82 
     83 Output
     84 
     85 ```
     86 5
     87 ```
     88 
     89 Note
     90 
     91 In the first example the answer is $6$ since it divides $18$ from the first pair, $24$ from the second and $12$ from the third ones. Note that other valid answers will also be accepted.
     92 
     93 In the second example there are no integers greater than $1$ satisfying the conditions.
     94 
     95 In the third example one of the possible answers is $5$. Note that, for example, $15$ is also allowed, but it's not necessary to maximize the output.