- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Area(Pick)
Area Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7064 Accepted: 3031Description Being well known for its highly innovative products, Merck would definitely be a good target f
2017-12-13 17:39:33
277
转载 D - Buy Low Sell High(multiset)
You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day you will
2017-12-11 20:09:40
518
原创 1031. Hello World for U (20)
Hello World for U (20) Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, “helloworld” can be printed as:h d e l l r lowoThat is, the c
2017-12-08 09:07:38
258
原创 1009. Product of Polynomials (25)
Product of Polynomials (25) This time, you are supposed to find A*B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, and each li
2017-12-06 19:26:44
178
原创 1008. Elevator (20)
Elevator (20) The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. I
2017-12-06 17:40:48
197
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人