algzjh的博客

B. Karen and Coffeetime limit per test2.5 seconds memory limit per test512 megabytes inputstandard input outputstandard output To stay woke and attentive during classes, Karen needs some coffee!Kar

B. Arpa and a list of numberstime limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Arpa has found a list containing n numbers. He calls a list ba

E - ConvexScoreTime limit : 2sec / Memory limit : 256MBScore : 700 pointsProblem Statement You are given N points (xi,yi) located on a two-dimensional plane. Consider a subset S of the N points that f

1、划分数 有nn个无区别的物品，将它们划分成不超过mm组，求出划分方法数模MM的余数。 dp[i][j]dp[i][j]表示jj的ii划分的总数 考虑nn的mm划分ai(∑i=1mai=n)a_i(\sum\limits_{i=1}^{m}a_i=n)，如果对于每个ii都有ai>0a_i>0，那么ai−1{a_i-1}就对应了n−mn-m的mm划分。另外，如果存在ai=0a_i=0，那么这就

WandN wizards are attending a meeting. Everyone has his own magic wand. N magic wands was put in a line, numbered from 1 to n(Wand_i owned by wizard_i). After the meeting, n wizards will take a wand on

第一种方法：记忆化搜索特点：同样的工作只做一次，克服了递归的不足之处#include#includeusing namespace std;typedef long long LL;LL f[100];LL dp(int i){ if(f[i]!=-1) return f[i]; else return f[i]=dp(i-1)+dp(i-2);}in

D. BlocksTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld      Java class name: MainSubmit StatusFont Size: + -Pan

小小粉丝度度熊Accepts: 1075 Submissions: 5191 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description度度熊喜欢着喵哈哈村的大明星——星星小姐。为什么度度熊会喜欢星星小姐呢？首先星星小姐笑起来非常动人，其次星星小姐唱歌

Just do itTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1205 Accepted Submission(s): 704Problem Description There is a nonnegative inte

KirinrikiTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1204 Accepted Submission(s): 475Problem Description We define the distance of two

Jessica’s Reading ProblemTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 13113 Accepted: 4508 DescriptionJessica’s a very lovely girl wooed by lots of boys. Recently she has a

SubsequenceTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 15943 Accepted: 6750 DescriptionA sequence of N positive integers (10 < N < 100 000), each of them less than or equal

Killer NamesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 369 Accepted Submission(s): 191Problem Description Galen Marek, codenamed Star

Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others) Total Submission(s): 34150 Accepted Submission(s): 14867Problem Description “OK, you

C. Jury Markstime limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Polycarp watched TV-show where k jury members one by one rated a participant b

1、取出nnn在二进制表示下的第kkk位(n&gt;&gt;k)&amp;1 2、取出nnn在二进制表示下的第0∼k−10∼k−10\sim k-1位（后kkk位）n&amp;((1&lt;&lt;k)-1) 3、第kkk位取反n^(1&lt;&lt;k) 4、第kkk位赋一n|(1&lt;&lt;k) 5、第kkk位赋零n&amp;(~(1&lt;&lt;k))数学技巧∀k∈[0,3...