01 2020 档案

摘要:Bessie noted that although humans have many universities they can attend, cows have none. To remedy this problem, she and her fellow cows formed a new 阅读全文
posted @ 2020-01-31 00:44 funforever 阅读(246) 评论(0) 推荐(0) 编辑
摘要:"Fat and docile, big and dumb, they look so stupid, they aren't muchfun..."- Cows with Guns by Dana LyonsThe cows want to prove to the public that the 阅读全文
posted @ 2020-01-29 15:30 funforever 阅读(232) 评论(0) 推荐(0) 编辑
摘要:A straight dirt road connects two fields on FJ's farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a si 阅读全文
posted @ 2020-01-29 14:57 funforever 阅读(162) 评论(0) 推荐(0) 编辑
摘要:There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine 阅读全文
posted @ 2020-01-26 12:59 funforever 阅读(232) 评论(0) 推荐(0) 编辑
摘要:Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID 阅读全文
posted @ 2020-01-22 18:01 funforever 阅读(114) 评论(0) 推荐(0) 编辑
摘要:Protecting the Flowers Farmer John went to cut some wood and left N (2 ≤ N ≤ 100,000) cows eating the grass, as usual. When he returned, he found to h 阅读全文
posted @ 2020-01-17 14:30 funforever 阅读(153) 评论(0) 推荐(0) 编辑
摘要:Allowance As a reward for record milk production, Farmer John has decided to start paying Bessie the cow a small weekly allowance. FJ has a set of coi 阅读全文
posted @ 2020-01-16 23:18 funforever 阅读(203) 评论(0) 推荐(0) 编辑
摘要:Stall Reservations 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 阅读全文
posted @ 2020-01-16 11:39 funforever 阅读(142) 评论(0) 推荐(0) 编辑
摘要:Cleaning Shifts Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one 阅读全文
posted @ 2020-01-15 16:58 funforever 阅读(162) 评论(0) 推荐(0) 编辑
摘要:おせんべい 問題 IOI製菓では,創業以来の伝統の製法で煎餅(せんべい)を焼いている.この伝統の製法は,炭火で一定時間表側を焼き,表側が焼けると裏返して,炭火で一定時間裏側を焼くというものである.この伝統を守りつつ,煎餅を機械で焼いている.この機械は縦 R (1 ≤ R ≤ 10) 行, 横 C ( 阅读全文
posted @ 2020-01-15 16:33 funforever 阅读(167) 评论(0) 推荐(0) 编辑
摘要:Smallest Difference Given a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing the 阅读全文
posted @ 2020-01-15 16:15 funforever 阅读(206) 评论(0) 推荐(0) 编辑
摘要:日文原文: 7 パズル 7 パズルは 8 つの正方形のカードとこれらのカードがぴたりと収まる枠で構成されています。それぞれのカードには、互いに区別できるように 0, 1, 2, ..., 7 と番号がつけられています。枠には、縦に 2 個、横に 4 個のカードを並べることができます。 7 パズルを始 阅读全文
posted @ 2020-01-15 15:59 funforever 阅读(179) 评论(0) 推荐(0) 编辑
摘要:题目: 有n根棍子,棍子i的长度为ai。想要从中选出三根棍子组成周长尽可能长的三角形。请输出最大的周长,若无法组成三角形则输出0。 限制条件 3 ≤ n ≤ 100 1 ≤ ai ≤ 10^6输入 n = 5 a = {2,3,4,5,10} 输出 12(选择3、4、5时) 输入 n = 4 a = 阅读全文
posted @ 2020-01-09 19:45 funforever 阅读(355) 评论(0) 推荐(0) 编辑