摘要: ## Matrix Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 34283 Accepted: 12403 Description Given an N*N matrix A, whose elements are eith 阅读全文
posted @ 2021-11-26 09:44 Un-Defined 阅读(26) 评论(0) 推荐(0) 编辑
摘要: ## D. Nested Segments time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given n segme 阅读全文
posted @ 2021-11-26 09:43 Un-Defined 阅读(40) 评论(0) 推荐(0) 编辑
摘要: ## I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 112144 Accepted Submission(s): 418 阅读全文
posted @ 2021-11-26 09:42 Un-Defined 阅读(19) 评论(0) 推荐(0) 编辑
摘要: A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 152104 Accepted: 47157 Case Time Limit: 2000MS Description 阅读全文
posted @ 2021-11-26 09:41 Un-Defined 阅读(27) 评论(0) 推荐(0) 编辑
摘要: ## POJ - 2481 Cows Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 23766 Accepted: 7987 Description Farmer John's cows have discovered tha 阅读全文
posted @ 2021-11-26 09:40 Un-Defined 阅读(28) 评论(0) 推荐(0) 编辑
摘要: # D. Count The Bits 数位DP 题意 给出 \(k\) 和 \(b\),计算 \([0, 2^b-1]\) 中所有 \(k\) 的倍数中有几个二进制 \(1\)。 题解 数位DP。 一个数加上 \(2^i-1\) 相当于在其二进制的第 \(i\) 位添上 \(1\)。 记录下$[ 阅读全文
posted @ 2021-11-26 09:38 Un-Defined 阅读(37) 评论(0) 推荐(0) 编辑
摘要: # Junk-Mail Filter Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12386 Accepted Submission(s 阅读全文
posted @ 2021-11-26 09:37 Un-Defined 阅读(29) 评论(0) 推荐(0) 编辑
摘要: # 种类并查集 POJ -2492 A Bug's Life Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 46754 Accepted: 15083 Description Background Professor Hop 阅读全文
posted @ 2021-11-26 09:34 Un-Defined 阅读(30) 评论(0) 推荐(0) 编辑
摘要: # Desert King Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 32228 Accepted: 8815 Description David the Great has just become the king o 阅读全文
posted @ 2021-11-26 09:33 Un-Defined 阅读(21) 评论(0) 推荐(0) 编辑