Mr_Treeeee的博客

RPG的错排Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13530    Accepted Submission(s): 5536Problem Description今年暑假杭电ACM集训队第一次组成女

时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 262144K，其他语言524288K64bit IO Format: %lld题目描述 Yuanyuan Long is a dragon like this picture?                                   I don’t know, maybe

Problem 2238 Daxia & Wzc's problem Accept: 42    Submit: 166Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem DescriptionDaxia在2016年5月期间去瑞士度蜜月,顺便拜访了Wzc,Wzc给他出了一个问题：Wzc给Daxia

C. The Intriguing Obsessiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output— This is not playing but duty a

Bob has a not even coin, every time he tosses the coin, the probability that the coin's front face up is qp(qp≤12)​p​​q​​(​p​​q​​≤​2​​1​​).The question is, when Bob tosses the coin kk times, what'

D. Winter is heretime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWinter is here at the North and the White

The BalanceTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8192    Accepted Submission(s): 3430Problem DescriptionNow you are as

简单的四道母函数题。都做了2遍，一次母函数，一次计数DP（或叫背包）。但是这几题背包的效率比母函数高，而且代码也短多了。。。HDU 1028 Ignatius and the Princess III代码：#include #include #include #include #include #include using namespace std;#d

A Simple ChessTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2672    Accepted Submission(s): 713Problem DescriptionThere is a n

Co-primeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5239    Accepted Submission(s): 2093Problem DescriptionGiven a number N,

1563: LexicographySubmit Page    Summary    Time Limit:1 Sec     Memory Limit: 128 Mb     Submitted:469     Solved:150    DescriptionAn anagram of a string is any str

using namespace std; const int MAXN = 200005; bool ispri[MAXN];int prime[MAXN];int priCnt; void CalPrime(){ priCnt = 0; memset(ispri,false,sizeof(ispri)); for(int i = 2;i < ...