Maximum GCD
题意翻译
- 给定 $n(2\leq n\leq 10^6)$,求$\gcd(a,b)$ 的最大值,其中$a\lt b\leq n$。
- 本题有多组数据。
说明:
- 第一组样例中, $\gcd(1, 2)=\gcd(2, 3)=\gcd(1, 3) = 1$。
- 第二组数据中,$\gcd(2,4)=2$。
题目描述
Let's consider all integers in the range from $ 1 $ to $ n $ (inclusive).
Among all pairs of distinct integers in this range, find the maximum possible greatest common divisor of integers in pair. Formally, find the maximum value of $ \mathrm{gcd}(a, b) $ , where $ 1 \leq a < b \leq n $ .
The greatest common divisor, $ \mathrm{gcd}(a, b) $ , of two positive integers $ a $ and $ b $ is the biggest integer that is a divisor of both $ a $ and $ b $ .
输入输出格式
输入格式
The first line contains a single integer $ t $ ( $ 1 \leq t \leq 100 $ ) — the number of test cases. The description of the test cases follows.
The only line of each test case contains a single integer $ n $ ( $ 2 \leq n \leq 10^6 $ ).
输出格式
For each test case, output the maximum value of $ \mathrm{gcd}(a, b) $ among all $ 1 \leq a < b \leq n $ .
输入输出样例
输入样例 #1
2
3
5
输出样例 #1
1
2
说明
In the first test case, $ \mathrm{gcd}(1, 2) = \mathrm{gcd}(2, 3) = \mathrm{gcd}(1, 3) = 1 $ .
In the second test case, $ 2 $ is the maximum possible value, corresponding to $ \mathrm{gcd}(2, 4) $ .