选修
文章平均质量分 71
touch_er
这个作者很懒,什么都没留下…
展开
-
The ? 1 ? 2 ? ... ? n = k problem
Given the following formula, one can set operators ‘+’ or ‘-’ instead of each ‘?’, in order to obtain a given k ?1?2? . . .?n = k For example: to obtain k = 12, the expression to be used will be:原创 2016-04-20 08:41:52 · 437 阅读 · 0 评论 -
HDU 5950 Recursive sequence
Recursive sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 58 Accepted Submission(s): 39 Problem Description Farmer John原创 2016-10-30 20:56:59 · 503 阅读 · 0 评论