hdoj 1220 Cube

Cube

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

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


   
   

    
    

     
     Hint
    
    
Hint
   
   
   
    
The results will not exceed int type.
  
  

 

Author

Gao Bo

 

Source

杭州电子科技大学第三届程序设计大赛

重在理解题意，加上数学/逻辑思维。

嗯 求任意两个单元格公共点小于等于2的对数；可能的公共点数有0,2,4；

总的对数减去公共点为4的对数：如图，3（前，左，底三个方向）*n*n(每个面的列数)*（n-1）（每列的对数）

代码：

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    int n,sum;
    while(~scanf("%d",&n))
    {
        sum=n*n*n*(n*n*n-1)/2-3*n*n*(n-1);//别忘除以2，避免重复计算的对数
        printf("%d\n",sum);
    }
    return 0;
}