WOJ1034-Cut the Apple

最新推荐文章于 2017-09-09 11:12:57 发布

暴走777

最新推荐文章于 2017-09-09 11:12:57 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏： WOJ

本文链接：https://blog.youkuaiyun.com/LXQ1071717521/article/details/77743670

WOJ 专栏收录该内容

144 篇文章

订阅专栏

本文探讨了如何使用n次切割将一个大型苹果尽可能多地分成若干份的问题，并提供了一个简单的C语言程序来计算不同切割次数下可以获得的最大份数。

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

On the way home, DragonFly has got an extraordinarily large apple. He would like to share it with his friends. Now he wants to get
as many pieces as possible with n cuts. But he cannot decide how to cut it, because the apple is rather delicious. Now he needs your help.

输入格式

Each line contains an integer n (0<= n <= 100000).
Input will be terminated by EOF.

输出格式

You should print the largest number of pieces by n cuts of each case .

样例输入

1
2
3

样例输出

2
4
8

N个平面可以把空间分成(n*n*n+5*n+6)/6份

#include<stdio.h>
#include<math.h>

int main()
{
    long long n;
    long long max;
    while(scanf("%lld",&n)!=EOF)
    {
        max=(n*n*n+5*n+6)/6;
        printf("%lld\n",max);
        }
    return 0;
}