题意:
中文。
思路:
这道神数学题无思路,百度之。。。
①n条线段最多把1个平面分成f[n] = f[n - 1] + 1个平面。
②想要把球体分成最多的块,第n刀与前n - 1个平面两两相交,这n - 1个平面把第n个面分成了f[n - 1]个平面,这样正好把原来的块数增加了f[n - 1]个。
也就是g(n) = g(n - 1) + f(n - 1);
Code:
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<stack>
#include<bitset>
#include<set>
#include<map>
#include<cctype>
#include<vector>
#define TEST
#define LL long long
#define Mt(f, x) memset(f, x, sizeof(f));
#define rep(i, s, e) for(int i = (s); i <= (e); ++i)
#ifdef TEST
#define See(a) cout << #a << " = " << a << endl;
#define See2(a, b) cout << #a << " = " << a << ' ' << #b << " = " << b << endl;
#define debug(a, s, e){ rep(_i, s, e) {cout << a[_i] << ' '; }cout << endl;}
#define debug2(a, s, e, ss, ee) rep(i_, s, e) {debug(a[i_], ss, ee);}
#else
#define See(a)
#define See2(a, b)
#define debug(a, s, e)
#define debug2(a, s, e, ss, ee)
#endif
const int MAX = 2e9;
const int MIN = -2e9;
const int PI = acos(-1.0);
const double eps = 1e-8;
using namespace std;
LL f[1005];
int main()
{
f[1] = 2;
for(LL i = 2; i <= 1000; ++i)
{
f[i] = f[i - 1] + i * (i - 1) / 2 + 1;
}
int n;
while(~scanf("%d", &n))
{
printf("%lld\n", f[n]);
}
return 0;
}