当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1220:Cube

题目描述
Cowl is good at solving math problems. One day a friend asked him such a question: You are given a cube whose edge length is N, it is cut by the planes that was paralleled to its side planes into N * N * N unit cubes. Two unit cubes may have no common points or two common points or four common points. Your job is to calculate how many pairs of unit cubes that have no more than two common points.

Process to the end of file.
输入解释
There will be many test cases. Each test case will only give the edge length N of a cube in one line. N is a positive integer(1<=N<=30).
输出解释
For each test case, you should output the number of pairs that was described above in one line.
输入样例
1
2
3
输出样例
0
16
297


The results will not exceed int type.
来自杭电HDUOJ的附加信息
Author Gao Bo
Recommend Ignatius.L

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1220

最后修改于 2020-10-25T22:43:00+00:00 由爬虫自动更新

共提交 3

通过率 100.0%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)