BUCT OJ 2264: The Unsolvable Problem

题目描述

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 <= 109).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.

输入

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.

输出

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

样例输入

3234

样例输出

123

上代码~

#include <stdio.h> #define ll long long int main() {     ll n, n_case;     scanf("%lld", &n_case);     while(n_case--){         scanf("%lld", &n);         if(n==2)         printf("1\n");         else        {             if(n%2)             printf("%lld\n", (n/2)*(n-n/2));             else            {                 if((n/2)%2==0)                 printf("%lld\n", (n/2-1)*(n/2+1));                 else                printf("%lld\n", (n/2-2)*(n/2+2));             }         }     }     return 0; }   /**************************************************************     Problem: 2264     User: 2012014425     Language: C     Result: 正确     Time:12 ms     Memory:768 kb ****************************************************************/