UVA - 10177

最新推荐文章于 2024-09-16 08:31:33 发布

__Kunagisa2774

最新推荐文章于 2024-09-16 08:31:33 发布

阅读量85

点赞数

文章标签：几何学

本文链接：https://blog.csdn.net/jsquerk/article/details/114265293

版权

UVA - 10177

题目介绍：
You can see a (4 × 4) grid below. Can you tell me how many squares and rectangles are hidden there?
You can assume that squares are not rectangles. Perhaps one can count it by hand but can you count
it for a (100 × 100) grid or a (10000 × 10000) grid. Can you do it for higher dimensions? That is can
you count how many cubes or boxes of different size are there in a (10 × 10 × 10) sized cube or how
many hyper-cubes or hyper-boxes of different size are there in a four-dimensional (5 × 5 × 5 × 5) sized
hypercube. Remember that your program needs to be very efficient. You can assume that squares are
not rectangles, cubes are not boxes and hyper-cubes are not hyper-boxes.

大意：
判断有多少个子正方形或其他，有多少子长方形（不包括正方形）。正方形的三个值分别为2的次方和，3的次方和，4的次方和。考虑长方形就是所有子图形的数量减去正方形的数量。固定起点，考虑终点数量，即可算出结果。所有数量分别为1-n的2个，3个，4个的乘积和。

AC代码：

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

typedef long long LL;

LL A[105][3]={0};
LL B[105][3]={0};

void Init(){
	for(LL i=1;i<=100;i++){
		A[i][0]=i*(i+1)*(2*i+1)/6;
		A[i][1]=i*i*(i+1)*(i+1)/4;
		A[i][2]=i*(i+1)*(2*i+1)*(3*i*i+3*i-1)/30;
		for(LL j=1;j<=i;j++)
			for(LL k=1;k<=i;k++){
				B[i][0]+=j*k;
				for(LL p=1;p<=i;p++){
					B[i][1]+=j*k*p;
					for(LL s=1;s<=i;s++)
						B[i][2]+=j*k*p*s;
				}	
			}	
	}
}

int main(){
	Init();
	int n;
	while(scanf("%d",&n)==1){
		int ok=0;
		for(int i=0;i<3;i++){
			if(!ok)ok=1;
			else cout<<' ';
			cout<<A[n][i]<<' '<<B[n][i]-A[n][i];
		}
		cout<<'\n';
	}
	return 0;
}