HDU2800(找规律)

Adding Edges

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

Problem Description

There are N+1 points on the plane, number A,1,2…N. N is an odd integer. Initially, there exist (N+1)/2 edges, as shown in the picture below.

Now your mission is add some edges to the graph, makes that
① degree(i) != degree(j), (i != j, 1 <= i, j <= N).
② degree(1) as small as possible.
For example, when N = 3, there are two possible answers:

 

Input

Each test case contains a single odd integer N(N<=10^6), indicating the number of points. The input is terminated by a set starting with N = 0.

 

Output

For each test case, output on a line the smallest possible value of the degree(1).

 

Sample Input

  
  

   
   3
0
  
  

 

Sample Output

  
  

   
   2
  
  
  
  

   
    
  
  
  
  

   
   此题代码非常简单，但思路本人认为并不那么容易的。
  
  
  
  

   
   
#include<cstdio>
int main()
{
	int n;
	while(~scanf("%d",&n)&&n)
	{
		printf("%d\n",(n+1)/2);
	}
	return 0;
}