06 2017 档案

摘要:A. Treasure Hunt time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Captain Bill the Humming 阅读全文
posted @ 2017-06-17 11:39 joeylee97 阅读(369) 评论(0) 推荐(0) 编辑
摘要:Cleaning Robot Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4952 Accepted: 1921 Description Here, we want to solve path planning for a m 阅读全文
posted @ 2017-06-15 14:30 joeylee97 阅读(318) 评论(0) 推荐(0) 编辑
摘要:Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7866 Accepted: 2586 Description The Robot Moving Institute is using a robot in their local 阅读全文
posted @ 2017-06-15 08:59 joeylee97 阅读(180) 评论(0) 推荐(0) 编辑
摘要:Description 7月17日是Mr.W的生日,ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕,每层都是一个圆柱体。 设从下往上数第i(1 <= i <= M)层蛋糕是半径为Ri, 高度为Hi的圆柱。当i < M时,要求Ri > Ri+1且Hi > Hi+1。 由于要在蛋糕上抹奶油,为尽可 阅读全文
posted @ 2017-06-11 08:20 joeylee97 阅读(186) 评论(0) 推荐(0) 编辑
摘要:Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13381 Accepted: 5208 Description The cows, as you know, have no fingers or thumbs and thus 阅读全文
posted @ 2017-06-10 14:46 joeylee97 阅读(222) 评论(0) 推荐(0) 编辑
摘要:Description Transmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well k 阅读全文
posted @ 2017-06-10 10:32 joeylee97 阅读(271) 评论(0) 推荐(0) 编辑
摘要:C. An impassioned circulation of affection time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outp 阅读全文
posted @ 2017-06-08 20:21 joeylee97 阅读(294) 评论(0) 推荐(0) 编辑
摘要:Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17324 Accepted: 5835 Special Judge Description My birthday is coming up and traditionally I 阅读全文
posted @ 2017-06-07 17:57 joeylee97 阅读(232) 评论(0) 推荐(0) 编辑
摘要:Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 17050 Accepted: 4503 Description When a thin rod of length L is heated n degrees, it expand 阅读全文
posted @ 2017-06-07 17:40 joeylee97 阅读(173) 评论(0) 推荐(0) 编辑
摘要:1414 冰雕 题目来源: CodeForces 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 收藏 关注 1414 冰雕 题目来源: CodeForces 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 1414 冰雕 题目 阅读全文
posted @ 2017-06-05 18:06 joeylee97 阅读(130) 评论(0) 推荐(0) 编辑
摘要:1393 0和1相等串 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 收藏 关注 1393 0和1相等串 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 1393 0和1相等串 基准时间限制:1 秒 空间限制:131072 K 阅读全文
posted @ 2017-06-04 19:12 joeylee97 阅读(229) 评论(0) 推荐(0) 编辑
摘要:Problem Description There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at first he must know the minim 阅读全文
posted @ 2017-06-02 17:37 joeylee97 阅读(151) 评论(0) 推荐(0) 编辑
摘要:C. Vladik and Memorable Trip time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Vladik a 阅读全文
posted @ 2017-06-01 18:19 joeylee97 阅读(204) 评论(0) 推荐(0) 编辑
摘要:C. Do you want a date? time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Do you want a 阅读全文
posted @ 2017-06-01 18:11 joeylee97 阅读(170) 评论(0) 推荐(0) 编辑
摘要:Problem Description There are many secret openings in the floor which are covered by a big heavy stone. When the stone is lifted up, a special mechani 阅读全文
posted @ 2017-06-01 14:11 joeylee97 阅读(258) 评论(0) 推荐(0) 编辑
摘要:重心: 阅读全文
posted @ 2017-06-01 09:30 joeylee97 阅读(590) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示