摘要: Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A <= B <= 1,0 阅读全文
posted @ 2018-01-30 22:44 听说这是最长的名字了 阅读(180) 评论(0) 推荐(0) 编辑
摘要: A. Eleven time limit per test : 1 second memory limit per test: 256 megabytes input: standard input output: standard output Eleven wants to choose a n 阅读全文
posted @ 2018-01-30 13:55 听说这是最长的名字了 阅读(931) 评论(0) 推荐(0) 编辑
摘要: B. Radio Station time limit per test: 2 seconds memory limit per test: 256 megabytes input: standard input output: standard output As the guys fried t 阅读全文
posted @ 2018-01-30 13:52 听说这是最长的名字了 阅读(1126) 评论(0) 推荐(0) 编辑