hdoj--1220--Cube(数学推导)
2016-03-05 13:49
459 查看
Cube
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1723 Accepted Submission(s): 1368
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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).
[align=left]Output[/align]
For each test case, you should output the number of pairs that was described above in one line.
[align=left]Sample Input[/align]
1 2 3
[align=left]Sample Output[/align]
0 16 297 HintHint The results will not exceed int type.
[align=left]Author[/align]
Gao Bo
#include<cstdio> #include<cstring> int main() { int n; while(scanf("%d",&n)!=EOF) { printf("%d\n",n*n*n*(n*n*n-1)/2-3*n*n*(n-1)); } return 0; }
相关文章推荐
- 利用vba将excel中的图片链接直接转换为图片
- poj Subsequence 3061 (高效&DP)
- arm-linux-gnueabi-gcc/g++ 编译opencv
- LeetCode 51 - N-Queens
- Android中的HandlerThread和IntentService
- 数据结构课程上机实验题(一)
- HDOJ 1220-Cube【数学推理】
- android编译与反编译
- handler机制详解
- hdu 1232 畅通工程(基础模板)
- Bellman-Ford(贝尔曼,福特)算法——解决负权边
- 30道四则运算
- DataGrid 刷新选中问题
- oc去除空格方法和判断空格方法
- 白话Spring(基础篇)---AOP(实例篇-4)
- Android几种在其他线程中更新UI的方法
- PAT1039
- Android 将assets中的文件拷贝到本地SD卡使用
- 安装zookeeper
- 软件工程实验一--编程随机生成30个四则运算,算数包括100以内的整数和真分数。