[Solution] Doremy's Perfect Math Class Codeforces Solution

B. Doremy's Perfect Math Class

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

"Everybody! Doremy's Perfect Math Class is about to start! Come and do your best if you want to have as much IQ as me!" In today's math class, Doremy is teaching everyone subtraction. Now she gives you a quiz to prove that you are paying attention in class.

You are given a set 𝑆$S$ containing positive integers. You may perform the following operation some (possibly zero) number of times:

• choose two integers 𝑥$x$ and 𝑦$y$ from the set 𝑆$S$ such that 𝑥>𝑦$x>y$ and 𝑥−𝑦$x-y$ is not in the set 𝑆$S$.
• add 𝑥−𝑦$x-y$ into the set 𝑆$S$.

You need to tell Doremy the maximum possible number of integers in 𝑆$S$ if the operations are performed optimally. It can be proven that this number is finite.

Input

The input consists of multiple test cases. The first line contains a single integer 𝑡$t$ (1≤𝑡≤104$1\le t\le {10}^4$) — the number of test cases. The description of the test cases follows.

The first line contains an integer 𝑛$n$ (2≤𝑛≤105$2\le n\le {10}^5$) — the size of the set 𝑆$S$.

The second line contains 𝑛$n$ integers 𝑎1,𝑎2,…,𝑎𝑛$a_1,a_2,\dots ,a_n$ (1≤𝑎1<𝑎2<⋯<𝑎𝑛≤109$1\le a_1<a_2<\cdots <a_n\le {10}^9$) — the positive integers in 𝑆$S$.

It is guaranteed that the sum of 𝑛$n$ over all test cases does not exceed 2⋅105$2\cdot {10}^5$.

Output

For each test case, you need to output the maximum possible number of integers in 𝑆$S$. It can be proven that this value is finite.

Note

In the first test case, no such 𝑥$x$ and 𝑦$y$ exist. The maximum possible number of integers in 𝑆$S$ is 2$2$.

In the second test case,

• 𝑆={5,10,25}$S=\{5,10,25\}$ at first. You can choose 𝑥=25$x=25$, 𝑦=10$y=10$, then add 𝑥−𝑦=15$x-y=15$ to the set.
• 𝑆={5,10,15,25}$S=\{5,10,15,25\}$ now. You can choose 𝑥=25$x=25$, 𝑦=5$y=5$, then add 𝑥−𝑦=20$x-y=20$ to the set.
• 𝑆={5,10,15,20,25}$S=\{5,10,15,20,25\}$ now. You can not perform any operation now.

After performing all operations, the number of integers in 𝑆$S$ is 5$5$. It can be proven that no other sequence of operations allows 𝑆$S$ to contain more than 5$5$ integers.