- 博客(24)
- 资源 (1)
- 收藏
- 关注
原创 ZOJ Problem Set - 3964(nim游戏变形)
Yet Another Game of StonesTime Limit: 1 Second Memory Limit: 65536 KBAlice and Bob are playing yet another game of stones. The rules of this game are as follow:The game starts with n piles of sto...
2018-05-12 11:50:33
295
原创 ZOJ Problem Set - 3962
Seven Segment DisplayTime Limit: 2 Seconds Memory Limit: 65536 KBA seven segment display, or seven segment indicator, is a form of electronic display device for displaying decimal numerals that i...
2018-05-12 11:28:10
288
原创 ZOJ3960 What Kind of Friends Are You? 题解
What Kind of Friends Are You?Time Limit: 1 Second Memory Limit: 65536 KBJapari Park is a large zoo home to extant species, endangered species, extinct species, cryptids and some legendary creatur...
2018-05-12 09:26:13
464
原创 ZOJ3959 Problem Preparation 题解
Problem PreparationTime Limit: 1 Second Memory Limit: 65536 KBIt's time to prepare the problems for the 14th Zhejiang Provincial Collegiate Programming Contest! Almost all members of Zhejiang Uni...
2018-05-12 09:00:50
365
原创 ZOJ3958 Cooking Competition 题解
Cooking CompetitionTime Limit: 1 Second Memory Limit: 65536 KB"Miss Kobayashi's Dragon Maid" is a Japanese manga series written and illustrated by Coolkyoushinja. An anime television series produ...
2018-05-12 08:52:07
427
原创 Palindrome Function(回文数)
Palindrome FunctionTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 1141 Accepted Submission(s): 390Problem DescriptionAs we
2017-08-21 13:09:39
391
原创 hdu6092 Rikka with Subset(母函数+思维)
Rikka with SubsetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1445 Accepted Submission(s): 726Problem DescriptionAs
2017-08-10 11:17:40
348
原创 hdu6090 Rikka with Graph
Rikka with GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 704 Accepted Submission(s): 411Problem DescriptionAs we k
2017-08-10 10:46:56
403
原创 hdu6047 Maximum Sequence(贪心)
Maximum SequenceProblem DescriptionSteph is extremely obsessed with “sequence problems” that are usually seen on magazines: Given the sequence 11, 23, 30, 35, what is the next number? Steph always finds them too easy for such a genius like himself until
2017-08-01 09:14:04
383
原创 hdu 6055 Regular polygon
Regular polygonTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2184 Accepted Submission(s): 859Problem DescriptionOn a tw
2017-07-31 09:22:26
384
原创 hdu6045 Is Derek lying?
Is Derek lying?Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1162 Accepted Submission(s): 629Problem DescriptionDerek a
2017-07-31 09:07:05
486
原创 2017 Multi-University Training Contest - Team 1(hdu 6038 Function)
FunctionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1557 Accepted Submission(s): 738Problem DescriptionYou are given a
2017-07-30 16:05:21
299
原创 hdu6034(Balala Power!)
Balala Power!Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4247 Accepted Submission(s): 1055Problem DescriptionTa
2017-07-27 07:21:07
449
原创 2017 Multi-University Training Contest - Team 1(hdu 6043 KazaQ's Socks)
KazaQ's SocksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 642 Accepted Submission(s): 401Problem DescriptionKazaQ we
2017-07-26 17:47:18
476
原创 2017 Multi-University Training Contest - Team 1(hdu 6033 Add More Zero)
Add More ZeroTime Limit: 2000/1000 MS(Java/Others) Memory Limit: 131072/131072 K(Java/Others)Total Submission(s): 733 Accepted Submission(s): 508Problem DescriptionThere is ayo
2017-07-26 17:31:06
369
原创 UVALive 6456 Zhuge Liang's Password (water~~)
输入两个N*N的矩阵a,b,将b 分别旋转0,90, 180, 270度得到4个矩阵b‘ 求a 与 b‘ 的总重合元素个数 暴力直接搞, 唯一的难点, 恐怕就是读题了。。。#includeusing namespace std;typedef long long ll;const double inf = 1e9;const double eps = 1e-7;con
2017-06-27 14:40:04
483
原创 UVALive 6455 Stealing Harry Potter's Precious(广搜)
题意:从地图上一个点出发, 要求总共到达四个点, 求最短行驶距离。很明显是一道广搜题, 要求经过4个点, 考虑到点数不多, 可枚举所有的经过顺序 (4! = 24), 接下来便是简单广搜了。Tips: 枚举所有情况 可以用 next_permutation 函数, 用法见代码#includeusing namespace std;typedef long long ll;
2017-06-27 14:20:37
374
原创 UVA 11404 - Palindromic Subsequence(LCS和DP两种做法)
ASubsequence is a sequence obtained by deleting zero or more characters in astring. A Palindrome is a string which when read from left to right, reads sameas when read from right to left. Given a stri
2017-06-24 17:40:18
446
原创 UVALive 3506 4 Values whose Sum is 0 (二分查找)
The SUMproblem can be formulated as follows: given four lists A;B;C;D of integer values, computehow manyquadruplet (a; b; c; d) 2 A_B _C _D are such thata+b+c+d = 0. In thefollowing, weassume
2017-06-23 23:29:46
364
原创 ZOJ-2132-The MostFrequent Number题解
ZOJ-2132-The MostFrequent NumberTime Limit: 5 Seconds Memory Limit: 1024 KBSeven (actuallysix) problems may be somewhat few for a contest. But I am really unable todevise another
2017-06-23 20:54:05
573
原创 UVALive - 4378 Hell on the Markets
Most financial institutions had becomeinsolvent during financial crisis and went bankrupt or werebought by larger institutions, usually bybanks. By the end of financial crisis of all the financial
2017-06-20 15:42:27
620
原创 Problem H Pyro Tubes
本题题目意思是说,有18个灯,亮度分别1,2,4,8,……2^18,总量度为每个灯的亮度和,然后给出一系列总亮度,问每种亮度有几种方法可以在只改变两个灯的明暗状态的前提下转化为所给出的其他比自身亮度大的亮度。听着比较绕,其实就是将一个数的2进制数只改变其中的两个0或1,使其比原数大,然后找出序列中每个数能转化成序列中其他数的个数。我们的刚开始思路是判断序列中每个数是否为能由第i个数
2017-06-15 19:40:49
380
原创 ACM Word Clouds Revisited 题解
DP题,先打一个从i 到 j 的maxh 的表book【i】【j】, 再用一维DP。 注意 5000*5000的数组开不下, 但可以开一半(i好吧,其实没必要这么复杂。。。。一位大佬:直接DP就可以了我: 好像是这样。。。对, 开出来的book【i】【j】中的值都只用了一遍, 就没有打表的意义了, 直接在DP中求, 还可以简化。#includeusing namesp
2017-06-15 08:55:23
349
原创 ACM Dance Recital 题解
题要求在所有表演的排列情况中, 找出换装次数最小的一种。 考虑到题目数据规模比较小(n先将每两场表演所需换装的次数用二维数组记录下来, 否则可能会超时!#includeusing namespace std;int book[11][11];int book2[11];int book3[11];int minn;void dfs(int t, int n){ if
2017-06-15 07:42:54
426
Cisco Packet Tracer6.0.part1.rar
2017-06-17
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人