CodeChef 2016年11月问题

ALEXTASK

（1）问题描述：

（2）要点：实际上是计算两两最小公倍数的最小值

（3）代码：

#include <stdio.h>

int main()
{
	static const size_t maxn = 500;
	unsigned int data[maxn] = { 0 };
	unsigned int nCases = 0;scanf("%d",&nCases);
	for(unsigned int iCases = 1;iCases <= nCases;++iCases)
	{
		unsigned int n = 0;scanf("%d",&n);
		for(unsigned int i = 0;i < n;++i) scanf("%d",&data[i]);
		unsigned long long ans = 0xffffffffffffffffLL;
		for(unsigned int i = 0;i < n;++i)
		{
			for(unsigned int k = i + 1;k < n;++k)
			{
				unsigned long long v = lcm<unsigned int,unsigned long long>(data[i],data[k]);
				if(v < ans) ans = v;
			}
		}
		printf("%llu\n",ans);
	}
	return 0;
}

CHSQR

（1）问题描述：

（2）要点：构造法，两个半条平行于对角线的，每一行从1...n

（3）代码：

#include <stdio.h>
#include <vector>

using std::vector;

int main()
{
	unsigned int nCases = 0;scanf("%d",&nCases);
	for(unsigned int iCases = 1;iCases <= nCases;++iCases)
	{
		unsigned int n = 0;scanf("%d",&n);
		vector< vector<unsigned int> > ans(n,vector<unsigned int>(n,0));
		// 构造法
		for(unsigned int i = 0;i < n/2;++i)
		{
			for(unsigned int k = n - n/2 + i,p = 0;p < n;++p,k = (k+1)%n)
			{
				ans[i][k] = p + 1;
			}
		}
		for(unsigned int i = n/2;i < n;++i)
		{
			for(unsigned int k = i-n/2,p = 0;p < n;++p,k = (k+1)%n)
			{
				ans[i][k] = p + 1;
			}
		}
		for(unsigned int i = 0;i < n;++i)
		{
			for(unsigned int k = 0;k < n;++k) printf("%d ",ans[i][k]);
			printf("\n");
		}
	}
	return 0;
}

CPERM

（1）问题描述：

（2）要点：C(n-1,1)+C(n-1,2)+……+C(n-1,n-2)=2^(n-1)-2。注意，当n = 1,答案应该是0

（3）代码：

#include <stdio.h>
#include <vector>

using std::vector;

int main()
{
	static const unsigned int module = 1000000007;
	unsigned int nCases = 0;scanf("%d",&nCases);
	for(unsigned int iCases = 1;iCases <= nCases;++iCases)
	{
		unsigned int n = 0;scanf("%d",&n);
		unsigned int ans = 0;
		if(n > 1)
		{
			ans = quick_modexp(2,module,n-1);
			ans += module;ans -= 2;ans %= module;
		}
		printf("%u\n",ans);
	}
	return 0;
}

GIFTCHEF

（1）问题描述：

（2）要点：

（3）代码：