sgu 403. Scientific Problem

最新推荐文章于 2018-09-21 22:46:32 发布

superkunn

最新推荐文章于 2018-09-21 22:46:32 发布

阅读量280

点赞数

CC 4.0 BY-SA版权

分类专栏：水-------------------- sgu !!!!!!!!!!

本文链接：https://blog.youkuaiyun.com/superkunn/article/details/80085910

sgu !!!!!!!!!! 同时被 2 个专栏收录

50 篇文章

订阅专栏

水--------------------

24 篇文章

订阅专栏

本文介绍了一个有趣的数学问题：给定一个整数x，如何找到一个整数N，使得N的x倍小于从1到N所有整数的总和。文章提供了一种简单有效的算法解决方案，并附带了C++实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

403. Scientific Problem

Time limit per test: 0.25 second(s)
Memory limit: 65536 kilobytes

input: standard
output: standard

Once upon a time Professor Idioticideasinventor was travelling by train. Watching cheerless landscape outside the window, he decided to invent the theme of his new scientific work. All of a sudden a brilliant idea struck him: to develop an effective algorithm finding an integer number, which is x times less than the sum of all its integer positive predecessors, where number x is given. As far as he has no computer in the train, you have to solve this difficult problem.

Input

The first line of the input file contains an integer number x (1 ≤ x ≤ 109).

Output

Output an integer number — the answer to the problem.

Example(s)

sample input	sample output
1	3

sample input	sample output
2	5

英语弱题意杀，给一个x找出一个N使N的x倍小于1到N的和。

可以有前N-1项和等于x*N，即2*x-1=n

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;



void solve(){
    int n;
    scanf("%d",&n);
    printf("%d",2*n+1);
}




int main() {


#ifdef LOCAL_DEFINE
    freopen("input.txt", "rt", stdin);
#endif

    solve();


    return 0;
}