校际联合Contest

【校际联合Contest】的更多相关文章

每次开一个坑都像是重新被碾压的预感最近的新闻,以前很喜欢乔任梁的<复活>...然后他就死了...感觉我再多愁善感一点的话...就要悲伤逆流成河了吧... Contest 09/24(乐滋滋的场,良心场)100+100+0 T1:这题做得很羞愧...因为我根本证不出那个结论..猜的.. T2:这题做得很羞愧...因为听到了隔壁GG讲了伸头缩尾法... T3:因为少了一个半小时就没交.yy了一个跟正解差不多的想法...只是把枚举K去掉了,但是这样就MLE了...我口胡一下..不写了因为懒得评测.…

2015多校联合训练赛 hdu 5308 I Wanna Become A 24-Point Master 2015 Multi-University Training Contest 2 构造题

I Wanna Become A 24-Point Master Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 60 Accepted Submission(s): 16 Special Judge Problem Description Recently Rikka falls in love with an old but…

2015多校联合训练赛hdu 5301 Buildings 2015 Multi-University Training Contest 2 简单题

Buildings Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 185 Accepted Submission(s): 25 Problem Description Your current task is to make a ground plan for a residential building located i…

2015多校联合训练赛 Training Contest 4 1008

构造题: 比赛的时候只想到:前面一样的数,后面是类似1,2,3,4,5,6....t这既是:t+1,t+1...,1,2,3,...t t+1的数目可能很多, 题解时YY出一个N 然后对N 判断. seg{Li*(Li-1)} = n*n+n-2*k=d; 每次跑sqrt(n)找到最近的 d ,D_new=d-Li*(Li-1); 这样一定能解的:d 一定是偶数,Li*(Li-1)也一定是偶数,2*1=2; 还有seg(Li)=n; 当Li=1是 Li*Li-Li=0; 加入一些1就…

2016暑假多校联合---Rikka with Sequence (线段树)

2016暑假多校联合---Rikka with Sequence (线段树) Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them: Yuta has an array A with n numbers. Then he make…

2016暑假多校联合---Windows 10

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 the operating system of his computer was updating to windows 10 automatically and he even can't j…

2016暑假多校联合---Substring（后缀数组）

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 distinct substrings. But ?? thinks that is too easy, he wants to make this problem more interesti…