Sum |
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB |
Total submit users: 757, Accepted users: 719 |
Problem 10052 : No special judgement |
Problem description |
Consider the natural numbers from 1 to N. By associating to each number a sign (+ or -) and calculating the value of this expression we obtain a sum S. The problem is to determine for a given sum S the minimum number N for which we can obtain S by associating signs for all numbers between 1 to N. For a given S, find out the minimum value N in order to obtain S according to the conditions of the problem. |
Input |
The only line contains in the first line a positive integer S (0< S <= 100000) which represents the sum to be obtained. |
Output |
The output will contain the minimum number N for which the sum S can be obtained. |
Sample Input |
12 |
Sample Output |
7 |
Judge Tips |
The sum 12 can be obtained from at least 7 terms in the following way: 12 = -1+2+3+4+5+6-7. |
Problem Source |
ROI 2002 |
#include <stdio.h>
int main()
{
int N=1,S;
int i=1;
scanf("%d",&S);
while ( ((N-S)%2)!=0 || N-S<0 )
{
N=N+(++i);
}
printf("%d\n",i );
return 0;
}