- 博客(3)
- 收藏
- 关注
RSS订阅原创 快与慢 0
快与慢 0 a、老板让你最快的计算 f(N) = 13+23+…+N3。逐项计算当然是可以的，如果能直接算出来当然会大大加快电脑计算的速度。 实际上f(N) = (1+2+…+N)2 = N2*(N+1)2/4。
2008-06-09 12:47:00
349
原创 never be fooled
Q: How many numbers are there in [1, 2000], which cannot be divided by neither 6 nor 8. /* Q: How many numbers are there in [1, 2000], which cannot be divided by 6 and 8? */#include /* return leas
2008-04-15 23:23:00
284
原创 one torture
Its about a mistake I blundered when I worked for a aero-related company. We were lack of equipments which hadnt been made or data hadnot been designed entirely to test codes. So I had to admit o
2008-04-15 10:07:00
286
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人