ACM-简单题之Ignatius and the Princess II——hdu1027

最新推荐文章于 2020-03-06 11:05:11 发布

ltree98

最新推荐文章于 2020-03-06 11:05:11 发布

阅读量3.5k

点赞数 1

分类专栏： ACM-简单题漫漫刷题路文章标签： ACM 简单题 Ignatius and the Pri hdu1027 康托展开

本文链接：https://blog.csdn.net/lttree/article/details/26244269

版权

博客介绍了如何利用康托展开解决编程竞赛题目‘Ignatius and the Princess II’，该题要求找到N的第m种排列。通过分析数据范围，发现只需关注最后8个数的变化，前N-8部分保持固定。作者提供了解决问题的思路，并分享了实现AC（Accepted）的技巧，即预先计算答案并一次性输出。

摘要由CSDN通过智能技术生成

转载请注明出处：http://blog.csdn.net/lttree

Ignatius and the Princess II

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4436 Accepted Submission(s): 2642

Problem Description

Now our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is about to kill our pretty Princess. But now the BEelzebub has to beat our hero first. feng5166 says, "I have three question for you, if you can work them out, I will release the Princess, or you will be my dinner, too." Ignatius says confidently, "OK, at last, I will save the Princess."

"Now I will show you the first problem." feng5166 says, "Given a sequence of number 1 to N, we define that 1,2,3...N-1,N is the smallest sequence among all the sequence which can be composed with number 1 to N(each number can be an