b***y
发帖数: 2799 | 1 ☆─────────────────────────────────────☆
design (mimi) 于 (Sat Dec 13 18:05:45 2008) 提到:
Design an algorithm to find the kth number divisible by only 3 or 5 or 7 i.e
the only prime factors of these numbers should be 3,5 and 7.
Count the number of possible binary trees given the n nodes contain the same
data ....
☆─────────────────────────────────────☆
rubu (rubu) 于 (Sat Dec 13 18:20:56 2008) 提到:
第一题：
if N(k-1) include 7, change 7 to 3*3;
else if N(K-1) include 5, change 5 to 7;
els |
|
