#482(div.2) A. Pizza, Pizza, Pizza!!!

最新推荐文章于 2021-07-31 01:29:20 发布

Zero_979

最新推荐文章于 2021-07-31 01:29:20 发布

阅读量502

点赞数

分类专栏： CF 文章标签： ACM

本文链接：https://blog.csdn.net/Zero_979/article/details/80329697

版权

CF 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

题目地址：http://codeforces.com/contest/979/problem/A

题目：

Katie, Kuro and Shiro are best friends. They have known each other since kindergarten. That's why they often share everything with each other and work together on some very hard problems.

Today is Shiro's birthday. She really loves pizza so she wants to invite her friends to the pizza restaurant near her house to celebrate her birthday, including her best friends Katie and Kuro.

She has ordered a very big round pizza, in order to serve her many friends. Exactly $n$ of Shiro's friends are here. That's why she has to divide the pizza into $n + 1$ slices (Shiro also needs to eat). She wants the slices to be exactly the same size and shape. If not, some of her friends will get mad and go home early, and the party will be over.

Shiro is now hungry. She wants to cut the pizza with minimum of straight cuts. A cut is a straight segment, it might have ends inside or outside the pizza. But she is too lazy to pick up the calculator.

As usual, she will ask Katie and Kuro for help. But they haven't come yet. Could you help Shiro with this problem?

Input

A single line contains one non-negative integer $n$ ( $0 \leq n \leq 10^{18}$ ) — the number of Shiro's friends. The circular pizza has to be sliced into $n + 1$ pieces.

Output

A single integer — the number of straight cuts Shiro needs.

Note

To cut the round pizza into quarters one has to make two cuts through the center with angle $90^{\circ}$ between them.

To cut the round pizza into five equal parts one has to make five cuts.

思路:A题不用想的太复杂。切蛋糕，小伙伴和Shiro要每人一块蛋糕。一刀下去可以使蛋糕变成两块，也可以切一半，比如要五块蛋糕只要切五下。所以当Shiro+小伙伴人数等于奇数时，切的刀数等于Shiro+小伙伴人数。当Shiro+小伙伴人数=偶数时，切的刀数等于（Shiro+小伙伴人数）/2.

注意当没有小伙伴来时就不需要切蛋糕。

代码：

 #include<iostream>
using namespace std;
int main()
{
    long long int n;
    while(cin>>n)
    {
        if(n==0)cout<<0<<endl;
        else if((n+1)%2==0)cout<<(n+1)/2<<endl;
        else cout<<n+1<<endl;
    }
    return 0;
}