摘要：
Tree's a CrowdDr William Larch, noted plant psychologist and inventor of the phrase ``Think like a tree--Think Fig'' has invented a new classification system for trees. This is a complicated system involving a series of measurements which are then combined to produce three numbers (in th 阅读全文
摘要：
Where's Waldorf?Given ambyngrid of letters, (), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line of letters in the grid. A word can match the letters in the grid regardless of case (i.e. upper and lower case letters 阅读全文
摘要：
打开Apache配置文件httpd.conf，找到DocumentRoot，将原来的路径那一行用#注释掉，再在下面写上自已的路径，比如这里我用的是DocumentRoot "C:/MyFiles".改好后如下图所示： 改完可能会出现You don't have permission to access / on this server的情况，出现这种情况则需要在配置文件中再改一项内容：配置文件中定义了默认对网站根的访问权限：# Each directory to which Apache has access can be configured with respe 阅读全文
摘要：
Count the ColorsTime Limit:2 Seconds Memory Limit:65536 KBPainting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segments of different colors you can see at last.InputThe first line of each data set contains exa 阅读全文
摘要：
The Donkey of Gui ZhouTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 308Accepted Submission(s): 118 Problem DescriptionThere was no donkey in the province of Gui Zhou, China. A trouble maker shipped one and put it in the forest which could be con 阅读全文
摘要：
SubsequenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:7307Accepted:2710DescriptionA sequence of N positive integers (10 s的t，对每个t用二分查找的方法在前面找到满足条件且与它距离最近的s，求出最小值即可 1 #include 2 #include 3 4 using namespace std; 5 6 int n,s; 7 int sum[100010]; 8 9 int main()10 {11 int kase;12 13 ... 阅读全文
摘要：
Aggressive cowsTime Limit:1000MSMemory Limit:65536KTotal Submissions:4808Accepted:2356DescriptionFarmer John has built a new long barn, with N (2 2 #include 3 #include 4 #include 5 6 using namespace std; 7 8 int n,c; 9 int x[100010];10 11 int main()12 {13 scanf("%d %d",&n,&c);14 fo 阅读全文
摘要：
Cable masterTime Limit:1000MSMemory Limit:10000KTotal Submissions:18552Accepted:3975DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect 阅读全文
摘要：
Invitation CardsTime Limit:8000MSMemory Limit:262144KTotal Submissions:17127Accepted:5570DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They 阅读全文
摘要：
MPI MaelstromTime Limit:1000MSMemory Limit:10000KTotal Submissions:4323Accepted:2624DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advis 阅读全文
摘要：
Stockbroker GrapevineTime Limit:1000MSMemory Limit:10000KTotal Submissions:23849Accepted:13104DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the st 阅读全文
摘要：
Curling 2.0Time Limit:1000MSMemory Limit:65536KTotal Submissions:8810Accepted:3703DescriptionOn Planet MM-21, after their Olympic games this year, cur... 阅读全文
摘要：
YTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 209Accepted Submission(s): 69 Problem DescriptionSample Input41 21 31 4Sample Output1Hint1. The only set is {2,3,4}.2. Please use #pragma comment(linker, "/STACK:16777216")Source2013 Mul 阅读全文
摘要：
SunscreenTime Limit:1000MSMemory Limit:65536KTotal Submissions:2616Accepted:925DescriptionTo avoid unsightly burns while tanning, each of theC(1 ≤C≤ 2500) cows must cover her hide with sunscreen when they're at the beach. Cowihas a minimum and maximumSPFrating (1 ≤minSPFi≤ 1,000;minSPFi≤maxSPFi≤ 阅读全文
摘要：
Aizu 2170: http://www.cnblogs.com/lzj-0218/p/3273342.html 阅读全文
摘要：
Marked AncestorTime Limit : 8 sec, Memory Limit : 65536 KBProblem F:Marked AncestorYou are given a treeTthat consists ofNnodes. Each node is numbered from 1 toN, and node 1 is always the root node ofT. Consider the following two operations onT:M v: (Mark) Mark nodev.Q v: (Query) Print the index of t 阅读全文
摘要：
Milking TimeTime Limit:1000MSMemory Limit:65536KTotal Submissions:3607Accepted:1533DescriptionBessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her nextN(1 ≤N≤ 1,000,000) hours (conveniently labeled 0..N-1) so that she produces 阅读全文
摘要：
Apple CatchingTime Limit:1000MSMemory Limit:65536KTotal Submissions:6397Accepted:3102DescriptionIt is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) in his field, each full of apples. Bessie cannot reach the apples when they are o 阅读全文
摘要：
SumsetsTime Limit:2000MSMemory Limit:200000KTotal Submissions:11009Accepted:4433DescriptionFarmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers that sum to 7: 阅读全文
摘要：
MineTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 855Accepted Submission(s): 259 Problem DescriptionHave you ever played a game in Windows: Mine? This game is played on a n*m board, just like the Pic(1) On the board, Under some grids there are.. 阅读全文