2016 年 10月随笔档案 - Beserious

Codeforces Beta Round #67 (Div. 2)C. Modified GCD

摘要：C. Modified GCD time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Well, here is another ma 阅读全文

posted @ 2016-10-30 10:29 Beserious 阅读(428) 评论(0) 推荐(0) 编辑

timus 1018. Binary Apple Tree

摘要：1018. Binary Apple Tree Time limit: 1.0 secondMemory limit: 64 MB Let's imagine how apple tree looks in binary computer world. You're right, it looks 阅读全文

posted @ 2016-10-15 20:30 Beserious 阅读(479) 评论(0) 推荐(0) 编辑

C - Gr-idian MST

摘要：Time limit : 2sec / Memory limit : 256MB Score : 500 points Problem Statement On an xy plane, in an area satisfying 0≤x≤W,0≤y≤H, there is one house at 阅读全文

posted @ 2016-10-14 15:24 Beserious 阅读(275) 评论(0) 推荐(0) 编辑

HDU 1299Diophantus of Alexandria

摘要：Diophantus of Alexandria Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3210 Accepted Submission 阅读全文

posted @ 2016-10-09 20:59 Beserious 阅读(208) 评论(0) 推荐(0) 编辑

等和的分隔子集

摘要：晓萌希望将1到N的连续整数组成的集合划分成两个子集合，且保证每个集合的数字和是相等。例如，对于N=3，对应的集合{1，2，3}能被划分成{3} 和 {1,2}两个子集合. 这两个子集合中元素分别的和是相等的。对于N=3，我们只有一种划分方法，而对于N=7时，我们将有4种划分的方案。输入包括一行，阅读全文

posted @ 2016-10-09 14:46 Beserious 阅读(602) 评论(0) 推荐(0) 编辑

Uva 11151 - Longest Palindrome

摘要：A palindrome is a string that reads the same from the left as it does from the right. For example, I, GAG and MADAM are palindromes, but ADAM is not. 阅读全文

posted @ 2016-10-07 19:32 Beserious 阅读(374) 评论(0) 推荐(0) 编辑

Codeforces Round #119 (Div. 2)A. Cut Ribbon

摘要：A. Cut Ribbon time limit per test 1 second time limit per test memory limit per test 256 megabytes memory limit per test input standard input input ou 阅读全文

posted @ 2016-10-07 19:07 Beserious 阅读(360) 评论(0) 推荐(0) 编辑

Codeforces Round #211 (Div. 2)B. Fence

摘要：B. Fence time limit per test 1 second time limit per test memory limit per test 256 megabytes memory limit per test input standard input input output 阅读全文

posted @ 2016-10-07 16:50 Beserious 阅读(254) 评论(0) 推荐(0) 编辑

UVALive 6661 - Equal Sum Sets

摘要：Let us consider sets of positive integers less than or equal to n. Note that all elements of a set are different. Also note that the order of elements 阅读全文

posted @ 2016-10-07 16:05 Beserious 阅读(445) 评论(0) 推荐(0) 编辑

Timus 1146. Maximum Sum

摘要：1146. Maximum Sum Time limit: 0.5 secondMemory limit: 64 MB Given a 2-dimensional array of positive and negative integers, find the sub-rectangle with 阅读全文

posted @ 2016-10-07 15:53 Beserious 阅读(267) 评论(0) 推荐(0) 编辑

UVALive 4212 - Candy

摘要：Little Charlie is a nice boy addicted to candies. He is even a subscriber to All Candies Magazine and was selected to participate in the International 阅读全文

posted @ 2016-10-07 13:37 Beserious 阅读(364) 评论(0) 推荐(0) 编辑

[1525] Cow Xor

摘要：问题描述农民约翰在喂奶牛的时候被另一个问题卡住了。他的所有N(1 <= N <= 100,000)个奶牛在他面前排成一行(按序号1..N的顺序)，按照它们的社会等级排序。奶牛#1有最高的社会等级，奶牛#N最低。每个奶牛同时被指定了一个不唯一的附加值，这个数在0..2^21 - 1的范围内。帮助农阅读全文

posted @ 2016-10-06 15:32 Beserious 阅读(260) 评论(0) 推荐(0) 编辑

MBEEWALK - Bee Walk

摘要：Input Output dp Input Output 阅读全文

posted @ 2016-10-05 15:13 Beserious 阅读(574) 评论(0) 推荐(0) 编辑