Fellow me on GitHub

随笔分类 -  搜索

摘要:E. XOR and Favorite Number time limit per test: 4 seconds memory limit per test: 256 megabytes input: standard input output: standard output time limi 阅读全文
posted @ 2017-11-14 21:23 Penn000 阅读(457) 评论(0) 推荐(0) 编辑
摘要:Herbs Gathering Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1470 Accepted Submission(s): 366 阅读全文
posted @ 2017-10-08 15:26 Penn000 阅读(229) 评论(0) 推荐(0) 编辑
摘要:Eight II Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 130000/65536 K (Java/Others)Total Submission(s): 3449 Accepted Submission(s): 753 Proble 阅读全文
posted @ 2017-09-23 11:03 Penn000 阅读(446) 评论(0) 推荐(0) 编辑
摘要:Friend-Graph Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 28 Accepted Submission(s): 15 Probl 阅读全文
posted @ 2017-08-19 17:27 Penn000 阅读(221) 评论(0) 推荐(0) 编辑
摘要:拯救大兵瑞恩 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 511 Accepted Submission(s): 184 Problem De 阅读全文
posted @ 2017-08-18 11:38 Penn000 阅读(208) 评论(0) 推荐(0) 编辑
摘要:度度熊的01世界 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 874 Accepted Submission(s): 299 Problem 阅读全文
posted @ 2017-08-12 21:56 Penn000 阅读(220) 评论(0) 推荐(0) 编辑
摘要:EXTENDED LIGHTS OUT Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11078 Accepted: 7074 Description In an extended version of the game Lig 阅读全文
posted @ 2017-08-02 08:36 Penn000 阅读(152) 评论(0) 推荐(0) 编辑
摘要:G. Sequence Number In Linear algebra, we have learned the definition of inversion number: Assuming A is a ordered set with n numbers ( n > 1 ) which a 阅读全文
posted @ 2017-04-24 12:23 Penn000 阅读(211) 评论(0) 推荐(0) 编辑
摘要:Escape Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1407 Accepted Submission(s): 392 Problem 阅读全文
posted @ 2017-03-09 21:02 Penn000 阅读(202) 评论(0) 推荐(0) 编辑
摘要:Nightmare Ⅱ Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2196 Accepted Submission(s): 572 Prob 阅读全文
posted @ 2017-03-08 08:49 Penn000 阅读(305) 评论(0) 推荐(0) 编辑
摘要:DNA sequence Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2427 Accepted Submission(s): 1198 P 阅读全文
posted @ 2017-03-06 13:18 Penn000 阅读(229) 评论(0) 推荐(0) 编辑
摘要:A计划 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20023 Accepted Submission(s): 5077 Problem De 阅读全文
posted @ 2017-03-02 18:15 Penn000 阅读(177) 评论(0) 推荐(0) 编辑
摘要:哈密顿绕行世界问题 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3890 Accepted Submission(s): 2358 Probl 阅读全文
posted @ 2017-03-01 16:35 Penn000 阅读(162) 评论(0) 推荐(0) 编辑
摘要:Fire! Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. 阅读全文
posted @ 2017-03-01 13:23 Penn000 阅读(242) 评论(0) 推荐(0) 编辑
摘要:Find a way Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12795 Accepted Submission(s): 4105 Pro 阅读全文
posted @ 2017-02-28 23:01 Penn000 阅读(291) 评论(0) 推荐(0) 编辑
摘要:Fire Game Accept: 1955 Submit: 6880Time Limit: 1000 mSec Memory Limit : 32768 KB Accept: 1955 Submit: 6880Time Limit: 1000 mSec Memory Limit : 32768 K 阅读全文
posted @ 2017-02-28 16:26 Penn000 阅读(285) 评论(0) 推荐(0) 编辑
摘要:Shuffle'm Up Shuffle'm Up Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10366 Accepted: 4800 Description A common pastime for poker playe 阅读全文
posted @ 2017-02-27 15:42 Penn000 阅读(247) 评论(0) 推荐(0) 编辑
摘要:Pots Description You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i) fill the 阅读全文
posted @ 2017-02-24 23:10 Penn000 阅读(187) 评论(0) 推荐(0) 编辑
摘要:Prime Path Description The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to cha 阅读全文
posted @ 2017-02-23 20:55 Penn000 阅读(158) 评论(0) 推荐(0) 编辑
摘要:Find The Multiple Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains 阅读全文
posted @ 2017-02-23 16:49 Penn000 阅读(212) 评论(0) 推荐(0) 编辑

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