UVA 10444

原创 2016年06月01日 11:28:18

Thinking: This question is quite easy if you read it more carefully and actually the problem has already told you how to solve it.

Tip : Since sometimes factorial(n) can be quite large, long long int should be used to avoid run time error.


AC code:

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#define MIN(a,b) ((a)<(b)?(a):(b))
#define lli long long int
using namespace std;

lli fac(lli n)
{
	lli result = 1;
	for (lli i = 1; i <= n; i++)
		result *= i;
	return result;
}

lli combination(int n, int r)
{
	if (r == 0||n == r)
		return 1;
	if (r > n)
		return 0;
	lli facn = fac(n);
	lli facr = fac(r);
	lli facnmr = fac(n - r);
	return facn /(facr*facnmr);
}


int main()
{
	//freopen("in.txt", "r", stdin);
	int n, p;
	int T = 0;
	while (scanf("%d%d", &n, &p) && (n || p))
	{
		T++;
		if (n == 0)
		{	
			printf("Case %d: %d\n", T, 0);
			continue;
		}
		int result = 0;
		int moved = 0;
		for (int k = 0; 1; k++)
		{
			int num = combination(p - 3 + k, MIN(k, p - 3));
			int cost = 1 << k;
			if (moved + num >= n)
			{
				int remain = n - moved;
				result += cost*remain;
				break;
			}
			else
			{
				moved += num;
				result += cost*num;
			}
		}
		printf("Case %d: %d\n", T, result);
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

机器人足球2d uva球队代码

  • 2009-12-14 22:05
  • 2.77MB
  • 下载

UVA Fire!(两点BFS)

Fire! 原题链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem...

uva最全ac代码

  • 2013-07-04 23:19
  • 4.18MB
  • 下载

UVA沃尔多夫在哪里

uva10579 Fibonacci Numbers

矩阵快速幂+高精度

UVA10474 Where is the Marble?

  • 2016-04-29 19:47
  • 146KB
  • 下载

Commando War Uva 11729

  • 2013-08-30 20:35
  • 700B
  • 下载

UVA - 11039 Building designing

题目大意:搭建楼层,下一层比上一层大且颜色交替(即正负交替),问最多能搭几层解题思路:正负数分别存于两个数组,轮流在两个数组取合适的数。模拟过程好复杂而且 WA 好几次。#include #inclu...

uva531 LCS算法

内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)