摘要：
51Node 1483 化学变换 有n种不同的化学试剂。第i种有ai升。每次实验都要把所有的化学试剂混在一起，但是这些试剂的量一定要相等。所以现在的首要任务是把这些化学试剂的量弄成相等。 有两种操作： · 把第i种的量翻倍，即第i种的量变成2ai。 · 把第i种的量减半，除的时候向下取整，即把第i种 阅读全文
摘要：
2016暑假多校联合 Rikka with Sequence (线段树) Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka s 阅读全文
摘要：
HDU 5818 Problem Description A stack is a data structure in which all insertions and deletions of entries are made at one end, called the "top" of the 阅读全文
摘要：
2016暑假多校联合 Windows 10（HDU：5802） Problem Description Long long ago, there was an old monk living on the top of a mountain. Recently, our old monk found 阅读全文
摘要：
2016暑假多校联合 Substring Problem Description ?? is practicing his program skill, and now he is given a string, he has to calculate the total number of its 阅读全文
摘要：
2016暑假多校联合 To My Girlfriend Problem Description Dear GuoI never forget the moment I met with you.You carefully asked me: "I have a very difficult prob 阅读全文
摘要：
2016暑假多校联合 A Simple Chess Problem Description There is a n×m board, a chess want to go to the position (n,m) from the position (1,1).The chess is able 阅读全文
摘要：
int wa[maxn],wb[maxn],wv[maxn],ws[maxn]; int cmp(int *r,int a,int b,int l) {return r[a]==r[b]&&r[a+l]==r[b+l];} //就像论文所说，由于末尾填了0，所以如果r[a]==r[b]（实际是y[a]==y[b]），说明待合并的两个长为j的字符串，前面那个一定不包含末尾0，因而后面这个的起始位... 阅读全文
摘要：
2016暑假多校联合 World is Exploding Problem Description Given a sequence A with length n,count how many quadruple (a,b,c,d) satisfies: a≠b≠c≠d,1≤a<b≤n,1≤c<d 阅读全文
摘要：
2016暑假多校联合 Another Meaning Problem Description As is known to all, in many cases, a word has two meanings. Such as “hehe”, which not only means “hehe” 阅读全文