Codeforces 554C. Kyoya and Colored Balls【组合数 逆元】
来源:互联网 发布:经典伤感网络歌曲 编辑:程序博客网 时间:2024/05/19 02:18
Kyoya Ootori has a bag with n colored balls that are colored with k different colors. The colors are labeled from 1 to k. Balls of the same color are indistinguishable. He draws balls from the bag one by one until the bag is empty. He noticed that he drew the last ball of color ibefore drawing the last ball of color i + 1 for all i from 1 to k - 1. Now he wonders how many different ways this can happen.
The first line of input will have one integer k (1 ≤ k ≤ 1000) the number of colors.
Then, k lines will follow. The i-th line will contain ci, the number of balls of the i-th color (1 ≤ ci ≤ 1000).
The total number of balls doesn't exceed 1000.
A single integer, the number of ways that Kyoya can draw the balls from the bag as described in the statement, modulo 1 000 000 007.
3221
3
41234
1680
In the first sample, we have 2 balls of color 1, 2 balls of color 2, and 1 ball of color 3. The three ways for Kyoya are:
1 2 1 2 31 1 2 2 32 1 1 2 3
题意是,第i 中颜色的最后一个球后面不能出现前 i-1中颜色的球,由于数据范围,用到逆元
//首先考虑最后一种颜色a个,总共s个,必有一个球是放在最后的C(a-1,s-1)之后再如此考虑倒数第二种b个,C(b-1,s-a-1)累乘#include <iostream>#include<cstdio>#include<cstring>#include<cmath>#define maxn 1000010#define MOD 1000000007using namespace std;int num[1010];__int64 r[maxn];//开始数组开小了void mul(){ r[0]=1; for(__int64 i=1;i<=1000000;++i) r[i]=(i*r[i-1])%MOD;}__int64 pow_mul(__int64 a,__int64 b){ __int64 sum=1; while(b) { if(b&1) sum=sum*a%MOD; a=a*a%MOD; b=b/2; } return sum;}int main(){ int k; mul(); while(~scanf("%d",&k)) { int sum_num=0; for(int i=0;i<k;++i) { scanf("%d",&num[i]); sum_num+=num[i]; } __int64 ans=1; for(int i=k-1;i>=0;--i) { ans=ans*(r[sum_num-1]*(pow_mul((r[num[i]-1]*r[sum_num-num[i]]%MOD),MOD-2)%MOD)%MOD)%MOD; sum_num-=num[i];//这里变量名弄错找好久 } printf("%I64d\n",ans); } return 0;}
- Codeforces 554C. Kyoya and Colored Balls【组合数 逆元】
- CodeForces - 554C Kyoya and Colored Balls (组合数学&逆元模板)
- Codeforces--554C--Kyoya and Colored Balls(组合数学)
- Codeforces 554C Kyoya and Colored Balls 【dp + 组合数学】
- CodeForces #554 C Kyoya and Colored Balls
- codeforces 554C Kyoya and Colored Balls 【组合数学+费马小定理】
- codeforces 554C Kyoya and Colored Balls 推公式
- 【47.95%】【codeforces 554C】Kyoya and Colored Balls
- codeforces 553A Kyoya and Colored Balls 组合数学
- codeforces 553A Kyoya and Colored Balls(组合数学)
- Kyoya and Colored Balls CodeForces 553A(组合数学)
- CF#309-DIV2-C. Kyoya and Colored Balls-组合数学
- C. Kyoya and Colored Balls(Codeforces Round #309 (Div. 2))
- Codeforces Round #309 (Div. 2) C. Kyoya and Colored Balls
- Codeforces Round #309 (Div. 2) C. Kyoya and Colored Balls
- CodeForces #309 Div.2 C. Kyoya and Colored Balls
- codeforces 553 A Kyoya and Colored Balls
- Codeforces 553A Kyoya and Colored Balls
- 【HTTP】Fiddler(二) - 使用Fiddler做抓包分析
- 数之和及平均值
- 为什么sublime text中input、img等没有闭合标签?
- 第九周项目1 深复制体验(1)
- 【HTTP】Fiddler(三)- Fiddler命令行和HTTP断点调试
- Codeforces 554C. Kyoya and Colored Balls【组合数 逆元】
- bc Machine 2016 4 22
- jsp页面上做判断
- Lenovo System x3650 M5 安装 windows Server 2012系统
- BestCoder Round #81 (div.2) Machine
- iterator类的方法说明
- c++第四次作业
- HDU2191 DP + 裸 + 多重背包
- HDU 2063(匈牙利算法)