hdu4627(最大公约数)

The Unsolvable Problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10    Accepted Submission(s): 7

Problem 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 grd(int a,int b)
{
 int tmp=a%b;
 while(tmp)
 {
  a=b;
  b=tmp;
  tmp=a%b;
 }
 return b;
}
   
   
int main()
{
 int n,cas,i;
 __int64 ans;
 cin>>cas;
 while(cas--)
 {
  scanf("%d",&n);
  for(i=n/2;i>=1;i--)
  {
   if(grd(n-i,i)==1)
   {
    ans=n-i;
    ans*=(__int64)(i);
    printf("%I64d\n",ans);
    break;
   }
  }
 }
 return 0;
}