摘要：
http://blog.csdn.net/zxy_snow/article/details/6339621先保存，搞懂了再来写 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(85)
评论(0)
推荐(0)
摘要：
传送门：Tempter of the Bone 大意是给一个矩阵，叫你是否可以在给定的可走路径上不重复地走，在最后一秒走到终点。我用了两个剪枝... 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(92)
评论(0)
推荐(0)
摘要：
传送门题目大意：从末位到首位输出所在位置的值是1的位置。可以用除----> num>>1 或减---->-（n^(-n))#include#inc... 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(196)
评论(0)
推荐(0)
摘要：
zoj1871题目大意：给你一段长度，起始和末尾一步只能是一个单位长度，每一步和前一步长度差不超过一，问恰好走到终点的最小步... 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(106)
评论(0)
推荐(0)
摘要：
传送门题目大意，对n， 求n^n的最左边一位数的大小；如 f（3）=27，an... 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(92)
评论(0)
推荐(0)
摘要：
2^x mod n = 1Time Limit: 2 Seconds Memory Limit:65536 KBGive a number n, find the minimum x that satisfies 2^x mod n = 1.InputOne positive intege... 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(111)
评论(0)
推荐(0)
摘要：
Binomial ShowdownTime Limit: 2 Seconds Memory Limit:65536 KB In how many ways can you choose k elements out of n elements, not taking order into ... 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(80)
评论(0)
推荐(0)
摘要：
Root of the ProblemTime Limit: 2 Seconds Memory Limit:65536 KB Given positive integers B and N, find an integer A such that AN is as close as pos... 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(171)
评论(0)
推荐(0)
摘要：
Longest Ordered SubsequenceTime Limit: 2 Seconds Memory Limit:65536 KB A numeric sequence of ai is ordered if a1 #include#include#includeusing na... 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(128)
评论(0)
推荐(0)
摘要：
Climbing WormTime Limit: 2 Seconds Memory Limit:65536 KBAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u in... 阅读全文
posted @ 2017-09-27 21:06
nimphy
阅读(119)
评论(0)
推荐(0)
浙公网安备 33010602011771号