protagonist
上一页 1 2 3 4 5 6 7 8 ··· 23 下一页
摘要: Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10796 Accepted Submission(s): 3613 Pr 阅读全文
posted @ 2019-09-03 19:32 czy-power 阅读(348) 评论(0) 推荐(0) 编辑
摘要: Colorful Tree Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3373 Accepted Submission(s): 1461 阅读全文
posted @ 2019-09-03 10:49 czy-power 阅读(281) 评论(0) 推荐(0) 编辑
摘要: lines Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2432 Accepted Submission(s): 1032 Problem D 阅读全文
posted @ 2019-09-03 09:41 czy-power 阅读(266) 评论(0) 推荐(0) 编辑
摘要: 1031: [JSOI2007]字符加密Cipher Description 喜欢钻研问题的JS同学,最近又迷上了对加密方法的思考。一天,他突然想出了一种他认为是终极的加密办法 :把需要加密的信息排成一圈,显然,它们有很多种不同的读法。例如下图,可以读作: JSOI07 SOI07J OI07JS 阅读全文
posted @ 2019-09-03 09:19 czy-power 阅读(350) 评论(0) 推荐(0) 编辑
摘要: Just h-index Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 1778 Accepted Submission(s): 793 P 阅读全文
posted @ 2019-09-02 23:09 czy-power 阅读(276) 评论(0) 推荐(0) 编辑
摘要: K-short Problem Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 693 Accepted Submission(s): 217 P 阅读全文
posted @ 2019-09-02 21:50 czy-power 阅读(202) 评论(0) 推荐(0) 编辑
摘要: Problem E. Split The Tree Time Limit: 7000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 409 Accepted Submissi 阅读全文
posted @ 2019-08-30 10:16 czy-power 阅读(218) 评论(0) 推荐(0) 编辑
摘要: D-City Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 6079 Accepted Submission(s): 2112 Problem 阅读全文
posted @ 2019-08-30 08:59 czy-power 阅读(243) 评论(0) 推荐(0) 编辑
摘要: 问题 E: Eating Everything Efficiently 题目描述 Margriet A. is in pizza heaven! She has bought a one-day access pass to Pizza World. Pizza World is a food fe 阅读全文
posted @ 2019-08-27 20:17 czy-power 阅读(339) 评论(0) 推荐(0) 编辑
摘要: 题目背景 滚粗了的HansBug在收拾旧英语书,然而他发现了什么奇妙的东西。 滚粗了的HansBug在收拾旧英语书,然而他发现了什么奇妙的东西。 题目描述 #udp2.T3如果遇到相同的字符串,输出后面的 蒟蒻HansBug在一本英语书里面找到了一个单词表,包含N个单词(每个单词内包含大小写字母)。 阅读全文
posted @ 2019-08-27 09:14 czy-power 阅读(277) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 ··· 23 下一页