2016年1月24日
codeforces 616E Sum of Remainders (数论，找规律）
摘要： Calculate the value of the sum: n mod 1 + n mod 2 + n mod 3 + ... + n mod m. As the result can be very large, you should print the value modulo 109 +  阅读全文
posted @ 2016-01-24 20:38 LittlePointer 阅读(647) 评论(0) 推荐(0)
poj2387 Til the Cows Come Home 最短路径dijkstra算法
摘要： Description Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning 阅读全文
posted @ 2016-01-24 13:15 LittlePointer 阅读(210) 评论(0) 推荐(0)
poj1274 The Perfect Stall (二分最大匹配)
摘要： Description Input Output Sample Input Sample Output AC代码： 阅读全文
posted @ 2016-01-24 13:06 LittlePointer 阅读(175) 评论(0) 推荐(0)