2015暑期集训
Han_Kin
嘻嘻哈哈每一天,2016,加油!
展开
-
A - Accurately Say "CocaCola"! --- (first qualifying)
A - Accurately Say "CocaCola"!时限:2000MS 内存:65536KB 64位IO格式:%lld & %llu提交 状态 练习 ZOJ 2965问题描述In a party held by CocaCola company, several students stand in a circle and play原创 2015-07-27 16:15:21 · 595 阅读 · 0 评论 -
D - A very hard Aoshu problem----(2015 summer training #12(Team_Qualifying))
D - A very hard Aoshu problem时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述Aoshu is very popular among primary school students. It is mathematics, but much harder than ordinary m原创 2015-08-14 15:43:52 · 429 阅读 · 0 评论 -
J - A Bit Fun-----(2015 summer training #9)
J - A Bit Fun时限:2500MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述There are n numbers in a array, as a 0, a 1 ... , a n-1, and another number m. We define a function f(i, j) = a i|a i原创 2015-08-14 13:21:46 · 876 阅读 · 0 评论 -
C - We Love MOE Girls-----(2015 summer training #9)
C - We Love MOE Girls时限:500MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述Chikami Nanako is a girl living in many different parallel worlds. In this problem we talk about one of them.原创 2015-08-14 13:15:31 · 635 阅读 · 0 评论 -
矩阵树定理
摘要 在信息学竞赛中,有关生成树的最优化问题如最小生成树等是我们经常遇到的,而对生成树的计数及其相关问题则少有涉及。事实上,生成树的计数是十分有意义的,在许多方面都有着广泛的应用。本文从一道信息学竞赛中出现的例题谈起,首先介绍了一种指数级的动态规划算法,然后介绍了行列式的基本概念、性质,并在此基础上引入Matrix-Tree定理,同时通过与一道数学问题的对比,揭示了该转载 2015-08-14 15:51:03 · 4107 阅读 · 0 评论 -
C - We Love MOE Girls---(2015 summer training #9)
C - We Love MOE Girls时限:500MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述Chikami Nanako is a girl living in many different parallel worlds. In this problem we talk about one of them.原创 2015-08-05 14:35:13 · 749 阅读 · 0 评论 -
A - Decoding Baby Boos---(2015 NEUQ_ACM summer training #1)
题目链接:http://7xjob4.com1.z0.glb.clouddn.com/bf4e186f3e033bf65549cd29766985f6分析:题意是给一个字符串,然后给出一些修改操作,每次有两个字符A和B,意思用A代替B,以此来更新字符串。如果每一次根据操作更新,绝对超时。我们可以先用26个字母来用操作进行更新,得到每个字母在所有操作完成后,最终得到的字符是什么,最后一次性遍历字原创 2015-08-05 14:49:17 · 553 阅读 · 0 评论 -
B - And Or---(2015 NEUQ_ACM summer training #1)
题目链接:http://7xjob4.com1.z0.glb.clouddn.com/f595a508afa947b5f898ccbdb1e10002在雨神兼男神的指导下AC了。题目大意:输入两个数,然后计算中间所有数进行与运算和或运算的到的结果分别是多少?思路:直接暴力计算肯定会超时. 把a b转换为二进制数,如果是不同位数的因为进位所以会导致&的结果为0,|的结果为2^k-原创 2015-08-05 15:00:04 · 509 阅读 · 0 评论 -
A - Faulty Odometer---(2015 summer training #3)
A - Faulty Odometer时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述 You are given a car odometer which displays the miles traveled as an integer. The odometer has a defect, howeve原创 2015-08-05 17:14:03 · 367 阅读 · 0 评论 -
E- Refraction----(2015 NEUQ_ACM summer training #1)
题目链接:http://7xjob4.com1.z0.glb.clouddn.com/b4d60dcf5f1da9372280ae83202180b7分析:数学计算题,考查了物理上的折射问题。题意:右上角有一双眼睛,缸里有一个东西,问能看见这个东西时,缸里的水的高度最小是多少? 水的高度越高,看的范围越广。视线肯定从右上角的缸的边缘下来。(推导细节过程忘记了)CO原创 2015-08-05 16:52:40 · 506 阅读 · 0 评论 -
J - Intelligent IME---(2015 summer training #3)
J - Intelligent IME时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述 We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phon原创 2015-08-05 18:15:58 · 558 阅读 · 0 评论 -
H - Load Balancing---(2015 NEUQ_ACM summer training #1)
题目链接:http://7xjob4.com1.z0.glb.clouddn.com/853ec5b32d48782501bfcf3dd089c8ce分析:对一个数组,把它分成四等份,使得每份之间的个数相差最小(即均等分配),暴力解决:枚举各个断点。我wa了11次,主要怪在自己没看清题目,数组是无序的。#include #include #include #inclu原创 2015-08-05 17:07:35 · 467 阅读 · 0 评论 -
E - A very hard mathematic problem----(2015 summer training #3)
E - A very hard mathematic problem时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述 Haoren is very good at solving mathematic problems. Today he is working a problem like this:原创 2015-08-05 18:41:05 · 880 阅读 · 0 评论 -
C - Colorful Rainbows----(2015 summer training #4 (Qualifying))
C - Colorful Rainbows时限:2000MS 内存:65536KB 64位IO格式:%lld & %llu问题描述Evelyn likes drawing very much. Today, she draws lots of rainbows on white paper of infinite size, each using a d原创 2015-08-07 08:46:15 · 479 阅读 · 0 评论 -
K - Kinds of Fuwas----(2015 summer training #4 (Qualifying))
K - Kinds of Fuwas时限:2000MS 内存:65536KB 64位IO格式:%lld & %llu问题描述In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China as well原创 2015-08-07 08:58:14 · 641 阅读 · 0 评论 -
E - Theme Section-----(2015 summer training #11)
E - Theme Section时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述It's time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will pla原创 2015-08-14 13:34:17 · 407 阅读 · 0 评论 -
B - Median-----(2015 summer training #8(Qualifying))
B - Median时限:5000MS 内存:65536KB 64位IO格式:%lld & %llu问题描述The median of m numbers is after sorting them in order, the middle one number of them if m is even or the average number of原创 2015-08-14 13:03:21 · 416 阅读 · 0 评论 -
B - Build The Electric System --- (fisrt qualifying)
B - Build The Electric System时限:2000MS 内存:65536KB 64位IO格式:%lld & %llu问题描述In last winter, there was a big snow storm in South China. The electric system was damaged seriously. Lot原创 2015-07-27 17:37:53 · 1167 阅读 · 0 评论 -
F - Faster, Higher, Stronger --- (first qualifying)
F - Faster, Higher, Stronger时限:2000MS 内存:65536KB 64位IO格式:%lld & %llu问题描述In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of Chin原创 2015-07-27 17:49:23 · 447 阅读 · 0 评论 -
G - Give Me the Number --- (first qualifying)
G - Give Me the Number时限:2000MS 内存:65536KB 64位IO格式:%lld & %llu问题描述Numbers in English are written down in the following way (only numbers less than 109 are considered). Number a原创 2015-07-27 18:02:07 · 629 阅读 · 0 评论 -
E - Easy Task --- (fisrt qualifying)
E - Easy Task时限:2000MS 内存:65536KB 64位IO格式:%lld & %llu问题描述Calculating the derivation of a polynomial is an easy task. Given a function f(x) , we use (f(x))' to denote its derivati原创 2015-07-27 17:46:17 · 496 阅读 · 0 评论 -
Problem A. Automated Telephone Exchange----(2015 summer training #5)
题目链接:http://poj.org/images/20111210problems.pdf题意:输入一个数,它减去两个100以内的数等于0时的情况数。CODE:#include using namespace std;int main(){ int ATE; while(cin>>ATE){ int ans=0;原创 2015-08-08 17:50:42 · 398 阅读 · 0 评论 -
Problem F. Flat----(2015 summer training #5)
题目链接:http://poj.org/images/20111210problems.pdf题意:水题。CODE:#include #include #include #include using namespace std;int main(){ int n,c; while(cin>>n>>c){// string s原创 2015-08-08 17:55:32 · 547 阅读 · 0 评论 -
NEUQ 1229: 密码截获
1229: 密码截获时间限制: 1 Sec 内存限制: 128 MB题目描述Catcher是MCA国的情报员,他工作时发现敌国会用一些对称的密码 进行通信,比如像这些ABBA,ABA,A,123321,但是他们有时会在开始或结束时加入一些无关的字符以防止别国破解。比如进行下列变化 ABBA->12ABBA,ABA->ABAKK,123321->51233214 。原创 2015-08-08 13:45:17 · 985 阅读 · 0 评论 -
2015西电暑期集训第一场(锘爷系列)
1079: 锘爷与数列时间限制: 1 Sec 内存限制: 128 MB题目描述锘爷拿到了一个长度为n的数列,数列中每个数ai都满足122输入多组数据,第一行为数据组数T(1输出输出格式 每组数据输出一个数,即最大的差值。样例输入210 21 1 2 2 1 2 1 1 1 110 32原创 2015-08-13 18:20:18 · 1083 阅读 · 0 评论 -
B Black Square----(2015 summer training #5)
题目链接:http://poj.org/images/20111210problems.pdf哎,WA了十几次,始终未AC,放弃了。实在看不出BUG在哪里。写个bog纪念一下。。。。。。CODE:#include #include using namespace std;int m,n,s,k;string str;int cnt;bool judge(原创 2015-08-12 22:15:40 · 516 阅读 · 0 评论 -
D - Cut the Cake----(2015 summer training #11)
D - Cut the Cake时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述MMM got a big big big cake, and invited all her M friends to eat the cake together. Surprisingly one of her friends原创 2015-08-14 13:31:04 · 427 阅读 · 0 评论 -
D - Minimum palindrome----(2015 summer training #9)
D - Minimum palindrome时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述Setting password is very important, especially when you have so many "interesting" things in "F:\TDDOWNLOAD".原创 2015-08-14 13:17:39 · 401 阅读 · 0 评论 -
F - Stone-----(2015 summer training #11)
F - Stone时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述Tang and Jiang are good friends. To decide whose treat it is for dinner, they are playing a game. Specifically, Tang and Ji原创 2015-08-14 13:42:58 · 392 阅读 · 0 评论 -
J - Flyer------(2015 summer training #11)
J - Flyer时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述The new semester begins! Different kinds of student societies are all trying to advertise themselves, by giving flyers to t原创 2015-08-14 13:46:05 · 543 阅读 · 0 评论 -
H - Sum---(2015 summer training #12(Team_Qualifying))
H - Sum时限:1000MS 内存:32768KB 64位IO格式:%I64d & %I64u问题描述XXX is puzzled with the question below: 1, 2, 3, ..., n (1Operation 1: among the x-th number to the y-th number (incl原创 2015-08-14 15:46:40 · 518 阅读 · 0 评论 -
H - Hurdles of 110m----(2015 summer training #4 (Qualifying))
H - Hurdles of 110m时限:2000MS 内存:65536KB 64位IO格式:%lld & %llu问题描述In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China and Bei原创 2015-08-07 08:53:02 · 792 阅读 · 0 评论