随笔分类 -  OJ——POJ

摘要:★★☆ 输入文件:rpaths.in 输出文件:rpaths.out 简单对比 时间限制:1 s 内存限制:128 MB Description In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are 阅读全文
posted @ 2017-06-24 20:21 J_william 阅读(211) 评论(0) 推荐(0)
摘要:Description Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cook 阅读全文
posted @ 2017-04-30 19:50 J_william 阅读(318) 评论(0) 推荐(0)
摘要:题目描述 一些学校连入一个电脑网络。那些学校已订立了协议:每个学校都会给其它的一些学校分发软件(称作“接受学校”)。注意即使 B 在 A 学校的分发列表中, A 也不一定在 B 学校的列表中。 你要写一个程序计算,根据协议,为了让网络中所有的学校都用上新软件,必须接受新软件副本的最少学校数目(子任务 阅读全文
posted @ 2017-04-23 19:56 J_william 阅读(204) 评论(0) 推荐(0)
摘要:题目描述 The N (2 <= N <= 10,000) cows are so excited: it's prom night! They are dressed in their finest gowns, complete with corsages and new shoes. They 阅读全文
posted @ 2017-04-23 14:41 J_william 阅读(250) 评论(0) 推荐(0)
摘要:Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 56956 Accepted: 19644 Case Time Limit: 2000MS Description You are working for Macrohard co 阅读全文
posted @ 2017-03-29 10:17 J_william 阅读(310) 评论(0) 推荐(0)
摘要:Time Limit: 12000MS Memory Limit: 65536K Total Submissions: 58002 Accepted: 16616 Case Time Limit: 5000MS Description An array of size n ≤ 106 is give 阅读全文
posted @ 2017-02-18 15:38 J_william 阅读(2700) 评论(0) 推荐(0)