O__o_o__O的专栏

Slash Maze By filling a rectangle with slashes (/) and backslashes (), youcan generate nice little mazes. Here is an example:As you can see, paths in the maze cannot branch, so the w

第一次写dp，感觉还不错，虽然在声明d数组时，用了char型，好衰。。。。。写dp好有艺术感。最长公共子序列（LCS)2种解法，好像还有nlog(n)的算法。以后在写#include#include#include#define N 1020using namespace std;char a[N],b[N];int lena,lenb,d[N][N];

Problem DFill There are three jugs with a volume of a, b and c liters. (a,b, and c are positive integers not greater than 200). The first and the secondjug are initially empty, while the third

Addition Chains An addition chain for n is an integer sequence $" align="middle" src="http://uva.onlinejudge.org/external/5/529img1.gif" width="168" height="30"> with the following four prop

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 t

BackgroundOrder is an important concept in mathematics and in computer science. For example, Zorn's Lemma states: ``a partially ordered set in which every chain has an upper bound contains a maximal

SpreadsheetIn 1979, Dan Bricklin and Bob Frankston wrote VisiCalc, the first spreadsheet application. It became a huge success and, at that time, was the killer application for the Apple

Problem D: The Necklace My little sister had a beautiful necklace made of colorful beads. Twosuccessive beads in the necklace shared a common color at their meeting point.The figure below

S-Trees A Strange Tree (S-tree) over the variable set is a binary tree representing a Boolean function . Each path of the S-tree begins at the root node and consists of n+1 nodes. Each of

2007/2008 ACM International Collegiate Programming Contest University of Ulm Local ContestProblem E: ExpressionsArithmetic expressions are usually written with the operators in between the t

Number SequenceTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit]  [Go Back]  [Status]  DescriptionProblem BNumber SequenceInput: stand

Problem F"Advertisement" The Department of Recreation has decided that it must be more profitable, and it wants to sell advertising space along a popular jogging path at a local park. They hav

Gone Fishing John is going on a fishing trip. He has h hours available ( ), and there aren lakes in the area () all reachable along a single, one-way road. John starts at lake 1, but he

Ugly Numbers Ugly numbers are numbers whose only prime factors are 2, 3 or 5.  The sequence1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ...shows the first 11 ugly numbers.  By convention,

Problem HGame Show MathInput: standard inputOutput: standard outputTime Limit: 15 secondsA game show in Britainhas a segment where it gives its contestants a sequence of positive numbers

Add AllTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit]  [Go Back]  [Status]  DescriptionProblem FAdd AllInput: standard inputOutpu

Problem A: An antiarithmetic permutationA permutation of n+1 is a bijective function of the initialn+1 natural numbers: 0, 1, ...n.  A permutationp is called antiarithmetic if there is no subseque

I know, up on top you are seeing great sights,But down at the bottom, we, too, should have rights.We turtles can't stand it. Our shells will all crack!Besides, we need food. We are starving!" gr