其他

Meteor ShowerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6111 Accepted: 1803DescriptionBessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into earth and destroy anything they hit.

最近的一段時間都在刷關於dijkstra的東西 ，在參看了白書等參考之後 ，我個人做了點小總結。首先要明確的是dijkstra的最主要用途是求單源最短路徑的（權值非負）。所謂單源最短路徑就是固定一個頂點為源點，然後求源點到其他點的最短路徑。（需要特別注意的是

Smallest DifferenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2679 Accepted: 766DescriptionGiven a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing them in some

題目描述：Roy去搶銀行，如何在不被抓住的情況下搶到最多的錢。給出搶每個銀行能搶到的錢和被抓到的機率。分析：剛開始以為機率只有兩位小數，乘以100直接做的，結果探索資料不是這樣的，果斷wa了。然後一直在這裡糾結，背包容量不為整數怎麼辦。無奈之下看一下別人的解題報告，發現可以讓搶的錢看做背包容量，被抓住的機率為背包價值。（趕腳自己在死學習，o(╯□╰)o）。但是自己又想錯了，直接將每次搶銀行沒被抓住的機率想加，懂點機率的人都知道這是很愚蠢的想法（o(╯□╰)o）。下面是代碼：/*Hdu 2955

一道dp例題，給出一個矩陣，要找到從左上到右下的一條路徑，使這條路徑上的數相乘的結果的末尾0的個數最少。先考慮整個矩陣的數都是正的。dp[i][j]要記錄兩個值，到這一點2的最少個數和5的最少個數，最後答案就是兩者的較小值。再考慮如果有0，那答案最大為1。#include <iostream>#include <string>#include <map>#include<cstdio>#include<cstring>#include&

HopscotchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1462 Accepted: 1043DescriptionThe cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cows create a 5x5

Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 37800 Accepted: 11724DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a

/*The describe is not clear*/#include<cstdio>#include<cstring>using namespace std;const int maxn = 205;int degree[maxn];int f[maxn];int N,R;int find(int x){ if(x != f[x]) { f[x] = find(f[x]); } return f[x];}int main(){

Oil DepositsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11077 Accepted: 5991DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region

B. Ilya and Queriestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIlya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.You'

Shuffle'm UpTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4557 Accepted: 2167DescriptionA common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker

Window PainsTime Limit: 2 Seconds      Memory Limit: 65536 KBBoudreaux likes to multitask, especially when it comes to using his computer. Never satisfied with just running one application at a time, he usually runs nine applications, each in its

PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8211 Accepted: 3481 Special JudgeDescriptionYou are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i)        fill the pot 

Fiber NetworkTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2725 Accepted: 1252DescriptionSeveral startup companies have decided to build a better Internet, called the "FiberNet". They have already installed many nodes that act as routers

GarlandTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1184 Accepted: 515DescriptionThe New Year garland consists of N lamps attached to a common wire that hangs down on the ends to which outermost lamps are affixed. The wire sags under

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20716 Accepted: 6741DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but

  Problem A: The Monocycle A monocycle is a cycle that runs on one wheel and the one we will be considering is a bit more special. It has a solid wheel colored with five different colors as shown in the figure:The colored segments make equal angles (

/*Poj 2677 TourDP 雙調歐幾裡得旅行商問題轉移方程 :當j = i - 1: d[i][i-1] = min{d[i-1][k] + p[i][k]} (1<=k<i-1)當j < i - 1: d[i][j] = d[i-1][j] + p[i-1][i]*/#include<cstdio>#include<cstring>#include<cmath>#define Min(a,b) (a<b?a:b)using

                               最近非常的頹廢，好長時間都沒有刷題了，看了前面寫的部落格，感覺那時候寫下的目標全部廢了，不知道現在幡然醒悟，算不算晚，總而言之，希望能堅持下去吧，也希望這是一個好的開端，進擊的acmer！！！！！                           

Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 19263 Accepted: 10259DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile,