摘要：
O(n!) 求长度为n的序列的全排列： ①递归实现：(参考--https://blog.csdn.net/hero_boke/article/details/58637535) #include<cstdio> #include<algorithm> using namespace std; int 阅读全文
posted @ 2018-08-06 21:30
l..q
阅读(146)
评论(0)
推荐(0)
摘要：
Problem Description For a decimal number x with n digits (AnAn-1An-2 ... A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + ... + A2 * 2 阅读全文
posted @ 2018-08-06 11:00
l..q
阅读(206)
评论(0)
推荐(0)
摘要：
Problem Description The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence o 阅读全文
posted @ 2018-08-06 09:57
l..q
阅读(161)
评论(0)
推荐(0)
浙公网安备 33010602011771号