2018年2月6日
POJ 3590 The shuffle Problem
摘要： Any case of shuffling of n cards can be described with a permutation of 1 to n. Thus there are totally n! cases of shuffling. Now suppose there are 5 阅读全文
posted @ 2018-02-06 20:41 Z-Y-Y-S 阅读(288) 评论(0) 推荐(0)
POJ 2154 Color
摘要： 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 阅读全文
posted @ 2018-02-06 15:03 Z-Y-Y-S 阅读(245) 评论(0) 推荐(0)
POJ 1286 Necklace of Beads
摘要： 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 prod 阅读全文
posted @ 2018-02-06 11:18 Z-Y-Y-S 阅读(288) 评论(0) 推荐(0)
POJ 3270 Cow Sorting
摘要： Description Farmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in the range 1... 阅读全文
posted @ 2018-02-06 10:16 Z-Y-Y-S 阅读(447) 评论(0) 推荐(0)