codeforces-scrape

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

1216D.md (2727B)


      1 Source: https://codeforces.com/problemset/problem/1216/D
      2 
      3 D. Swords
      4 
      5 time limit per test
      6 
      7 2 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 There were $n$ types of swords in the theater basement which had been used during the plays. Moreover there were exactly $x$ swords of each type. $y$ people have broken into the theater basement and each of them has taken exactly $z$ swords of some single type. Note that different people might have taken different types of swords. Note that the values $x, y$ and $z$ are unknown for you.
     22 
     23 The next morning the director of the theater discovers the loss. He counts all swords — exactly $a_i$ swords of the $i$-th type are left untouched.
     24 
     25 The director has no clue about the initial number of swords of each type in the basement, the number of people who have broken into the basement and how many swords each of them have taken.
     26 
     27 For example, if $n=3$, $a = [3, 12, 6]$ then one of the possible situations is $x=12$, $y=5$ and $z=3$. Then the first three people took swords of the first type and the other two people took swords of the third type. Note that you don't know values $x, y$ and $z$ beforehand but know values of $n$ and $a$.
     28 
     29 Thus he seeks for your help. Determine the minimum number of people $y$, which could have broken into the theater basement, and the number of swords $z$ each of them has taken.
     30 
     31 Input
     32 
     33 The first line of the input contains one integer $n$ $(2 \le n \le 2 \cdot 10^{5})$ — the number of types of swords.
     34 
     35 The second line of the input contains the sequence $a_1, a_2, \dots, a_n$ $(0 \le a_i \le 10^{9})$, where $a_i$ equals to the number of swords of the $i$-th type, which have remained in the basement after the theft. It is guaranteed that there exists at least one such pair of indices $(j, k)$ that $a_j \neq a_k$.
     36 
     37 Output
     38 
     39 Print two integers $y$ and $z$ — the minimum number of people which could have broken into the basement and the number of swords each of them has taken.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 3
     47 3 12 6
     48 ```
     49 
     50 Output
     51 
     52 ```
     53 5 3
     54 ```
     55 
     56 Input
     57 
     58 ```
     59 2
     60 2 9
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 1 7
     67 ```
     68 
     69 Input
     70 
     71 ```
     72 7
     73 2 1000000000 4 6 8 4 2
     74 ```
     75 
     76 Output
     77 
     78 ```
     79 2999999987 2
     80 ```
     81 
     82 Input
     83 
     84 ```
     85 6
     86 13 52 0 13 26 52
     87 ```
     88 
     89 Output
     90 
     91 ```
     92 12 13
     93 ```
     94 
     95 Note
     96 
     97 In the first example the minimum value of $y$ equals to $5$, i.e. the minimum number of people who could have broken into the basement, is $5$. Each of them has taken $3$ swords: three of them have taken $3$ swords of the first type, and two others have taken $3$ swords of the third type.
     98 
     99 In the second example the minimum value of $y$ is $1$, i.e. the minimum number of people who could have broken into the basement, equals to $1$. He has taken $7$ swords of the first type.