HDU 4627 E(Contest #3)

Description

There are many unsolvable problem in the world.It could be about one or about zero.But this time it is about bigger number.
Given an integer n(2 <= n <= 10 ⁹).We should find a pair of positive integer a, b so that a + b = n and [a, b] is as large as possible. [a, b] denote the least common multiplier of a, b.

 

Input

The first line contains integer T(1<= T<= 10000),denote the number of the test cases.
For each test cases,the first line contains an integer n.

 

Output

For each test cases, print the maximum [a,b] in a line.

 

Sample Input

3 2 3 4

 

Sample Output

1 2 3

 

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
　　int t,n;
　　cin>>t;
　　while(t--)
　　　{
　　　　cin>>n;
　　　　if(n==2)
　　　　{
　　　　　　cout<<"1"<<endl;
　　　　　　continue;
　　　　}
　　　　int k=n/2;
　　　　if(n%2==1)
　　　　　　printf("%I64d ",(__int64)k*(k+1));
　　　　else
　　　　{
　　　　　　if(k%2==1)
　　　　　　　　printf("%I64d ",(__int64)(k-2)*(k+2));
　　　　　　else
　　　　　　　　printf("%I64d ",(__int64)(k-1)*(k+1));
　　　　}
　　}
　　return 0;
}