题意:将一球形蛋糕切N刀,最多可切多少块。

分析:推规律

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<string>
 4 #include<cstring>
 5 #include<set>
 6 #include<map>
 7 #include<algorithm>
 8 #include<cstdlib>
 9 #include<vector>
10 #include<cmath>
11 #include<sstream>
12 using namespace std;
13 int main()
14 {
15     int T;
16     scanf("%d", &T);
17     while(T--)
18     {
19         int n;
20         scanf("%d", &n);
21         printf("%d\n", (n * n * n + 5 * n) / 6 + 1);
22     }
23     return 0;
24 }

 

相关文章:

  • 2022-12-23
  • 2022-12-23
  • 2021-09-15
  • 2021-11-27
  • 2021-12-27
  • 2021-09-08
  • 2022-12-23
  • 2022-12-23
猜你喜欢
  • 2021-09-11
  • 2022-01-20
  • 2021-08-04
  • 2022-01-24
  • 2021-08-02
  • 2021-07-19
相关资源
相似解决方案