joj1175

• Authors
• Contests
•  
• Problems
•  
• Status
•  
• Links

[新版judge已支持special judge；增加了提交后的状态页面；增加对提交代码的语言检查] [新版judge系统近日试运行，希望可以解决内存越界导致Waiting的问题] [more]

Welcome, �γɺ�
[JPoints: 895, Sender!: 0/1]

 1175: The Binomial Function

---

ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K2794827Standard

1st Jilin University ACM International Collegiate Programming Contest

In this problem, you are to write a program to make the value of the binomial function:

where n and m are integers.

Input Specification

The input consists of several pairs of n and m(0<=n, m<=30). The end of input is marked by n=m=0, which should not be processed.

Output Specification

For each pair of n and m, you should print a line like this: "Binom(n, m) = v", where n, m and v have to be replaced by the values of n, m and v.

Sample Input

5 57 05 90 0

Sample Output

Binom(5, 5) = 1Binom(7, 0) = 1Binom(5, 9) = 32

---

This problem is used for contest: 110 

---

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

这是一个简单的先性规划的一个题，一开始我还以为直接用题目中给出的关系式直接递归就可以得到答案结果很不幸超时了。

#include<cstdio>
#include<cstring>
using namespace std;
int Binom[35][35];
void cal()
{
for(int i=0;i<=31;i++)
{
Binom[i][0]=1;
Binom[0][i]=1;
Binom[i][i]=1;
}
for(int i=1;i<=31;i++)
{
for(int j=1;j<=31;j++)
{
if(i!=j)
Binom[i][j]=Binom[i-1][j]+Binom[i-1][j-1];
}
}
}
int main()
{
freopen("in.txt","r",stdin);
cal();
int n,m;
while(scanf("%d%d",&n,&m))
{
if(n==0&&m==0)break;
printf("Binom(%d, %d) = %d\n",n,m,Binom[n][m]);
}
return 0;
}