原创 What Day Is It?(模擬)

The calendar now in use evolved from the Romans. Julius Caesar codified a calendar system that came to be known as the

原创 Page Count (字符串+模擬)

When you execute a word processor'sprint command, you are normally prompted to specify the pages you want printed. Yo

原创 Robberies (01揹包問題)

The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the e

原创 Oil Deposits (深搜)

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with o

原创 Til the Cows Come Home(最短路—Dijkstra算法)

Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes

原创 Bitmap(模擬)

Bitmap is a compression technology for redundant data compression. The ratio of Bitmap Compression is the size of compr

原创 Crashing Robots (複雜模擬)

In a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots rea

原创 U-Turn (深搜)

Given the map of a town with R x C cells, and each cell is: X: building segment .: a road surface Each turn, you can

原创 Minesweeper(深搜)

Minesweeper is a game available with the Windows™ operating system. The object of Minesweeper is to locate all the mi

原创 Human Gene Functions (預處理+DP)

It is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply de

原创 Meteor Shower(廣搜)

Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into earth and

原创 分糖果系列一(DP+暴力)

描述 Oliver分別有幣值爲1,3,5,7,9,13元的硬幣a,b,c,d,e,f枚。一天她去大學生超市買糖吃,糖的價格爲g元。 問:用Oliver僅有的這6種硬幣去恰好購買這g元的糖果,最少需要支付多少個硬幣?(當不能支付時輸出

原创 In-circles Again (計算幾何)

In the figure below you can see triangle ABC and its in-circle (Circle that touches all the sides of a triangle inter

原创 Home Work (貪心法基礎)

臨近開學了,大家都忙着收拾行李準備返校,但I_Love_C卻不爲此擔心! 因爲他的心思全在暑假作業上:目前爲止還未開動(-_-!!還以爲他有多冷靜呢)。 暑假作業是很多張試卷,我們這些從試卷裏爬出來的人

原创 Max Sum Plus Plus (DP)

Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to