其他

轉載請註明出處，謝謝http://blog.csdn.net/acm_cxlove/article/details/7854526      

轉載請註明出處，謝謝http://blog.csdn.net/acm_cxlove/article/details/7854526      

轉載請註明出處，謝謝http://blog.csdn.net/acm_cxlove/article/details/7854526      

SPOJ Problem Set (classical)1771. Yet Another N-Queen ProblemProblem code: NQUEENAfter solving Solution to the n Queens Puzzle by constructing, LoadingTime wants to solve a harder version of the N-Queen Problem. Some queens have been set on

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents          

題目地址： http://acm.hdu.edu.cn/showproblem.php?pid=2149PN問題當n%(m+1)==0時輸了，其他情況贏當n>m，只有第一次捐n%(m+1)才能贏。當n<=m時，第一次可以捐n,n+1,n+2,…,m。代碼如下;#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents           by---cxlove題目：2-20這19個數位遊戲。每取走一個數之後，這個數的倍數便不能再取，而且某兩個不能取的數的和，也不能再取。http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=39由於只有19個數，通過狀態壓縮儲存狀態，進行記憶化搜尋。dp[1<<19]即可，dp[i]

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents           by---cxlove題目：有兩個隊，每個隊有n個人，每個人每次有數量限制，取最後一塊的輸，問獲勝策略。http://poj.org/problem?id=2068其實差不多，dp[i][j]表示第i個人取，還有j塊石頭

Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2069    Accepted Submission(s): 766Problem DescriptionDuring the War of Resistance Against Japan, tunnel warfare was carried out

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents           by---cxlove題目：三堆石頭，每次從一堆中取走若干，或者從兩堆中取走相同的數量

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents          

HotelTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 6224 Accepted: 2546DescriptionThe cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ever

覆蓋的面積Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1949    Accepted Submission(s): 960Problem

Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 10776 Accepted: 4533Case Time Limit: 5000MSDescriptionAs more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents          

題目地址：http://poj.org/problem?id=3687代碼如下：#include <iostream>#include <vector>#include <deque>#include <queue>#include <stack>#include <map>#include <set>#include <algorithm>#include

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents          

CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 20885 Accepted: 7128DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents          

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents           by---cxlove題目：有多棵樹進行刪邊博弈，注意這裡的”樹“可能存在環，形狀也許是非常詭異的。我們利用The Fusion Principle：任何環內的節點可以融合成一點而不會改變圖的sg值。（下面我們稱它為融合原則）        融合原則允許我們把任意一個根圖簡化為一個等效的可以通過冒號原則（即Colon