组合数学
文章平均质量分 80
Misdom_Tian_Ya
这个作者很懒,什么都没留下…
展开
-
POJ 2947 Widget Factory (高斯消元)
Description The widget factory produces several different kinds of widgets. Each widget is carefully built by a skilled widgeteer. The time required to build a widget depends on its type: the simple原创 2014-11-24 19:56:42 · 506 阅读 · 0 评论 -
POJ 1942 Paths on a Grid (水题)
Description Imagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mastered years ago (this time he's explaining that (a+b)原创 2014-12-13 11:40:11 · 513 阅读 · 0 评论 -
POJ 1026 Cipher (置换群)
Description Bob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They chose the secre原创 2014-12-04 17:44:57 · 501 阅读 · 0 评论 -
POJ 1286 Necklace of Beads(polya计数、burnside定理)
Description Beads of red, blue or green colors are connected together into a circular necklace of n beads ( n < 24 ). If the repetitions that are produced by rotation around the center of the circu原创 2015-05-04 14:56:37 · 423 阅读 · 0 评论 -
POJ 2888 Magic Bracelet (Burnside , 矩阵幂 )
Description Ginny’s birthday is coming soon. Harry Potter is preparing a birthday present for his new girlfriend. The present is a magic bracelet which consists of n magic beads. The are m kinds of原创 2015-05-04 15:31:55 · 389 阅读 · 0 评论 -
POJ 2409 Let it Bead (polya计数,burnside染色)
Description "Let it Bead" company is located upstairs at 700 Cannery Row in Monterey, CA. As you can deduce from the company name, their business is beads. Their PR department found out that custom原创 2015-05-04 10:45:59 · 463 阅读 · 0 评论 -
POJ 2154 Color (polya 欧拉函数)
Description Beads of N colors are connected together into a circular necklace of N beads (N<=1000000000). Your job is to calculate how many different kinds of the necklace can be produced. You shou原创 2015-05-04 15:43:25 · 416 阅读 · 0 评论 -
HDU 1023 Train Problem II(卡特兰数)
Problem Description As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains ca原创 2015-05-06 20:36:29 · 418 阅读 · 0 评论 -
HDU 3625 Examining the Rooms
Problem Description A murder happened in the hotel. As the best detective in the town, you should examine all the N rooms of the hotel immediately. However, all the doors of the rooms are locked, a原创 2015-05-06 21:34:17 · 400 阅读 · 0 评论