| 2014-11-01 19:57:37 |
1001 |
exactly k-1 problems or at least k-1 problems |
bayygy |
0 |
| 2014-11-01 19:49:24 |
1002 |
英语不好 |
opas |
1 |
| 2014-11-01 19:45:51 |
1001 |
O(n)为啥超时？ |
xindubawukong |
1 |
| 2014-11-01 19:38:59 |
1001 |
如果只有一个元素，是不是答案是0？ |
let__me |
3 |
| 2014-11-01 19:34:07 |
1002 |
n^2复杂度能接受么？ |
ccdd4211 |
1 |
| 2014-11-01 19:26:09 |
1003 |
How many large cases? |
saffah |
1 |
| 2014-11-01 19:21:08 |
1003 |
only the nim-sum (⊕) of the sizes of the heaps is zero will the first player lose |
13600124 |
1 |
| 2014-11-01 19:15:37 |
1002 |
there are two increasing subsequence: [1], [1]. |
12061160 |
1 |
| 2014-11-01 19:15:08 |
1001 |
there are two increasing subsequence: [1], [1]. |
12061160 |
0 |
| 2014-11-01 19:11:29 |
1001 |
lld还是I64D？ |
novchaos |
2 |
