其他

Robotic SortTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1102    Accepted Submission(s): 451Problem DescriptionSomewhere deep in the Czech Technical University buildings, there are

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9211    Accepted Submission(s): 3192Problem DescriptionNowadays, we all know that Computer College is the biggest department in

DescriptionLittle Tom loves playing games. One day he downloads a little computer game called 'Bloxorz' which makes him excited. It's a game about rolling a box to a specific position on a special plane. Precisely, the plane, which is composed of

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents           by---cxlove沒事做場TC，結果跪了。。。。250PT:從(0,0)出發，出租車的速度是一定的，步行的速度也是固定的，所以最快的肯定是全部步行，或者步行至一個出租車處，然後坐車。不會坐兩輛出租車的。枚舉所有出租車即可。class GrabbingTaxi{public:int minTime(vector <int> tXs,

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents           by---cxlove終於在TC過了兩題，可惜第三題看錯了題目。250pt：只需要判斷有幾種顏色即可。class ColorfulBricks{public:int countLayouts(string bricks){bool flag[26];int cnt=0;memset(flag,false,sizeof(flag));for(int i=0;

Brownie Points IITime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1354 Accepted: 478DescriptionStan and Ollie play the game of Odd Brownie Points. Some brownie points are located in the plane, at integer coordinates. Stan plays first and

dance partyTime Limit: 2 Sec  Memory Limit: 128 MBSubmissions: 374  Solved: 136DescriptionYou are organizing a dance party. The party will be attended by n boys and n girls. There will be several rounds of dancing.In each round, you divide the

轉載請註明出處，謝謝 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塊石頭

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

轉載請註明出處，謝謝 http://blog.csdn.net/ACM_cxlove?viewmode=contents           by---cxlove給出兩個數，a和b，將大的數中，減去若干b的倍數，最終有一個數為0的話就勝了。http://acm.hdu.edu.cn/showproblem.php?pid=1525兩個數a和b，總會出現的一個局面是b,a%b，這是必然的，如果a>=b&&a<2*b，那麼只有一種情況，直接到b,a%b。否則有多種情況。

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

SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2838 Accepted: 1264DescriptionConsider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure

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

D. Parking Lottime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNowadays it is becoming increasingly difficult to park a car in cities successfully. Let's imagine a segment of a street as long as L 

Get Luffy OutTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6191 Accepted: 2327DescriptionRatish is a young man who always dreams of being a hero. One day his friend Luffy was caught by Pirate Arlong. Ratish set off at once to Arlong's

使用SDL庫之前需要裝載各個子系統，就像要放電影，必須給播放器提供影片一樣裝載子系統的函數是int SDL_Init(Uint32 flags);flags可取的值如下：#define SDL_INIT_TIMER             0x00000001   計時器#define SDL_INIT_AUDIO             0x00000010   音頻#define SDL_INIT_VIDEO             0x00000020  

Matrix3My Tags  (Edit) Source : bin3 Time limit : 5 sec Memory limit : 64 MSubmitted : 302, Accepted : 74Zhouguyue is a "驢友" and nowadays he likes traveling on an N * N matrix with a non-negative number in each grid, and each grid has a height.

Knights of the Round TableTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 4896 Accepted: 1521DescriptionBeing a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other

Closest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 9221 Accepted: 2955DescriptionWrite a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines the closest