- 博客(30)
- 资源 (20)
- 收藏
- 关注
原创 2015关于第十一届"蓝狐网络杯"湖南省大学生计算机程序设计竞赛的总结
------------------------------------------------------------------------人生总是需要我们不断受挫,不断总结。然后继续前行! 回顾我的大学,我没有一般同学那么“幸运”,有长长的假期,可以去做自己想做的事。我选择是另一条路,一条我当初自己也望不到的未来方向的路,但我是一个不服输的人,我不想,自己决定的事,因为
2015-08-31 12:09:23 2374 6
原创 Kick the ball!(dfs)湖南省赛第十届
Problem K: Kick the ball!Time Limit: 1 Sec Memory Limit: 128 MB Special JudgeSubmit: 109 Solved: 82[Submit][Status][Web Board]Description"A penalty shoot-out (officially kicks fro
2015-08-24 13:55:30 1243
原创 Manaher算法总结
对于Manacher算法,主要的作用是用来求一个字符串的最长回文子串。这个算法的时间复杂度书线性的,即O(n)下面我分两个部分来讲1)预处理这个算法的精妙之处在于巧妙地避免了考虑回文子串的长度是奇数还是偶数(如果你还不知道什么是回文数,回文串,请自行baidu)在Manacher算法中,需要提前预处理我们原本的字符串,这里把原串叫做s1, 把预处理之后的字符串叫做s2.那么,对于s1 = "aba
2015-08-23 16:49:01 1831
原创 Hotaru's problem(hdu5371+Manacher)多校7
Hotaru's problemProblem DescriptionHotaru Ichijou recently is addicated to math problems. Now she is playing with N-sequence.Let's define N-sequence, which is composed with three parts and satisfied with the following condition:1. the first part is the
2015-08-23 16:28:15 1057
原创 吉哥系列故事——完美队形II(hdu4513+Manacher)
吉哥系列故事——完美队形IIProblem Description 吉哥又想出了一个新的完美队形游戏! 假设有n个人按顺序站在他的面前,他们的身高分别是h[1], h[2] ... h[n],吉哥希望从中挑出一些人,让这些人形成一个新的队形,新的队形若满足以下三点要求,则就是新的完美队形:
2015-08-23 16:17:19 1402
原创 Girls' research(hdu3294+Manacher算法)
Girls' researchTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1027 Accepted Submission(s): 389Problem Description One day, s
2015-08-23 16:09:33 1823
原创 最长回文 (hdu3068 && poj3974)Palindrome
最长回文Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11771 Accepted Submission(s): 4315Problem Description 给出一个只由小写英文字符a,b,c..
2015-08-23 16:02:32 1193
原创 SPOJ4491. Primes in GCD Table(gcd(a,b)=d素数,(1<=a<=n,1<=b<=m))加强版
SPOJ4491. Primes in GCD Table Problem code: PGCD Johnny has created a table which encodes the results of some operation -- a function of two arguments. But instead of a boring mu
2015-08-22 12:52:50 1694
原创 CRB and Candies(lcm(C(n,0)..C(n,n)=lcm(1,2,,,n+1)/(n+1)))hdu5407
CRB and CandiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 358 Accepted Submission(s): 160Problem Description CRB has N d
2015-08-21 14:07:15 1652
原创 bzoj 2818 Gcd(莫比乌斯+gcd(a,b)=d) 经典
2818: GcdDescription给定整数N,求1<=x,y<=N且Gcd(x,y)为素数的数对(x,y)有多少对.
2015-08-19 20:28:44 2944
原创 Visible Lattice Points(spoj7001+初探莫比乌斯)gcd(a,b,c)=1 经典
VLATTICE - Visible Lattice Pointsno tags Consider a N*N*N lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0
2015-08-17 22:00:16 1175
原创 CO-PRIME(初探 莫比乌斯)NYOJ1066(经典)gcd(a,b)=1
CO-PRIME时间限制:1000 ms | 内存限制:65535 KB难度:3描述This problem is so easy! Can you solve it?You are given a sequence which contains n integers a1,a2……an, your task is to find how many pa
2015-08-17 16:11:43 1559
原创 UVA12493 - Stars(求1-N与N互质的个数)欧拉函数
UVA12493 - Stars(求1-N与N互质的个数)欧拉函数 bnuoj26358
2015-08-17 12:55:16 2417
原创 Interesting Integers(CF---BAPC 14 + hnoj11589)扩展欧几里得
I Interesting Integerssource: xkcd.com/587Undoubtedly you know of the Fibonacci numbers. Starting withF1 = 1 and F2 = 1, every next number is the sum of the twoprevious ones. This results in the sequence 1, 1, 2, 3, 5, 8, 13, . . ..Now let us consider
2015-08-12 22:16:34 1463
原创 Root(hdu5777+扩展欧几里得+原根)
Root-------------------2015 Multi-University Training Contest 7Problem DescriptionGiven a number sum(1≤sum≤100000000),we have m queries which contains a pair (xi,yi) and would like to know the smallest nonnegative integer ki satisfying xkii=yi mod p whe
2015-08-12 00:20:17 1588
原创 Gray code(hdu5375+异或二进制的规律)
Gray code2015 Multi-University Training Contest 7Problem DescriptionThe reflected binary code, also known as Gray code after Frank Gray, is a binary numeral system where two successive values differ in only onebit (binary digit). The reflected binary co
2015-08-11 23:44:36 1202
原创 The shortest problem(hdu5373+11的倍数)
The shortest problemProblem DescriptionIn this problem, we should solve an interesting game. At first, we have an integer n, then we begin to make some funny change. We sum up every digit of the n, then insert it to the tail of the number n, then let the
2015-08-11 23:12:42 1002
原创 win10囧冏记
终于要忍不住升级win10了,不知道我的笔记本能不能坚挺到最后,不过我会一直陪他的,哈哈,现在他正在空调下纳凉呢。(〒_〒没办法,谁让他散热不行!)还有好久才能装完。嗯,第一次用OneNote记录下我的小心情。 这本来是昨晚写的,可是昨晚电脑更新,好卡。。。Win10终于装好了,还是好激动的,不知是不是运气好,差点就要回滚了的说,装了一天的win10,结果下
2015-08-10 00:48:03 1513 2
原创 Nim or not Nim?(hdu3032+SG函数)取走-分割游戏,经典
Nim or not Nim?DescriptionNim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of objects provided they all com
2015-08-08 11:47:49 1594 1
原创 取石子游戏(hdu2516+FIB博弈)
G - 取石子游戏Description1堆石子有n个,两人轮流取.先取者第1次可以取任意多个,但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win". Description1堆石子有n个,两人轮流取.先取者第1次可以取任意多个,但不能全部取完.以后每次取的石子数不能超过
2015-08-08 11:04:47 1047 1
原创 2015 Multi-University Training Contest 6 solutions BY ZJU(部分解题报告)
2015 Multi-University Training Contest 6 solutions
2015-08-07 13:47:58 1255 1
原创 邂逅明下(巴什博弈+hdu2897)
H - 邂逅明下Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u每行有三个数字n,p,q,表示一堆硬币一共有n枚,从这个硬币堆里取硬币,一次最少取p枚,最多q枚,如果剩下少于p枚就要一次取完。两人轮流取,直到堆里的硬币取完,最后一次取硬币的算输。对于每一行的三个数字,给出先取的人是否有必胜策略,如果有回答WIN,否则回答LOST。
2015-08-06 11:19:47 933 1
原创 Coins(2015嘉杰信息杯+dp)
CoinsProblem Description:Duoxida buys a bottle of MaiDong from a vending machine and the machine give her n coins back. She places them in a line randomly showing head face or tail face on. And Duoxida wants to know how many situations that m continuou
2015-08-05 23:47:00 854 1
原创 取(2堆)石子游戏(威佐夫博弈+hdu2177)
Problem Description有两堆石子,数量任意,可以不同。游戏开始由两个人轮流取石子。游戏规定,每次有两种不同的取法,一是可以在任意的一堆中取走任意多的石子;二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目,如果轮到你先取,假设双方都采取最好的策略,问最后你是胜者还是败者。如果你胜,你第1次怎样取子?
2015-08-05 23:38:17 1023 1
原创 取石子游戏(hdu1527+威佐夫博弈)
Problem Description有两堆石子,数量任意,可以不同。游戏开始由两个人轮流取石子。游戏规定,每次有两种不同的取法,一是可以在任意的一堆中取走任意多的石子;二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目,如果轮到你先取,假设双方都采取最好的策略,问最后你是胜者还是败者。如果你胜,你第1次怎样取子?
2015-08-05 23:21:08 1091 1
原创 Euclid's Game(poj2348+博弈)
B - Euclid's GameTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2348 Appoint description: System Crawler (2015-08-02)De
2015-08-05 17:00:07 1061 1
原创 Calendar Game(找规律+博弈)
A - Calendar GameTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 1024Appoint description: System Crawler (2015-08-02)Descrip
2015-08-05 15:24:28 1566 1
原创 博弈之——SG模板(hdu1848&&hdu1536)
很久没搞博弈了。先来写个模板: 现在我们来研究一个看上去似乎更为一般的游戏:给定一个有向无环图和一个起始顶点上的一枚棋子,两名选手交替的将这枚棋子沿有向边进行移动,无法移动者判负。事实上,这个游戏可以认为是所有Impartial Combinatorial Games的抽象模型。也就是说,任何一个ICG都可以通过把每个局面看成一个顶点,对每个局面和它的子局面连一条有向边来抽象
2015-08-04 21:51:14 661 1
原创 S-Nim(hdu1536+SG函数)
S-NimTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5317 Accepted Submission(s): 2288Problem DescriptionArthur and his sister
2015-08-04 21:41:44 2878 2
原创 Fibonacci again and again(hdu1848+SG打表)
Fibonacci again and againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6170 Accepted Submission(s): 2574Problem Description任何
2015-08-04 21:36:41 1573 1
批量压缩图片(tinifypng.com)
2018-02-28
2004-2013软件设计师历年真题及答案
2015-08-22
原根(扩展欧几里得的应用)
2015-08-12
Java算法之经典题目篇
2015-04-04
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人