Hdu4572 Bottles Arrangement (query rule)

Bottles Arrangement
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission (s): 224 Accepted Submission (s): 176

Problem Description
Hunan cuisine is really wonderful! But if you don't like spicy food, you will feel terrible since it can be hard for you to find any food without hot pepper here. big Fan is a student from the north who was not fit to the spicy food in Changsha. he became thinner and thinner because eating little food and maintained his life mostly by drinking water. one day, he found that the wine in Hunan is pretty good, such as Jiugui, Liuyang River, Shaoyang Daqu and so on. he got addicted to it and became an alcoholic, leading a depressed life.
Now N days have passed and he is sobered. he is surprised to find that there are exactly N × M bottles around him. another amazing fact is that there are N bottles with height 1 and N bottles with height 2... N bottles with height M.
Now he is interested in playing with these bottles. He wants to arrange all these bottles in a rectangle with M rows and N columns which satisfied:
(1) In any column, there are no bottles with same height;
(2) In any row, the height difference between any two adjacent bottles is no more than 1.
He defined a strange function Y which equals the maximum value of the total height of any single row. he is addicted in arranging these rubbish bottles to find the minimal Y. you know that he cannot solve it with his pour IQ. you are his friend and can't endure his decadence any more. so you decide to help him solve this problem and then bring him back to study.
 

Input
There are several test cases. for each case, the input contains one line with two integers M and N (1 <M <= 10000, 3 <= N <2 × M, it is guaranteed that N is always odd ).
The input will finish with the end of file.
 

Output
For each test case, print the minimal Y in single line.
 

Sample Input
3 3
3 5

Sample Output
8
11
Hint
For the first case the solution is:
1 2 3
2 1 1
3 3 2
 

Source
2013 ACM-ICPC Changsha Division national invitational Competition -- reproduction of questions
 

This question is easy to write, but it is not easy to reason. When I think it is not easy to do it, I will not do it. Who knows that such a short code can pass, but can only say that they are not capable enough?

This is a regular query, and it was skipped at that time. Take m, M-1, m-2, m-2, M-3, M-3 ...... the first n items can be output.

The proof of this question can be found on the Internet. Someone has read it to prove that it has been written on two pages. It is much longer than the code.

 

#include<stdio.h>   int main()  {      int n,m,i,sum,j;      while(scanf("%d%d",&m,&n)!=EOF)      {          sum=0;          for(i=0;i<=n/2;i++)          {              sum+=(m-i)*2;          }          sum-=m-i+1;          printf("%d\n",sum);      }      return 0;  }  #include<stdio.h>int main(){int n,m,i,sum,j;while(scanf("%d%d",&m,&n)!=EOF){sum=0;for(i=0;i<=n/2;i++){sum+=(m-i)*2;}sum-=m-i+1;printf("%d\n",sum);}return 0;}