2014年08月_苏摩夜

原创【索引】AOAPC I: Beginning Algorithm Contests (Rujia Liu)

AOAPC I: Beginning Algorithm Contests (Rujia Liu)Volume 0. Getting StartedVolume 1. Elementary Problem SolvingVolume 2. Data StructuresVolume 3. Brute ForceVolume 4. Algorithm DesignVolume 5. Dy

2014-08-21 22:23:06 572

原创 UVA - 439 Knight Moves

A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set ofn squares on a chessbo

2014-08-24 08:32:26 466

原创 UVA - 705 Slash Maze

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

2014-08-23 15:24:49 598

原创 UVA - 784 Maze Exploration

style="font-size:24px;color:#c0ffff;"> Maze Exploration A maze of rectangular rooms is represented on a two dimensional grid as illustrated in figure 1a. Each point of the grid is represented by a

2014-08-23 09:17:11 421

InterGames is a high-tech startup company that specializes in developing technology that allows users to play games over the Internet. A market analysis has alerted them to the fact that games of chan

2014-08-22 19:30:56 511

原创 UVA - 572 Oil Deposits

The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides th

2014-08-22 14:35:00 360

原创 UVA - 10562 Undraw the Trees

Problem DUndraw the Trees Input: Standard Input Output: Standard Output Time Limit: 2 Seconds Professor Homer has been reported missing. We suspect that his recent research works might h

2014-08-22 09:17:49 452

原创【索引】Backtracking - Easy

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 3. Brute Force ::Backtracking - Easy10474 - Where is the Marble?216 - Getting in Line639 - Don't Get Rooked539 - The Settlers of Cat

2014-08-21 22:37:06 401

原创【索引】Graphs

AOAPC I: Beginning Algorithm Contests (Rujia Liu) ::Volume 2. Data Structures :: Graphs572 - Oil Deposits657 - The die is cast784 - Maze Exploration705 - Slash Maze439 - Knight Moves53

2014-08-21 22:35:33 461

原创【索引】Binary Trees

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 2. Data Structures :: Binary Trees112 - Tree Summing548 - tree297 - Quadtrees712 - S-Trees699 - The Falling Leaves327 - Eval

2014-08-21 22:35:06 370

原创【索引】Elementary Skills

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 3. Brute Force :: Elementary Skills10167 - Birthday Cake11205 - The Broken Pedometer131 - The Psychic Poker Player146 - ID Codes1009

2014-08-21 22:34:47 327

原创【索引】Lists

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 2. Data Structures :: Lists127 - "Accordian" Patience101 - The Blocks Problem133 - The Dole Queue10152 - ShellSort673 - Parenthe

2014-08-21 22:34:12 314

原创【索引】Maths - Simple Geometry

AOAPC I: Beginning Algorithm Contests (Rujia Liu) ::Volume 1. Elementary Problem Solving :: Maths - Simple Geometry 10250 - The Other Two Trees579 - ClockHands375 - Inscribed Circles and Iso

2014-08-21 22:33:17 384

原创【索引】Maths - Misc

AOAPC I: Beginning Algorithm Contests (Rujia Liu) ::Volume 1. Elementary Problem Solving :: Maths - Misc113 - Power of Cryptography10161 - Ant on a Chessboard253 - Cube painting621 - Secre

2014-08-21 22:32:02 347

原创【索引】Maths - Number Theory

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving :: Maths - Number Theory 575 - Skew Binary10110 - Light, more light550 - Multiplying by Rotation

2014-08-21 22:31:02 368

原创【索引】Big Number

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving :: Big Number424 - Integer Inquiry10106 - Product465 - Overflow748 - Exponentiation10494 - If We Were a

2014-08-21 22:29:29 321

原创【索引】String

AOAPC I: Beginning Algorithm Contests (Rujia Liu) ::Volume 1. Elementary Problem Solving :: String401 - Palindromes10010 - Where's Waldorf?10361 - Automatic Poetry537 - Artificial Intelligence

2014-08-21 22:28:52 330

原创【索引】Sorting/Searching

AOAPC I: Beginning Algorithm Contests (Rujia Liu) ::Volume 1. Elementary Problem Solving :: Sorting/Searching340 - Master-Mind Hints10420 - List of Conquests10474 - Where is the Marble?152

2014-08-21 22:28:19 367

原创【索引】Volume 3. Brute Force

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 3. Brute ForceElementary SkillsBacktracking - EasyBacktracking - HardImplicit Graph TraversalHashing / SetsRujia Liu's Problems fo

2014-08-21 22:27:48 354

原创【索引】Volume 2. Data Structures

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 2. Data StructuresListsBinary TreesGraphs

2014-08-21 22:26:57 328

原创【索引】Volume 1. Elementary Problem Solving

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem SolvingStringBig NumberSorting/SearchingMaths - MiscMaths - Number TheoryMaths - Simple Geometry

2014-08-21 22:26:06 453

原创【索引】Volume 0. Getting Started

AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 0. Getting Started10055 - Hashmat the Brave Warrior10071 - Back to High School Physics10300 - Ecological Premium458 - The Decode

2014-08-21 22:25:35 376

原创 UVA - 10494 If We Were a Child Again

Problem CIf We Were a Child AgainInput: standard inputOutput: standard output Time Limit: 7 seconds Oooooooooooooooh! If I could do the easy mathematics like my school days!!

2014-08-21 09:44:13 515

原创 UVA - 748 Exponentiation

Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.

2014-08-20 20:41:02 470

原创 UVA - 465 Overflow

Write a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expression is too large to be represented as a ``norma

2014-08-20 15:54:51 354

原创 UVA - 10106 Product

The ProblemThe problem is to multiply two integers X, Y. (0250)The InputThe input will consist of a set of pairs of lines. Each line in pair contains one multiplyer.The OutputFor each in

2014-08-20 14:51:41 355

原创 UVA - 424 Integer Inquiry

One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.``This superc

2014-08-20 09:40:32 331

原创 UVA - 12657 Boxes in a Line

#include #include using namespace std;int r[100010];int l[100010]; void link(int x,int y) { l[y]=x; r[x]=y; } void moveleft(int x,int y) { link(l[x],r[x]); link(l[y],x)

2014-08-20 08:37:24 674

原创 UVA - 839 Not so Mobile

Before being an ubiquous communications gadget, a mobile was just a structure made of strings and wires suspending colourfull things. This kind of mobile is usually found hanging over cradles of small

2014-08-18 20:32:33 422

原创 UVA - 327 Evaluating Simple C Expressions

The task in this problem is to evaluate a sequence of simple C expressions, buy you need not know C to solve the problem! Each of the expressions will appear on a line by itself and will contain no mo

2014-08-18 18:59:11 501

原创 UVA - 699 The Falling Leaves

Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing ha

2014-08-18 14:28:05 354

原创 UVA - 712 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 the S-tree's node

2014-08-18 10:00:48 396

原创 UVA - 297 Quadtrees

A quadtree is a representation format used to encode images. The fundamental idea behind the quadtree is that any image can be split into four quadrants. Each quadrant may again be split in four sub q

2014-08-17 19:14:21 371

原创 UVA - 548 Tree

You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum o

2014-08-17 14:24:41 458

原创 UVA - 122 Trees on the level

BackgroundTrees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fu

2014-08-17 09:22:28 391

原创 UVA - 112 Tree Summing

BackgroundLISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used. Lists, which are the fundamental data structures in LI

2014-08-16 20:08:03 409

原创 UVA - 10050 Hartals

A social research organization has determined a simple set of parameters to simulate the behavior of the political parties of our country. One of the parameters is a positive integerh (called the ha

2014-08-16 15:55:20 378

原创 UVA - 540 Team Queue

Queues and Priority Queues are data structures which are known to most computer scientists. TheTeam Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the q

2014-08-16 10:52:59 390

原创 UVA - 11234 Expressions

Problem E: ExpressionsArithmetic expressions are usually written with the operators in between the two operands (which is called infix notation). For example,(x+y)*(z-w) is an arithmetic express

2014-08-16 08:37:16 415

原创 UVA - 11111 Generalized Matrioshkas

Vladimir worked for years making matrioshkas, those nesting dolls that certainly represent truly Russian craft. A matrioshka is a doll that may be opened in two halves, so that one finds another doll

2014-08-15 18:48:30 434

空空如也

空空如也