Description
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.
Input
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).
Output
For each test case, you should output the number of pairs that was described above in one line.
Sample Input
1 2 3
Sample Output
0 16 297
Hint
Hint The results will not exceed int type.
这个的主要思想就在于总共就三种情况,没有公共点,2个公共点,4个公共点,要求不小于2个公共点的有多少对,不妨算出总共的对数(排列组合),然后减去4个公共点的情况,结果就出来了
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(~scanf("%d",&n))
{
int s;
s=pow(n,3)*(pow(n,3)-1)/2-3*(n-1)*n*n;
printf("%d\n",s);
}
return 0;
}