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

建议使用的浏览器:

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

6961:I love cube

题目描述
Give you a cube with a side length of n-1. Find the number of equilateral triangles with three points on the cube point. Each side must be parallel to a certain surface of Oxy, Oxz, Oyz. Now you need to count how many such triangles there are.Each point can only be on the boundary or inner point of the cube, and the three coordinates x, y, and z of each point must be integers.
输入解释
The first line contains an integer $T(T<=1e5)$ . Then $T$ test cases follow.

Each test case contains a single Integer $n(0<=n<=1e18)$.

If n=0, output 0
输出解释
For each case, print an integer, which is the answer modulo $10^9+7$
输入样例
2
1
2
输出样例
0
8

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

源链接: HDU-6961

最后修改于 2021-10-23T19:10:50+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 524288/524288K(Java/Others)