ICPC-组合数学
文章平均质量分 74
组合数学的题解
海岛Blog
专注于程序设计及其竞赛,专注于集成电路EDA设计
展开
-
HDU2079 选课时间【母函数】
选课时间Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11123 Accepted Submission(s): 8045Problem Description又到了选课的时间了,xhd看着选课表发呆,为了想让下一学期好过点,他想知道学n个学分共有多少组合。你来帮帮他吧。(xhd认为一样学分的课没区别)Input输入数据的第一行是原创 2022-04-25 14:36:23 · 188 阅读 · 0 评论 -
HDU2110 Crisis of HDU【母函数】
Crisis of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8249 Accepted Submission(s): 2552Problem Description话说上回讲到HDU大战东洋小苟,结果自然是中方大胜,这一战也使得海东集团在全球同行业中的地位更加巩固。随着集团的发展,很多创业时期的元老逐步功成身退,先是860原创 2022-04-25 14:16:43 · 206 阅读 · 0 评论 -
HDU2082 找单词【母函数】
找单词Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14295 Accepted Submission(s): 9685Problem Description假设有x1个字母A, x2个字母B,… x26个字母Z,同时假设字母A的价值为1,字母B的价值为2,… 字母Z的价值为26。那么,对于给定的字母,可以找到多少价值<=50的原创 2022-04-25 13:47:02 · 217 阅读 · 0 评论 -
HDU2152 Fruit【母函数】
FruitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6884 Accepted Submission(s): 4049Problem Description转眼到了收获的季节,由于有TT的专业指导,Lele获得了大丰收。特别是水果,Lele一共种了N种水果,有苹果,梨子,香蕉,西瓜……不但味道好吃,样子更是好看。于是,很多人们慕原创 2022-04-24 23:05:22 · 191 阅读 · 0 评论 -
POJ3370 UVA11237 HDU1808 Halloween treats【鸽笼原理】
Halloween treatsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11017 Accepted: 3823 Special JudgeDescriptionEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that原创 2021-08-12 08:08:39 · 208 阅读 · 0 评论 -
UVA11347 Multifactorials【阶乘+组合】
A generalization of the factorials gives us multifactorials:n! = n ∗ (n − 1) ∗ (n − 2) ∗ (n − 3). . .n!! = n ∗ (n − 2) ∗ (n − 4) ∗ (n − 6). . .n!!! = n ∗ (n − 3) ∗ (n − 6) ∗ (n − 9). . .In general (there are k marks ‘!’):n!! . . .! = n ∗ (n − k) ∗ (n原创 2021-06-26 10:48:28 · 170 阅读 · 0 评论 -
UVA10063 Knuth‘s Permutation【排列组合】
There are some permutation generation techniques in Knuth’s book “The Art of Computer Programming - Volume 1”. One of the processes is as follows: For each permutation A1A2 . . . An−1 form n others by inserting a character n in all原创 2021-05-30 05:40:26 · 227 阅读 · 0 评论 -
UVA10375 POJ2613 ZOJ1863 Choose and divide【组合计算+迭代】
Choose and divideTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4366 Accepted: 1385DescriptionThe binomial coefficient C(m,n) is defined asC(m,n)=m!n!(m−n)! C(m,n)=\frac{m!}{n!(m-n)!} C(m,n)=n!(m−n)!m!Given four natural numbers p, q, r,原创 2021-02-26 00:44:31 · 214 阅读 · 0 评论 -
UVA10338 Mischievous Children【组合数学】
Adam’s parents put up a sign that says “CONGRATULATIONS”. The sign is so big that exactly one letter fits on each panel. Some of Adam’s younger cousins got bored during the reception and decided to re...原创 2020-04-27 22:01:38 · 321 阅读 · 0 评论 -
POJ2356 Find a multiple【前缀和+抽屉原理】
Find a multipleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10329 Accepted: 4402 Special JudgeDescriptionThe input contains N natural (i.e. positive integer) numbers ( N <= 1000...原创 2020-04-13 00:26:36 · 305 阅读 · 0 评论 -
HDU1799 循环多少次?【打表】
循环多少次?Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6550 Accepted Submission(s): 2533 Problem Description 我们知道,在编程中,我们时常需要考虑到时间复杂度...原创 2017-04-01 09:25:37 · 1303 阅读 · 0 评论 -
UVA10790 How Many Points of Intersection?【组合】
We have two rows. There are a dots on the top row and b dots on the bottom row. We draw line segments connecting every dot on the top row with every dot on the bottom row. The dots are arranged in suc...原创 2019-02-18 04:11:08 · 423 阅读 · 0 评论 -
UVA11538 Chess Queen【组合】
You probably know how the game of chess is played and how chess queen operates. Two chess queens are in attacking position when they are on same row, column or diagonal of a chess board. Suppose two s...原创 2019-02-15 06:16:35 · 298 阅读 · 0 评论 -
UVA10493 Cats, with or without Hats【组合】
A cat wears a hat if and only if it has N cats in its hat. There is exactly one cat that is not inside any other cat’s hat. If there are M cats without hats, how many cats are there?InputInput consi...原创 2019-02-15 04:35:55 · 343 阅读 · 0 评论 -
UVA11480 Jimmy's Balls【组合】
Jimmy has a very large bag full of balls. Each ball has a single color. There are three colors; red, blue and green. There is atleast one ball of each type and the number of blue balls is more than th...原创 2019-02-14 18:16:52 · 385 阅读 · 0 评论 -
UVA10098 Generating Fast【全排列】
Generating permutation has always been an important problem in computer science. In this problemyou will have to generate the permutation of a given string in ascending order. Remember that youralgori原创 2017-07-03 04:00:43 · 1120 阅读 · 0 评论 -
UVA146 POJ1146 ID Codes【全排列】
ID CodesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6932 Accepted: 4115DescriptionIt is 2084 and the year of Big Brother has finally arrived, albeit原创 2017-07-03 04:24:18 · 1162 阅读 · 0 评论 -
POJ1731 Orders【全排列+字符串排序】
OrdersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10868 Accepted: 6517DescriptionThe stores manager has sorted all kinds of goods in an alphabetical原创 2017-07-15 00:07:30 · 823 阅读 · 0 评论 -
HDU2200 Eddy's AC难题【组合计算】
Eddy's AC难题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5860 Accepted Submission(s): 2782Problem DescriptionEddy是个ACMer,他不仅喜欢做ACM题原创 2017-07-23 21:46:35 · 1210 阅读 · 0 评论 -
HDU5100 Chessboard【组合数学】
ChessboardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1222 Accepted Submission(s): 526Problem DescriptionConsider the problem of tiling a...原创 2017-07-28 09:43:47 · 920 阅读 · 0 评论 -
HDU2519 新生晚会【组合计算】
新生晚会Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14344 Accepted Submission(s): 4932Problem Description开学了,杭电又迎来了好多新生。ACMer想为新生原创 2017-06-27 09:57:08 · 2903 阅读 · 9 评论 -
UVA10910 Marks Distribution【组合+DP】
In an examination one student appeared in N subjects and has got total T marks. He has passed inall the N subjects where minimum mark for passing in each subject is P. You have to calculate thenumber原创 2018-02-06 06:39:22 · 496 阅读 · 0 评论 -
POJ1306 UVA369 UVALive5341 Combinations【组合计算】
Computing the exact number of ways that N things can be taken M at a time can be a great challenge when N and/or M become very large. Challenges are the stuff of contests. Therefore, you are to make j...原创 2018-02-17 09:06:43 · 963 阅读 · 0 评论 -
UVA294 UVALive5595 Divisors【正因子数】
Mathematicians love all sorts of odd properties of numbers. For instance, they consider 945 to be an interesting number, since it is the first odd number for which the sum of its divisors is larger th...原创 2018-02-17 07:00:01 · 711 阅读 · 0 评论 -
SPOJ-MARBLES Marbles【组合】
Marbles SPOJ - MARBLES Hänschen dreams he is in a shop with an infinite amount of marbles. He is allowed to select n marbles. There are marbles of k different colors. From each color there are also in...原创 2018-03-25 06:49:02 · 430 阅读 · 0 评论 -
POJ2249 ZOJ1938 UVA530 Binomial Showdown【组合计算】
Binomial ShowdownTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20690 Accepted: 6366DescriptionIn how many ways can you choose k elements out of n elements, not taking order into account? W...原创 2018-07-12 10:34:05 · 503 阅读 · 0 评论 -
UVA12034 Race【排列】
Disky and Sooma, two of the biggest mega minds of Bangladesh went to a far country. They ate, coded and wandered around, even in their holidays. They passed several months in this way. But everything ...原创 2019-01-26 08:33:15 · 475 阅读 · 0 评论 -
POJ3421 X-factor Chains【分解质因子+组合数学】
问题链接:POJ3421 X-factor Chains。题意简述:输入正整数x,求x的因子组成的满足任意前一项都能整除后一项的序列的最大长度,以及所有不同序列的个数。问题分析:首先要对x进行因子分解。这样可以得到总的因子个数c,不同的因子为f1,f2,...,fn其次方数分别为e1,e2,...,en。那么,不同序列的个数为c!/(e1!e2!......en!)。程序说原创 2017-05-20 08:56:55 · 2706 阅读 · 1 评论