[ACM]_组合数学
同学少年
没有什么不可能!
展开
-
[ACM] HDU 1695 GCD (容斥原理)
GCDProblem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x and y. Since the number原创 2015-04-09 21:10:47 · 2319 阅读 · 0 评论 -
[ACM] POJ 1026 Cipher (组合数学,置换)
CipherTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19228 Accepted: 5148DescriptionBob and Alice started to use a brand-new encoding scheme. Surpris原创 2014-07-27 11:32:45 · 1845 阅读 · 1 评论 -
[ACM] POJ 3270 Cow Sorting (置换,贪心)
Cow SortingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5946 Accepted: 2263DescriptionFarmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milk原创 2014-07-27 07:45:36 · 1906 阅读 · 0 评论 -
[ACM] hdu 3923 Invoker (Poyla计数,快速幂运算,扩展欧几里得或费马小定理)
InvokerProblem DescriptionOn of Vance's favourite hero is Invoker, Kael. As many people knows Kael can control the elements and combine them to invoke a powerful skill. Vance like Kael v原创 2014-07-25 19:35:07 · 2348 阅读 · 0 评论 -
[ACM] ZOJ 3725 Painting Storages (DP计数+组合)
Painting StoragesTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a straight highway with N storages alongside it labeled by 1,2,3,...,N. Bob asks you to paint all storages with two原创 2014-07-25 14:01:52 · 1980 阅读 · 0 评论 -
[ACM] POJ 2409 Let it Bead (Polya计数)
Let it BeadTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4434 Accepted: 2916Description"Let it Bead" company is located upstairs at 700 Cannery Row原创 2014-07-25 09:55:43 · 3514 阅读 · 1 评论 -
[ACM] POJ 1286 Necklace of Beads (Polya计数,直接套公式)
Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6547 Accepted: 2734DescriptionBeads of red, blue or green colors are connected togeth原创 2014-07-25 10:07:46 · 1981 阅读 · 0 评论 -
[ACM] POJ 3252 Round Numbers (一个区间内二进制中0的个数大于等于1的个数有多少个,组合)
Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8590 Accepted: 3003DescriptionThe cows, as you know, have no fingers or thumbs and thus a原创 2014-07-22 09:45:59 · 3037 阅读 · 0 评论 -
[ACM] POJ 1942 Paths on a Grid (组合)
解题思路:简单题,求解 C(n+m, m) .代码:#include #include using namespace std;long long c(long long n,long long m){ long long ans=1; for(int i=1;i<=m;i++) ans=ans*(n--)/i; return ans;原创 2014-07-23 10:09:30 · 1620 阅读 · 0 评论 -
[ACM] hdu 2049 不容易系列之(4)——考新郎 (组合+错排)
国庆期间,省城HZ刚刚举行了一场盛大的集体婚礼,为了使婚礼进行的丰富一些,司仪临时想出了有一个有意思的节目,叫做"考新郎",具体的操作是这样的:首先,给每位新娘打扮得几乎一模一样,并盖上大大的红盖头随机坐成一排;然后,让各位新郎寻找自己的新娘.每人只准找一个,并且不允许多人找一个.最后,揭开盖头,如果找错了对象就要当众跪搓衣板...看来做新郎也不是容易的事情...原创 2014-07-30 10:01:04 · 1783 阅读 · 0 评论 -
[ACM] FZU 1570 集合划分问题( 不同小球放入相同盒子,第二类Stirling数)
Problem Descriptionn个元素的集合{1,2,...,n}可以划分若干个非空子集。例如,当n=4时,集合{1,2,3,4}可以划分为15个不同的非空子集如下: {{1},{2},{3},{4}},{{1,2},{3},{4}},{{1,3},{2},{4}},{{1,4},{2},{3}},{{2,3},{1},{4}},{{2,4},{1},{3}},{原创 2014-07-30 09:21:40 · 2471 阅读 · 0 评论 -
[ACM] HDU 1796 How many integers can you find (容斥原理)
How many integers can you findProblem Description Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exact原创 2015-04-08 11:15:33 · 2924 阅读 · 0 评论 -
[ACM] hihoCoder 1075 开锁魔法III (动态规划,组合数学)
描述一日,崔克茜来到小马镇表演魔法。其中有一个节目是开锁咒:舞台上有 n 个盒子,每个盒子中有一把钥匙,对于每个盒子而言有且仅有一把钥匙能打开它。初始时,崔克茜将会随机地选择 k 个盒子用魔法将它们打开。崔克茜想知道最后所有盒子都被打开的概率,你能帮助她回答这个问题吗?输入第一行一个整数 T (T ≤ 100)表示数据组数。 对于每组数据,第一行有两个整数 n 和 k (1 ≤原创 2014-11-13 20:50:04 · 2548 阅读 · 0 评论 -
[ACM] HDU 3398 String (从坐标0,0走到m,n且不能与y=x-1相交的方法数,整数唯一分解定理)
StringProblem DescriptionRecently, lxhgww received a task : to generate strings contain '0's and '1's only, in which '0' appears exactly m times, '1' appears exactly n times. Also, any prefix原创 2014-11-11 20:25:48 · 3492 阅读 · 0 评论 -
[ACM] SDUT 2883 Hearthstone II (第二类Stiring数)
Hearthstone IITime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述The new season has begun, you have n competitions and m well prepared decks during the new season. Each c原创 2014-11-07 20:44:58 · 2242 阅读 · 0 评论 -
[ACM] 几道母函数题目 hdu 1028 1398 1085
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12608 Accepted SubmisProblem Description"Well, i原创 2014-07-30 19:01:02 · 1268 阅读 · 0 评论 -
[ACM] POJ 2154 Color (Polya计数优化,欧拉函数)
ColorTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7630 Accepted: 2507DescriptionBeads of N colors are connected together into a circular necklace of原创 2014-07-30 20:46:25 · 1902 阅读 · 0 评论 -
[ACM] hdu 4248 A Famous Stone Collector (DP+组合)
A Famous Stone CollectorProblem DescriptionMr. B loves to play with colorful stones. There are n colors of stones in his collection. Two stones with the same color are indistinguishable. M原创 2014-07-30 15:15:56 · 1826 阅读 · 0 评论 -
[ACM] POJ 1664 放苹果(n个相同小球放入m个相同盒子)
放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25952 Accepted: 16509Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。原创 2014-07-30 09:35:56 · 6166 阅读 · 0 评论 -
[ACM] poj 1496 Word Index(组合计数)
Word IndexTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4541 Accepted: 2567DescriptionEncoding schemes are often used in situations requiring encrypti原创 2014-04-07 21:09:55 · 2319 阅读 · 0 评论 -
[ACM] hdu 1085 Holding Bin-Laden Captive! (母函数变形)
Holding Bin-Laden Captive!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13505 Accepted Submission(s): 6094Problem Description原创 2014-03-26 20:19:32 · 1751 阅读 · 0 评论 -
[ACM] hdu 1134 Game of Connections(大数+Catalan数)
Game of ConnectionsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2923 Accepted Submission(s): 1649Problem Description This原创 2014-04-07 19:34:46 · 1894 阅读 · 0 评论 -
[ACM] hdu 2048 神、上帝以及老天爷 (错位排列公式)
神、上帝以及老天爷Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20118 Accepted Submission(s): 8530Problem DescriptionHDU 2006'10 ACM c原创 2014-03-24 18:21:16 · 2252 阅读 · 0 评论 -
[ACM] hdu 1342 Lotto (排列)
LottoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1360 Accepted Submission(s): 679Problem DescriptionIn a Lotto I have ever原创 2014-03-24 21:12:37 · 1692 阅读 · 0 评论 -
[ACM] hdu 1205 吃糖果(鸽巢原理)
吃糖果Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 21695 Accepted Submission(s): 6185Problem Description HOHO,终于从Speakless手上赢原创 2014-04-01 11:05:18 · 1481 阅读 · 0 评论 -
[ACM] hdu 1286 找新朋友(欧拉函数)
找新朋友Time Limit: 2000/1000 MS(Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s):6928 Accepted Submission(s): 3593Problem Description 新年快到了,“猪头帮协会”准备搞一个聚会,已原创 2014-04-02 20:39:48 · 1248 阅读 · 0 评论 -
[ACM] poj 2369 Permutations (置换群循环节长度)
DescriptionWe remind that the permutation of some final set is a one-to-one mapping of the set onto itself. Less formally, that is a way to reorder elements of the set. For example, one can define a原创 2014-03-31 20:05:34 · 3097 阅读 · 0 评论 -
[ACM] poj 3128 Leonardo's Notebook (置换群,循环节)
Leonardo's NotebookTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1791 Accepted: 787Description— I just bought Leonardo's secret notebook! Rare object原创 2014-04-01 10:43:37 · 2180 阅读 · 0 评论 -
[ACM] hdu 2082 找单词 (母函数)
Problem Description 假设有x1个字母A, x2个字母B,..... x26个字母Z,同时假设字母A的价值为1,字母B的价值为2,..... 字母Z的价值为26。那么,对于给定的字母,可以找到多少价值 Input 输入首先是一个整数N,代表测试实例的个数。然后包括N行数据,每行包括26个 Output 对于每原创 2014-03-28 19:40:06 · 1984 阅读 · 0 评论 -
[ACM] hdu 1465 不容易系列之一(错排复习)
不容易系列之一Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13415 Accepted Submission(s): 5597Problem Description大家常常感慨,要做好一件事情真的不容易,确原创 2014-03-30 14:51:53 · 1303 阅读 · 0 评论 -
[ACM] TOJ 1054 Jesse's Code (素数判断优化+全排列)
DescriptionJesse是个数学迷,他最喜欢研究“哥德巴赫猜想”,因此他的计算机密码也都采用素数。但一直用同一个密码是不安全的,所以他要经常更换他的密码。但他只允许自己的密码中出现某些数字,且密码的每一位都不相同。比如1 2 4,则有6种情况124 142 214 241 412 421。其中241 和 421为素数。为了获得他的密码(他的机器上存放了第4届舜禹杯大学生程序原创 2014-03-25 12:33:17 · 2048 阅读 · 0 评论 -
[ACM] hdu 1028 Ignatius and the Princess III (母函数)
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11475 Accepted Submission(s): 8118Problem Descriptio原创 2014-03-25 20:29:14 · 1543 阅读 · 0 评论 -
[ACM] hdu 1521 排列组合(指数型母函数)
排列组合Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2132 Accepted Submission(s): 877Problem Description有n种物品,并且知道每种物品的数量。要求从中选出m件原创 2014-04-07 14:38:16 · 1731 阅读 · 0 评论 -
[ACM] hdu 2079 选课时间(普通型母函数)
Problem Description 又到了选课的时间了,xhd看着选课表发呆,为了想让下一学期好过点,他想知道学n个学分共有多少组合。你来帮帮他吧。(xhd认为一样学分的课没区别) Input 输入数据的第一行是一个数据T,表示有T组数据。每组数据的第一行是两个整数n(1 接着有k行,每行有两个整数a(1 Output原创 2014-04-07 21:36:20 · 1818 阅读 · 0 评论 -
[ACM] hdu 1398 Square Coins (母函数)
Square CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7452 Accepted Submission(s): 5050Problem DescriptionPeople in Silve原创 2014-03-25 20:55:54 · 1811 阅读 · 2 评论 -
[ACM] hdu 1521 排列组合(组合+DFS)
排列组合Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2119 Accepted Submission(s): 875Problem Description 有n种物品,并且知道每种物品的数量。要求从原创 2014-04-06 23:16:32 · 2519 阅读 · 0 评论 -
[2011山东ACM省赛] Binomial Coeffcients(求组合数)
Binomial CoeffcientsTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述 输入 输出 示例输入31 110 2954 723示例输出1453557658提示 来源山东省第二届ACM大学生程序设计竞赛原创 2014-04-20 17:57:57 · 2269 阅读 · 0 评论 -
[ACM] hdu 2068 RPG的错排 (逆向思考,错排*组合累加)
RPG的错排Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6528 Accepted Submission(s): 2648Problem Description今年暑假杭电ACM集训队第一次组成女生队,原创 2014-03-24 19:32:05 · 2078 阅读 · 0 评论 -
[ACM] hdu 2067 小兔的棋盘(卡特兰数Catalan)
小兔的棋盘Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5814 Accepted Submission(s): 3186Problem Description 小兔的叔叔从外面旅游回来给她带来了一个原创 2014-04-05 20:57:32 · 2155 阅读 · 0 评论 -
[ACM] poj 2249 Binomial Showdown (排列组合公式优化)
DescriptionIn how many ways can you choose k elements out of n elements, not taking order into account?Write a program to compute this number. InputThe input will contain one or more test ca原创 2014-04-05 20:02:14 · 2099 阅读 · 0 评论