其他

A Knight's JourneyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 15815Accepted: 5295DescriptionBackground The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the

Zero SumConsider the sequence of digits from 1 through N (where N=9) in increasing order: 1 2 3 ... N.Now insert either a `+' for addition or a `-' for subtraction or a ` ' [blank] to run the digits together between each pair of digits (not in front

I Hate ItTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8782    Accepted Submission(s): 3239Problem

1010: The Almost Lucky NumbersTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 16  Solved: 11[Submit][Status][Web Board]DescriptionJohn and Brus believe that the digits 4 and 7 are lucky and all others are not. According to them, an almost lucky

分類：DP，遞推，記憶化搜尋作者：ACShiryu時間：2011-7-15Subset Sums JRMFor many sets of consecutive integers from 1 through N (1 <= N <= 39), one can partition the set into two sets whose sums are identical.For example, if N=3, one can partition the set {1, 2,

分類：圖論，最小產生樹作者：ACShiryu時間：2011-7-29原題：http://poj.org/problem?id=2485HighwaysTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12754Accepted: 5969DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public

題意：給一個有向圖，告訴起點和終點，求第K短路解法：dijkstra+A*，正反兩個鄰接表總結：做完這個題學會了dijkstra演算法，對A*有了一點瞭解PS.優先隊列裡的比較函數變數寫錯了，MLE了3天，噁心死我了。膜拜無語神牛，幾分鐘就指導我搞定了/*Problem: 2449User: fancy081Memory: 6472KTime: 250MSLanguage: C++Result: Accepted*/#include<cstdio>#include<queue&

分類：圖論，二分圖，最大匹配，匈牙利演算法作者：ACShiryu時間：2011-7-31原題：http://poj.org/problem?id=1274資料：Matrix67's Blog ; NOCOW匈牙利演算法 ；二分圖匹配課件The Perfect StallTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 11659Accepted: 5395DescriptionFarmer John completed his

set是關聯容器。其索引值就是實值，實值就是索引值，不可以有重複，所以我們不能通過set的迭代器來改變set的元素的值，set擁有和list相同的特性：當對他進行插入和刪除操作的時候，操作之前的迭代器依然有效。當然刪除了的那個就沒效了。set的底層結構是RB-tree，所以是有序的。  

分類：DFS，迷宮，棋盤作者：ACShiryu時間：2011-7-24地址：ACShiryu's Blog棋盤問題Time Limit: 1000MSMemory Limit: 10000KTotal

分類：圖論，最小覆蓋點作者：ACShiryu時間：2011-8-2原題：http://poj.org/problem?id=1325參考資料：Matrix67's Blog Machine ScheduleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 7612Accepted: 3207DescriptionAs we all know, machine scheduling is a very classical

分類：DFS，數學作者：ACShiryu時間：2011-7-24地址：ACShiryu's BlogFind The MultipleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9346Accepted: 3854Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n

題意：每個頂點有一個權值，求構造一個圖，使得 ∑(每個點的權值)X(到1結點的距離) 最小方法：dijkstra+heap昨晚寫了一個，不知道為什麼TLE，怎麼改都TLE。今天重寫一遍AC了#include<cstdio>#include<queue>#include<cstring>using namespace std;#define MAXN 50005#define MAXM 100005#define INF 10000000000int edge_

分類：數論作者：ACShiryu時間：2011-8-3原題：http://poj.org/problem?id=1142Smith NumbersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 8853Accepted: 3105DescriptionWhile skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh

Party Lamps IOI 98To brighten up the gala dinner of the IOI'98 we have a set of N (10 <= N <= 100) colored lamps numbered from 1 to N.The lamps are connected to four buttons:Button 1: When this button is pressed, all the lamps change their

作者：ACShiryu時間：2011-8-4原題：http://poj.org/problem?id=2262Goldbach's ConjectureTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 24877Accepted: 9798DescriptionIn 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard

文章目錄 PROGRAM NAME: prefixINPUT FORMATSAMPLE INPUT (file prefix.in)OUTPUT FORMATSAMPLE OUTPUT (file prefix.out) 今天完全不行啊，USACO只做了一題，今天也只刷了兩題，USACO還卡題了Longest PrefixIOI'96The structure of some biological objects is

作者：ACShiryu時間：2011-8-4原題：http://poj.org/problem?id=2407RelativesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7396Accepted: 3402DescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two

分類：圖論，產生樹，Prim作者：ACShiryu時間：2011-7-29原題：http://poj.org/problem?id=1789Truck HistoryTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 9712Accepted: 3579DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are

Binomial ShowdownTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 14435Accepted: 4403DescriptionIn how many ways can you choose k elements out of n elements, not taking order into account? Write a program to compute this number.InputThe