time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Let's consider all integers in the range from 11 to nn (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 gcd(a,b)gcd(a,b), where 1≤a<b≤n1≤a<b≤n.
The greatest common divisor, gcd(a,b)gcd(a,b), of two positive integers aa and bb is the biggest integer that is a divisor of both aa and bb.
Input
The first line contains a single integer tt (1≤t≤1001≤t≤100) — the number of test cases. The description of the test cases follows.
The only line of each test case contains a single integer nn (2≤n≤1062≤n≤106).
Output
For each test case, output the maximum value of gcd(a,b)gcd(a,b) among all 1≤a<b≤n1≤a<b≤n.
Example
input
Copy
2 3 5
output
Copy
1 2
Note
In the first test case, gcd(1,2)=gcd(2,3)=gcd(1,3)=1gcd(1,2)=gcd(2,3)=gcd(1,3)=1.
In the second test case, 22 is the maximum possible value, corresponding to gcd(2,4)gcd(2,4).
解題說明：水題，最大公約數爲n/2.
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int t, n;
scanf("%d", &t);
while (t--)
{
scanf("%d", &n);
printf("%d\n", n / 2);
}
return 0;
}