22065_Su

2022-5-16 18:21| 发布者: Hocassian| 查看: 28| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-4-8950680160700-Problem List-采集的数据-后羿采集器.html

Pro.ID

22065

Title

Sum

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22065

AC

52

Submit

82

Ratio

63.41%

时间&空间限制

  • Time Limit: 1000/500 MS (Java/Others)     Memory Limit: 65536/65536 K (Java/Others)
  • 描述

    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.

    输入

    The input consists of multiple test case, one integer S per line , (0< S ≤ 100000) which represents the sum to be obtained.

    输出

    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 input consists of multiple test case, one integer S per line , (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

    Hint

    The sum 12 can be obtained from at least 7 terms in the following way: 12 = -1+2+3+4+5+6-7.

    Source

    样例输入

    12

    样例输出

    7

    提示

    The sum 12 can be obtained from at least 7 terms in the following way: 12 = -1+2+3+4+5+6-7.


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部