上一页 1 ··· 47 48 49 50 51 52 53 54 55 ··· 60 下一页
摘要: [Educational Codeforces Round 16]D. Two Arithmetic Progressions 试题描述 You are given two arithmetic progressions: a1k + b1 and a2l + b2. Find the number 阅读全文
posted @ 2016-08-25 14:50 xjr01 阅读(290) 评论(0) 推荐(0) 编辑
摘要: [Educational Codeforces Round 16]C. Magic Odd Square 试题描述 Find an n × n matrix with different numbers from 1 to n2, so the sum in each row, column and 阅读全文
posted @ 2016-08-25 14:42 xjr01 阅读(172) 评论(0) 推荐(0) 编辑
摘要: [Educational Codeforces Round 16]B. Optimal Point on a Line 试题描述 You are given n points on a line with their coordinates xi. Find the point x so the s 阅读全文
posted @ 2016-08-25 14:40 xjr01 阅读(222) 评论(0) 推荐(0) 编辑
摘要: [Educational Codeforces Round 16]A. King Moves 试题描述 The only king stands on the standard chess board. You are given his position in format "cd", where 阅读全文
posted @ 2016-08-25 14:37 xjr01 阅读(177) 评论(0) 推荐(0) 编辑
摘要: Day 1 理论上,我现在不应该坐在电脑前打字,因为早在今天上午 6:20 全体新高一同学就坐车前往军(无)训(尽)基(炼)地(狱)了,而今天上午 6:20 我还在被窝里呢…… 没错,我旷掉了军训,然而不幸的是还得写“军训日记”,所以我便在博客上出版这一期文章,记下这几天的回忆和感受,做个念想。 早 阅读全文
posted @ 2016-08-24 19:47 xjr01 阅读(227) 评论(0) 推荐(0) 编辑
摘要: [POJ1383]Labyrinth 试题描述 The northern part of the Pyramid contains a very large and complicated labyrinth. The labyrinth is divided into square blocks, 阅读全文
posted @ 2016-08-24 17:21 xjr01 阅读(256) 评论(0) 推荐(0) 编辑
摘要: [POJ1157]LITTLE SHOP OF FLOWERS 试题描述 You want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers, each be 阅读全文
posted @ 2016-08-24 16:22 xjr01 阅读(269) 评论(0) 推荐(0) 编辑
摘要: [POJ1338]Ugly Numbers 试题描述 Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, ... shows the 阅读全文
posted @ 2016-08-24 15:10 xjr01 阅读(199) 评论(0) 推荐(0) 编辑
摘要: [POJ1004]Financial Management 试题描述 Larry graduated this year and finally has a job. He's making a lot of money, but somehow never seems to have enough 阅读全文
posted @ 2016-08-24 15:05 xjr01 阅读(198) 评论(0) 推荐(0) 编辑
摘要: [BZOJ2908]又是nand 试题描述 首先知道A nand B=not(A and B) (运算操作限制了数位位数为K)比如2 nand 3,K=3,则2 nand 3=not (2 and 3)=not 2=5。 给出一棵树,树上每个点都有点权,定义树上从a到b的费用为0与路径上的点的权值顺 阅读全文
posted @ 2016-08-24 10:45 xjr01 阅读(281) 评论(0) 推荐(0) 编辑
上一页 1 ··· 47 48 49 50 51 52 53 54 55 ··· 60 下一页