摘要：
Pascal's Travels Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Pascal's Travels Submit Status Description An n x 阅读全文
posted @ 2018-08-08 17:31
西*风
阅读(238)
评论(0)
推荐(0)
摘要：
You want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers, each being of a different kind, and at least 阅读全文
posted @ 2018-08-08 16:38
西*风
阅读(342)
评论(0)
推荐(0)
摘要：
You are given an array consisting of nn integers a1,a2,…,ana1,a2,…,an , and a positive integer mm . It is guaranteed that mm is a divisor of nn . In a 阅读全文
posted @ 2018-08-08 15:18
西*风
阅读(196)
评论(0)
推荐(0)
摘要：
传送门： http://poj.org/problem?id=1050 To the Max Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 52306 Accepted: 27646 Description Given a tw 阅读全文
posted @ 2018-08-08 10:18
西*风
阅读(304)
评论(0)
推荐(0)
浙公网安备 33010602011771号