Facebook Hacker Cup 2015

资格赛Cooking the Books

（1）问题:给定一个整数,求交换整数中的两个数字之后的最小值和最大值,交换后的数的首位数字依然不能为0

（2）要点:枚举需要交换数字的位置，O(100)，注意2121、1212和1122等测试样例

第1轮Homework

（1）问题：给定区间[A,B],(2 <= A <= B <= 10000000)，求区间上不同素因子个数等于K(1 <= K <= 1000000000)的数的个数

（2）要点：预计算[1,10000000]的所有数的不同素因子的个数，类似于Eratosthenes筛法，素数的每个倍数的素因子个数加1

（3）参考代码：

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

using std::vector;

static bool enum_distinct_prime_count(unsigned int maxn,vector<unsigned int>& counts)
{
	if(0 == maxn) return false;
	counts.clear();counts.resize(maxn+1,0);
	for(unsigned int p = 2;p <= maxn;++p)
	{
		if(0 != counts[p]) continue;
		counts[p] = 1;
		for(unsigned int v = p+p;v <= maxn;v += p) ++ counts[v];
	}
	return true;
}

int main()
{
	static const unsigned int maxn = 10000000;
	vector<unsigned int> counts;
	enum_distinct_prime_count(maxn,counts);

	unsigned int nCases = 0;scanf("%d",&nCases);
	for(unsigned int iCases = 1;iCases <= nCases;++iCases)
	{
		unsigned int a = 0,b = 0,k = 0;scanf("%d%d%d",&a,&b,&k);

		// 如有需要,这里可以进一步优化
		unsigned int count = 0;
		for(unsigned int i = a;i <= b;++i) count += (counts[i] == k);
		unsigned int ans = count;
		printf("Case #%u: %u\n",iCases,ans);
	}
	return 0;
}

第1轮Winning at Sports

（1）问题：stress-free的比赛定义为你先获取第一分并且你的分数始终比对手高，stressful的比赛定义为在对手拿到最终的分数前你的分数始终不超过对手的分数。问给定一场比赛的比分a-b(b <= a <= 2000)，不同的stress-free和stressful的比赛数。

（2）要点：非降路径和y = x不交的不同路径数、非降路径不跨越y = x的不同路径数

（3）参考代码：

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

using std::vector;

int main()
{
	static const unsigned int module = 1000000007;
	static const unsigned int maxn = 2000;
	vector< vector<unsigned int> > dps[2];
	dps[0].resize(maxn+1,vector<unsigned int>(maxn+1,0));
	dps[1].resize(maxn+1,vector<unsigned int>(maxn+1,0));
	for(unsigned int i = 0;i <= maxn;++i)
	{
		dps[0][0][i] = 1;
		dps[1][0][i] = 1;
	}
	for(unsigned int i = 1;i <= maxn;++i)
	{
		dps[1][i][i] = dps[1][i-1][i];
		for(unsigned int k = i + 1;k <= maxn;++k)
		{
			dps[0][i][k] = (dps[0][i-1][k] + dps[0][i][k-1])%module;
			dps[1][i][k] = (dps[1][i-1][k] + dps[1][i][k-1])%module;
		}
	}
	unsigned int nCases = 0;scanf("%d",&nCases);
	for(unsigned int iCases = 1;iCases <= nCases;++iCases)
	{
		unsigned int s1 = 0,s2 = 0;scanf("%u-%u",&s1,&s2);
		assert(s1 > s2 && s1 <= maxn);
		unsigned int ans1 = dps[0][s2][s1];
		unsigned int ans2 = dps[1][s2][s2];
		printf("Case #%u: %u %u\n",iCases,ans1,ans2);
	}
	return 0;
}