杭电 1220 Cube（纯数学）

Cube

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1273    Accepted Submission(s): 1003

Problem 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

  
  
  
  

   
   
//注：因为有一个面接触的小正方体之间的顶点为4个，其余不超过两个，用总个数去掉接触的正方体，
   
   
//其余(s-4)个均可与其组合，八个顶点均去掉，同理，再算楞上的、面上的、内部的，之和便是所求值。
  
  
  
  

   
   
#include<stdio.h>
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==1){printf("0\n");continue;}
      __int64 s,num;
      s=n*n*n;
      num=(s-4)*8+(s-5)*(n-2)*12+(s-6)*(n-2)*(n-2)*6+(s-7)*(n-2)*(n-2)*(n-2);
      num/=2;
      printf("%d\n",num);
    }
return 0;
}