Fellow me on GitHub

随笔分类 -  动态规划

摘要:题目1 : 相似颜色 题目1 : 相似颜色 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 在CSS中我们可以用井号(#)加6位十六进制数表示一种颜色,例如#000000是黑色,#ff0000是红色,#ffd700是金色。 同时也可以将六位颜色#RRGGBB简写为#RG 阅读全文
posted @ 2018-03-06 22:04 Penn000 阅读(433) 评论(0) 推荐(0) 编辑
摘要:Pick The Sticks Time Limit: 15000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2398 Accepted Submission(s): 78 阅读全文
posted @ 2017-10-08 16:42 Penn000 阅读(135) 评论(0) 推荐(0) 编辑
摘要:Tree chain problem Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1798 Accepted Submission(s): 5 阅读全文
posted @ 2017-09-13 21:48 Penn000 阅读(333) 评论(0) 推荐(0) 编辑
摘要:Computer Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 30923 Accepted Submission(s): 3861 Probl 阅读全文
posted @ 2017-09-13 14:50 Penn000 阅读(133) 评论(0) 推荐(0) 编辑
摘要:array array array Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 114 Accepted Submission(s): 65 阅读全文
posted @ 2017-09-10 20:56 Penn000 阅读(175) 评论(0) 推荐(0) 编辑
摘要:Travelling Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8103 Accepted Submission(s): 2642 Prob 阅读全文
posted @ 2017-08-19 21:50 Penn000 阅读(175) 评论(0) 推荐(0) 编辑
摘要:Tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1574 Accepted Submission(s): 511 Problem Des 阅读全文
posted @ 2017-08-16 19:37 Penn000 阅读(189) 评论(0) 推荐(0) 编辑
摘要:C. The Values You Can Make time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:standard output Pari wants to 阅读全文
posted @ 2017-08-16 16:32 Penn000 阅读(214) 评论(0) 推荐(0) 编辑
摘要:How many ways?? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3630 Accepted Submission(s): 1402 阅读全文
posted @ 2017-08-05 21:59 Penn000 阅读(218) 评论(0) 推荐(0) 编辑
摘要:炮 Description 众所周知,双炮叠叠将是中国象棋中很厉害的一招必杀技。炮吃子时必须隔一个棋子跳吃,即俗称"炮打隔子"。 炮跟炮显然不能在一起打起来,于是rly一天借来了许多许多的炮在棋盘上摆了起来……他想知道,在N×M的矩形 方格中摆若干炮(可以不摆)使其互不吃到的情况下方案数有几种。 棋 阅读全文
posted @ 2017-08-03 22:06 Penn000 阅读(344) 评论(0) 推荐(0) 编辑
摘要:Another OCD Patient Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1757 Accepted Submission(s) 阅读全文
posted @ 2017-08-03 21:51 Penn000 阅读(201) 评论(0) 推荐(0) 编辑
摘要:Mondriaan's Dream Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 17187 Accepted: 9911 Description Squares and rectangles fascinated the fa 阅读全文
posted @ 2017-08-03 08:53 Penn000 阅读(205) 评论(0) 推荐(0) 编辑
摘要:Pebbles Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1820 Accepted Submission(s): 1034 Problem 阅读全文
posted @ 2017-08-03 08:49 Penn000 阅读(208) 评论(0) 推荐(0) 编辑
摘要:I NEED A OFFER! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28178 Accepted Submission(s): 114 阅读全文
posted @ 2017-05-24 21:46 Penn000 阅读(193) 评论(0) 推荐(0) 编辑
摘要:饭卡 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28877 Accepted Submission(s): 9970 Problem Des 阅读全文
posted @ 2017-05-24 13:55 Penn000 阅读(231) 评论(0) 推荐(0) 编辑
摘要:You Are the One Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3915 Accepted Submission(s): 1809 阅读全文
posted @ 2017-05-23 22:17 Penn000 阅读(357) 评论(0) 推荐(1) 编辑
摘要:Multiplication Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10034 Accepted: 6200 Description The multiplication puzzle is played 阅读全文
posted @ 2017-05-23 14:29 Penn000 阅读(194) 评论(0) 推荐(0) 编辑
摘要:Brackets Time Limit: 1000MSMemory Limit: 65536K Total Submissions: 7823Accepted: 4151 Description We give the following inductive definition of a “reg 阅读全文
posted @ 2017-05-23 08:19 Penn000 阅读(293) 评论(0) 推荐(0) 编辑
摘要:Milking Time Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9459 Accepted: 3935 Description Bessie is such a hard-working cow. In fact, sh 阅读全文
posted @ 2017-05-16 21:40 Penn000 阅读(211) 评论(0) 推荐(0) 编辑
摘要:Problem A: Little Red Riding Hood Description Once upon a time, there was a little girl. Her name was Little Red Riding Hood. One day, her grandma was 阅读全文
posted @ 2017-04-24 12:16 Penn000 阅读(223) 评论(0) 推荐(0) 编辑

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