Refact.ai Match 1 (Codeforces Round 985)
A
Set
Codeforces
800
原题
←B →
翻译中…

You are given a positive integer $k$ and a set $S$ of all integers from $l$ to $r$ (inclusive).

翻译中…

You can perform the following two-step operation any number of times (possibly zero):

翻译中…
  1. First, choose a number $x$ from the set $S$, such that there are at least $k$ multiples of $x$ in $S$ (including $x$ itself);
  2. Then, remove $x$ from $S$ (note that nothing else is removed).
翻译中…

Find the maximum possible number of operations that can be performed.

翻译中…

Input

翻译中…

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

翻译中…

The only line of each test case contains three integers $l$, $r$, and $k$ ($1\le l\le r\leq 10^9$, $1\leq k\le r-l+1$) — the minimum integer in $S$, the maximum integer in $S$, and the parameter $k$.

翻译中…

Output

翻译中…

For each test case, output a single integer — the maximum possible number of operations that can be performed.

翻译中…

Note

翻译中…

In the first test case, initially, $S = \{3,4,5,6,7,8,9\}$. One possible optimal sequence of operations is:

翻译中…
  1. Choose $x = 4$ for the first operation, since there are two multiples of $4$ in $S$: $4$ and $8$. $S$ becomes equal to $\{3,5,6,7,8,9\}$;
  2. Choose $x = 3$ for the second operation, since there are three multiples of $3$ in $S$: $3$, $6$, and $9$. $S$ becomes equal to $\{5,6,7,8,9\}$.
翻译中…

In the second test case, initially, $S=\{4,5,6,7,8,9\}$. One possible optimal sequence of operations is:

翻译中…
  1. Choose $x = 5$, $S$ becomes equal to $\{4,6,7,8,9\}$;
  2. Choose $x = 6$, $S$ becomes equal to $\{4,7,8,9\}$;
  3. Choose $x = 4$, $S$ becomes equal to $\{7,8,9\}$;
  4. Choose $x = 8$, $S$ becomes equal to $\{7,9\}$;
  5. Choose $x = 7$, $S$ becomes equal to $\{9\}$;
  6. Choose $x = 9$, $S$ becomes equal to $\{\}$.
翻译中…

In the third test case, initially, $S=\{7,8,9\}$. For each $x$ in $S$, no multiple of $x$ other than $x$ itself can be found in $S$. Since $k = 2$, you can perform no operations.

翻译中…

In the fourth test case, initially, $S=\{2,3,4,5,6,7,8,9,10\}$. One possible optimal sequence of operations is:

翻译中…
  1. Choose $x = 2$, $S$ becomes equal to $\{3,4,5,6,7,8,9,10\}$;
  2. Choose $x = 4$, $S$ becomes equal to $\{3,5,6,7,8,9,10\}$;
  3. Choose $x = 3$, $S$ becomes equal to $\{5,6,7,8,9,10\}$;
  4. Choose $x = 5$, $S$ becomes equal to $\{6,7,8,9,10\}$.
翻译中…

样例

Input #1
8
3 9 2
4 9 1
7 9 2
2 10 2
154 220 2
147 294 2
998 24435 3
1 1000000000 2
Output #1
2
6
0
4
0
1
7148
500000000
InputCopy OutputCopy
题目信息
题号
2029A
时间限制
1 s
内存限制
256 MB
标签
贪心
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。