上一页 1 ··· 14 15 16 17 18 19 20 21 22 ··· 57 下一页
摘要: Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 53312 Accepted: 16050 Description Chosen Problem Solving and Program design as 阅读全文
posted @ 2019-02-25 16:59 ZERO- 阅读(381) 评论(0) 推荐(0)
摘要: F. Asya And Kittens time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output F. Asya And Kittens 阅读全文
posted @ 2019-02-24 15:50 ZERO- 阅读(592) 评论(0) 推荐(2)
摘要: C. Birthday time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. Birthday time limit per te 阅读全文
posted @ 2019-02-24 15:42 ZERO- 阅读(610) 评论(0) 推荐(1)
摘要: B. Draw! time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output B. Draw! time limit per test 2 阅读全文
posted @ 2019-02-24 15:40 ZERO- 阅读(554) 评论(0) 推荐(1)
摘要: A. Sea Battle time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Sea Battle time limit pe 阅读全文
posted @ 2019-02-24 15:38 ZERO- 阅读(355) 评论(0) 推荐(1)
摘要: 爬爬爬山 已经提交 已经通过 9.83% Total Submission:417 Total Accepted:41 爬爬爬山 已经提交 已经通过 爬爬爬山 已经提交 已经通过 9.83% Total Submission:417 Total Accepted:41 Total Submissio 阅读全文
posted @ 2019-02-11 18:26 ZERO- 阅读(531) 评论(0) 推荐(0)
摘要: D. Game with modulo time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output This is an interactiv 阅读全文
posted @ 2019-01-24 14:28 ZERO- 阅读(528) 评论(0) 推荐(0)
摘要: Balancing Act Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17497 Accepted: 7398 Description Consider a tree T with N (1 <= N <= 20,000) 阅读全文
posted @ 2019-01-22 19:20 ZERO- 阅读(463) 评论(0) 推荐(0)
摘要: J. Rising Sun time limit per test 1.0 s memory limit per test 1024 MB input standard input output standard output Joon has a midterm exam tomorrow, bu 阅读全文
posted @ 2019-01-20 12:58 ZERO- 阅读(706) 评论(2) 推荐(0)
摘要: 3261: 最大异或和 Description 给定一个非负整数序列{a},初始长度为N。 有M个操作,有以下两种操作类型: 1、Ax:添加操作,表示在序列末尾添加一个数x,序列的长度N+1。 2、Qlrx:询问操作,你需要找到一个位置p,满足l<=p<=r,使得: a[p] xor a[p+1] 阅读全文
posted @ 2019-01-18 14:57 ZERO- 阅读(502) 评论(0) 推荐(0)
上一页 1 ··· 14 15 16 17 18 19 20 21 22 ··· 57 下一页