Codeforces 964A

最新推荐文章于 2018-10-10 23:05:00 发布

Morphling_____

最新推荐文章于 2018-10-10 23:05:00 发布

阅读量322

点赞数 2

分类专栏： Codeforces Codeforces下分之路

本文链接：https://blog.csdn.net/qq_36720186/article/details/80087332

版权

Codeforces 同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

Codeforces下分之路

19 篇文章 0 订阅

订阅专栏

A. Splits

time limit per test：1 second

memory limit per test：256 megabytes

input：standard input

output：standard output

Let's define a split of n as a nonincreasing sequence of positive integers, the sum of which is n.

For example, the following sequences are splits of 8: [4,4][4,4], [3,3,2][3,3,2], [2,2,1,1,1,1][2,2,1,1,1,1], [5,2,1][5,2,1].

The following sequences aren't splits of 8: [1,7][1,7], [5,4][5,4], [11,−3][11,−3], [1,1,4,1,1][1,1,4,1,1].

The weight of a split is the number of elements in the split that are equal to the first element. For example, the weight of the split [1,1,1,1,1][1,1,1,1,1] is 5, the weight of the split [5,5,3,3,3][5,5,3,3,3] is 2 and the weight of the split [9][9] equals 1.

For a given n, find out the number of different weights of its splits.

Input

The first line contains one integer n (1≤n≤1091≤n≤109).

Output

Output one integer — the answer to the problem.

Examples

input

Copy

output

Copy

input

Copy

output

Copy

input

Copy

output

Copy

Note

In the first sample, there are following possible weights of splits of 77:

Weight 1: [77]

Weight 2: [33, 33, 1]

Weight 3: [22, 22, 22, 1]

Weight 7: [11, 11, 11, 11, 11, 11, 11]

题意

把n拆分成一个全是正元素的非递减序列，求序列中有多少个元素与序列中第一个元素相同。

思路

手写了一波n=1,2,3,4,5…然后发现答案就是n / 2 + 1

具体怎么证明的不知道，数学蒟蒻

AC代码

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<string>
#include<sstream>
#include<cctype>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<cstdlib>
#include<ctime>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long ll;

int main()
{
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int n;
    scanf("%d", &n);
    if(n == 1)
    	cout << 1 << '\n';
    else 
    	cout << n / 2 + 1 << '\n';
    return 0;    
}