POJ 题目3046 Ant Counting(母函数)
来源:互联网 发布:淘宝退款成功几天到账 编辑:程序博客网 时间:2024/04/27 17:35
Ant Counting
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2946 Accepted: 1175
Description
Bessie was poking around the ant hill one day watching the ants march to and fro while gathering food. She realized that many of the ants were siblings, indistinguishable from one another. She also realized the sometimes only one ant would go for food, sometimes a few, and sometimes all of them. This made for a large number of different sets of ants!
Being a bit mathematical, Bessie started wondering. Bessie noted that the hive has T (1 <= T <= 1,000) families of ants which she labeled 1..T (A ants altogether). Each family had some number Ni (1 <= Ni <= 100) of ants.
How many groups of sizes S, S+1, ..., B (1 <= S <= B <= A) can be formed?
While observing one group, the set of three ant families was seen as {1, 1, 2, 2, 3}, though rarely in that order. The possible sets of marching ants were:
3 sets with 1 ant: {1} {2} {3}
5 sets with 2 ants: {1,1} {1,2} {1,3} {2,2} {2,3}
5 sets with 3 ants: {1,1,2} {1,1,3} {1,2,2} {1,2,3} {2,2,3}
3 sets with 4 ants: {1,2,2,3} {1,1,2,2} {1,1,2,3}
1 set with 5 ants: {1,1,2,2,3}
Your job is to count the number of possible sets of ants given the data above.
Being a bit mathematical, Bessie started wondering. Bessie noted that the hive has T (1 <= T <= 1,000) families of ants which she labeled 1..T (A ants altogether). Each family had some number Ni (1 <= Ni <= 100) of ants.
How many groups of sizes S, S+1, ..., B (1 <= S <= B <= A) can be formed?
While observing one group, the set of three ant families was seen as {1, 1, 2, 2, 3}, though rarely in that order. The possible sets of marching ants were:
3 sets with 1 ant: {1} {2} {3}
5 sets with 2 ants: {1,1} {1,2} {1,3} {2,2} {2,3}
5 sets with 3 ants: {1,1,2} {1,1,3} {1,2,2} {1,2,3} {2,2,3}
3 sets with 4 ants: {1,2,2,3} {1,1,2,2} {1,1,2,3}
1 set with 5 ants: {1,1,2,2,3}
Your job is to count the number of possible sets of ants given the data above.
Input
* Line 1: 4 space-separated integers: T, A, S, and B
* Lines 2..A+1: Each line contains a single integer that is an ant type present in the hive
* Lines 2..A+1: Each line contains a single integer that is an ant type present in the hive
Output
* Line 1: The number of sets of size S..B (inclusive) that can be created. A set like {1,2} is the same as the set {2,1} and should not be double-counted. Print only the LAST SIX DIGITS of this number, with no leading zeroes or spaces.
Sample Input
3 5 2 312213
Sample Output
10
Hint
INPUT DETAILS:
Three types of ants (1..3); 5 ants altogether. How many sets of size 2 or size 3 can be made?
OUTPUT DETAILS:
5 sets of ants with two members; 5 more sets of ants with three members
Three types of ants (1..3); 5 ants altogether. How many sets of size 2 or size 3 can be made?
OUTPUT DETAILS:
5 sets of ants with two members; 5 more sets of ants with three members
Source
USACO 2005 November Silver
乍一看貌似dp,不过母函数可过,,真的没看出后6位,,,渣渣眼神儿
ac代码
#include<stdio.h>#include<string.h>#define mod 1000000int c1[10010],c2[10010],cot[10010];int main(){int t,a,s,b;while(scanf("%d%d%d%d",&t,&a,&s,&b)!=EOF){int i,j,k,ans=0;memset(cot,0,sizeof(cot));memset(c1,0,sizeof(c1));memset(c2,0,sizeof(c2));for(i=0;i<a;i++){int num;scanf("%d",&num);cot[num]++;}for(i=0;i<=cot[1];i++)c1[i]=1;for(i=2;i<=t;i++){for(j=0;j<=b;j++){for(k=0;k+j<=b&&k<=cot[i];k++){c2[j+k]=(c1[j]+c2[j+k])%mod;}}for(j=0;j<=b;j++){c1[j]=c2[j];c2[j]=0;}}for(i=s;i<=b;i++){ans=(ans+c1[i])%mod;}printf("%d\n",ans);}}
0 0
- POJ 题目3046 Ant Counting(母函数)
- POJ 3046 Ant Counting
- POJ-3046-Ant Counting
- poj 3046 Ant Counting
- poj 3046 Ant Counting
- POJ 3046 Ant Counting
- ***POJ 3046 Ant Counting
- POJ 3046 Ant Counting (dp)
- poj 3046 Ant Counting (dp)
- POJ 3046 Ant Counting dp
- POJ3046 Ant Counting 【母函数】
- POJ 3046 Ant Counting(dp----多重集组合数)
- POJ - 3046 Ant Counting(多重集组合数DP)
- POJ 3046 Ant Counting (dp 多重集组合数)
- POJ 3046---Ant Counting(多重组合数)
- POJ 3046 Ant Counting 简单DP
- Ant Counting (poj 3046 分组背包)
- poj 3046 Ant Counting dp 优化
- Struts2——Action(三)
- python常用文本处理功能
- CentOS进入单用户模式
- DB系统预警联系人API
- python编码问题总结
- POJ 题目3046 Ant Counting(母函数)
- CentOS修改主机名
- 常见的几种python字符串方法总结
- 中英文名句对照
- centos开机启动网关
- python处理文本文件实现生成指定格式文件的方法
- Linux鸟哥私房菜基础笔记(一)
- 学习鸟哥的Linux私房菜笔记(1)——基础使用
- Linux鸟哥私房菜基础笔记(二)