原创 hdu 3551 Hard Problem 一般圖最大匹配+給出一個無向圖,存在重邊,沒有自環。問能否刪除一些邊,使得每個頂點的度數爲指定度數
Problem Description This is the most tough task in this contest, do not try it until you solve all the other tasks or y
原创 joj 2623: BeautifulSky 將空間n個點分成兩部分,求sigma(dis[ai,aj])的最大值
The sky is beautiful, there are many stars in it. Xiaoming is curious, he came out with a strange idea. He want to div
原创 hdu 3829 Cat VS Dog 最大點獨立集
Problem Description The zoo have N cats and M dogs, today there are P
原创 zoj 3316 Game 一般圖最大匹配+博弈 有N個棋子在棋盤上,2個人輪流拿走一個棋子,第一步可以拿任意一個,而之後每一步必須拿上一步拿走的棋子曼哈頓長度L以內的棋子,問,後手是否能贏
Fire and Lam are addicted to the game of Go recently. Go is one of the oldest board games. It is rich in strategy desp
原创 joj 2620: Count Square 狀態壓縮DP N*M的0,1方格,每一個2*2的小方格有一個價值,求整個方格的最大價值
Xiaoming is a 5-year old boy. He has many toys. Among them there is a magic box. On the top of the box there are n * m
原创 hdu 3450 Counting Sequences 樹狀數組+DP 求相鄰兩個數字的絕對值小於等於H並且序列長度的序列個數
Problem Description For a set of sequences of integers{a1,a2,a3,...an}, we define a sequence{ai1,ai2,ai3...aik}in which
原创 113C - Double Happiness 求區間%4=1的素數--可以表示成平方和的形式--的個數(素數篩選法)
On the math lesson a teacher asked each pupil to come up with his own lucky numbers. As a fan of number theory P
原创 joj 2262: Brackets 最多有多少括號匹配
We give the following inductive definition of a " regular brackets " sequence:the empty sequence is a regular brackets
原创 hdu 4107 Gangster 線段樹 成段更新 最後求每一位的值
Problem Description There are two groups of gangsters fighting with each other. The first group stands in a line, but t
原创 hdu 4109 Instrction Arrangement 求關鍵路徑的長度
Problem Description Ali has taken the Computer Organization and Architecture course this term. He learned that there ma
原创 nankai 2082: 靶形數獨 數獨(9*9)求所有解 DLX+精確覆蓋
2082: 靶形數獨 Time Limit: 2000 ms Memory Limit: 131072 kB Judge type: Multi-cases (Detailed Mode
原创 程序員編程藝術 pdf下載
http://pan.baidu.com/s/1jGFSuiy
原创 hdu 3455 Leap Frog
Problem Description Jack and Jill play a game called "Leap Frog" in which they alternate turns jumpi
原创 joj 2672 Hanoi Tower Once More 有向無環圖的最小路徑覆蓋=N-最大匹配
2010 Yuanguang Cup ACM-ICPC Collegiate Programming Contest Problem I: Hanoi Tower
原创 poj 2723 Get Luffy Out 2-SAT+二分答案
Description Ratish is a young man who always dreams of being a hero. One day his friend Luffy was caught by Pirate Arlo