2015编程之美测试赛第二题之大神与三位小伙伴

最新推荐文章于 2024-07-15 10:54:21 发布

xj_nian2014

最新推荐文章于 2024-07-15 10:54:21 发布

阅读量511

点赞数

分类专栏： C++ 文章标签：编程之美

本文链接：https://blog.csdn.net/Xuejie_N/article/details/45012353

版权

C++ 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

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

int main()
{
	int n;
	cin >> n;
	int *data = new int[n];
	long long value = (pow(10, 9) + 7);
	long long *count = new long long[n]();
	int i = 0;
	while (i < n)
	{

int temp;
		cin >> temp;
		data[i]=temp;
		i++;
	}
	for (long long j = 0; j < n; j++)
	{
		long long  N = data[j];
		if (N == 1)
		{
			count[j] = 1;
			continue;
		}
		for (long long k = 1; k <= N; k++)
		{
			long long num1 = N + 1 - k;			
			for (long long m = 1; m <= N; m++)
			{
				long  long num2 = N + 1 - m;
				for (long long h = 1; h <= N; h++)
				{
					long long num3 = N + 1 - h;
					if ((num1 == num2 &&num1 == num3) || (num1 != num2&&num1 != num3&&num2 != num3))
					{
						long long result = (num1*num2*num3) % value; //(num1*num2*num3)-((num1 *num2*num3) / value)*value;

count[j] += result;
						if (count[j] > value)
						{
							count[j] %= value;
						}
					}
					else if (k==m&&k<h)
					{
						break;
					}
					else
					{
						continue;
					}
				}
			}
		}

}
	for (long long i = 0; i < n; i++)
	{
		cout << "Case " << i + 1 << ": " << count[i] << endl;
	}
	delete[] data;
	delete[] count;
	return 0;
}

</cmath></iostream>