杭电OJ——1220 Cube(详细解答)
2013-04-21 21:22
309 查看
杭电OJ——1220 Cube(详细解答)
分类:数学推断 2013-01-19 10:13246人阅读 评论(0)收藏举报Cube
Problem DescriptionCowl 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 pointsor 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.InputThere 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).OutputFor each test case, you should output the number of pairs that was described above in one line.Sample Input1 2 3Sample Output
0 16 297 HintHint The results will not exceed int type.AuthorGao BoSource杭州电子科技大学第三届程序设计大赛RecommendIgnatius.L这纯粹是一道数学题目,推理如下:
给你一个正方体,切割成单位体积的小正方体,求所有公共顶点数<=2的小正方体的对数。 公共点的数目只可能有:0,1,2,4. 很明显我们用总的对数减掉有四个公共点的对数就可以了。 总的公共点对数:n^3*(n^3-1)/2(一共有[code]n^3块小方块,从中选出2块
)(只有两个小方块之间才存在公共点,我们从所有的小方块中任意选出两个,自然就确定了这两个小方块的公共点的对数,从所有小方块中任意选取两个,总得选取方法数就是所有种类对数数目的总和!)公共点为4的对数:一列有n-1对(n个小方块,相邻的两个为一对符合要求),一个面的共有 n^2列,底面和左面,前面三个方向相同,同理可得,故总数为:3*n^2(n-1)所以结果为:n^3 * (n^3-1) - 3*n^2(n-1)代码如下:
#include<iostream>using namespace std;int main(){char a[1002];int b;while(cin>>a>>b){int len=strlen(a);int sum=0;for(int i=0;i<len;i++){sum=sum*10+a[i]-'0';if(sum>=b){sum=sum%b;}}cout<<sum<<endl;}return 0;}
相关文章推荐
- 杭电OJ——1220 Cube(详细解答)
- 杭电OJ——1220(详细解答)
- 【杭电oj】1220 - Cube(数学水题)
- 杭电OJ 1083——courses(二分图的匹配问题!匈牙利算法解答)
- 杭电1220-Cube
- 杭电ACM1220——Cube~~简单的数学题
- 杭电1220 Cube
- 杭电OJ——1085 Holding Bin-Laden Captive!(母函数解答!)
- 杭电OJ——1024 Max Sum Plus Plus 详细分析+优化全过程
- 杭电 1220 Cube(纯数学)
- 杭电OJ——1248 钱币兑换问题(母函数解答)
- 小白详细讲解快速幂--杭电oj2035-A^B
- 【杭电oj】5053-the Sum of Cube(立方和)
- 【杭电】[1220]Cube
- 【杭电oj】5053-the Sum of Cube(立方和)
- (HDU 6024 女生专场)Building Shops 简单DP详细解答
- 杭电OJ
- 杭电OJ 2005.第几天?
- 每天三题系列之杭电OJ 2006 2007 2008
- 【杭电oj1090】A+B for Input-Output Practice (II)