| | | |

2015年8月9日

摘要： In an open credit system, the students can choose any course they like, but there is a problem. Some of the students are more senior than other studen 阅读全文

posted @ 2015-08-09 20:35 竹林灯火阅读(285) 评论(0) 推荐(0)

高效算法——J 中途相遇法，求和

摘要：恢复内容开始 J - 中途相遇法 Time Limit:9000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status J - 中途相遇法 Submit Status Description The SUM problem can 阅读全文

posted @ 2015-08-09 19:52 竹林灯火阅读(383) 评论(0) 推荐(0)