2015年01月_叶孤心丶

11月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创 B. Painting Pebbles（Codeforces Round #289 ）

B. Painting Pebblestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n piles of pebbles on the tabl

2015-01-31 22:10:57 642

原创 A. Maximum in Table（ Codeforces Round #289）

A. Maximum in Tabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn n × n table a is defined as follows:

2015-01-31 22:08:09 769

原创 UVA Foreign Exchange（排序）

题意：有一个学校里面有一些学生，他们都有想要去的地方，每组数据输入两个数n，m，代表这个学生现在在n点并且他想去m点，如果想去就必须有一个在m点想要到n点的学生。如果所有的学生都能到想到的地方去输出YES，否则输出NO。#include#include#include#include#includeusing namespace std;int a[500001];i

2015-01-30 22:40:55 546

原创 UVA Children’s Game(贪心)

Description4thIIUCInter-University Programming Contest, 2005AChildren’s GameInput: standard inputOutput: standard outputProblemsetter:

2015-01-30 22:36:40 752

原创 C. Anya and Ghosts( Codeforces Round #288 (Div. 2))

C. Anya and Ghoststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnya loves to watch horror movies. In th

2015-01-29 08:12:06 810

原创 B. Anton and currency you all know(Codeforces Round #288 (Div. 2))

B. Anton and currency you all knowtime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland, 2016. The exc

2015-01-29 08:10:38 1042

原创 A. Pasha and Pixels(Codeforces Round #288 (Div. 2))

A. Pasha and Pixelstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha loves his phone and also putting

2015-01-29 08:08:02 656

原创 C. Anya and Ghosts（Codeforces Round #288 (Div. 2)）

C. Anya and Ghoststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnya loves to watch horror movies. In th

2015-01-28 21:08:36 816

原创 B. Anton and currency you all know（Codeforces Round #288 (Div. 2)）

B. Anton and currency you all knowtime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland, 2016. The exc

2015-01-28 21:03:38 908

原创 A. Pasha and Pixels(Codeforces Round #288 (Div. 2))

A. Pasha and Pixelstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha loves his phone and also putting

2015-01-28 20:56:39 739

原创 UVA Compound Words(STL map)

Problem E: Compound WordsYou are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is the concatenation of exactly two other words in

2015-01-28 00:07:52 631

原创 UVA Babelfish（STL map）

Problem C: BabelfishYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understan

2015-01-28 00:05:31 578

原创 UVA FILL(BFS + 优先队列)

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 second jug are initially empty, while the

2015-01-27 23:49:19 792

原创 UVA Graph Coloring（DFS+回溯）

Graph Coloring You are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the only available colors are black a

2015-01-26 16:49:59 883 1

原创 UVA The Sultan's Successors （八皇后问题）

The Sultan's Successors The Sultan of Nubia has no children, so she has decided that the country will be split into up to k separate parts on her death and each part will be inherited by

2015-01-26 16:44:14 1146

原创 UVA How Big Is It? （DFS+回溯）

How Big Is It? Ian's going to California, and he has to pack his things, including his collection of circles. Given a set of circles, your program must find the smallest rectangular box in

2015-01-26 16:36:57 710

原创 UVA Mapping the Swaps （DFS）

Mapping the Swaps Sorting an array can be done by swapping certain pairs of adjacent entries in the array. This is the fundamental technique used in the well-known bubble sort. If we lis

2015-01-26 16:34:41 603

原创 UVA 23 Out of 5（DFS+回溯）

Problem I23 Out of 5Input: standard inputOutput: standard outputTime Limit: 1 secondMemory Limit: 32 MBYour task is to write a program that can decide whether you can find an arithmetic ex

2015-01-26 16:29:28 863

原创 UVA Transportation （DFS）

Transportation Ruratania is just entering capitalism and is establishing new enterprising activities in many fields including transport. The transportation company TransRuratania is star

2015-01-26 15:59:17 713

原创 B. Amr and Pins（ Codeforces Round #287 (Div. 2)）

B. Amr and Pinstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr loves Geometry. One day he came up with

2015-01-24 08:44:52 946

原创 A Amr and Music（ Codeforces Round #287 (Div. 2)）

A. Amr and Musictime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr is a young coder who likes music a lot.

2015-01-24 08:38:14 1128

原创 UVA Don't Get Rooked （DFS回溯）

Don't Get Rooked In chess, the rook is a piece that can move any number of squares vertically or horizontally. In this problem we will consider small chess boards (at most 44) that can

2015-01-23 21:07:26 603

原创 UVA Getting in Line （DFS回溯）

Getting in Line Computer networking requires that the computers in the network be linked.This problem considers a ``linear" network in which the computers are chained together so

2015-01-23 21:02:55 526

原创 UVA Knight Moves （简单BFS）

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

2015-01-22 17:18:39 771

原创 UVA Ordering Tasks （经典拓扑排序）

题意：n个任务，m组数据，每组数据输入x，y代表如果想要完成y任务需要先完成x任务，最后输出任务的完成顺序。经典的拓扑排序。代码：#include#include#include#include#include#includeusing namespace std;int map[105][105];int num[105];int n

2015-01-22 17:14:37 763

原创 UVA Morning Walk（判欧拉回路）

题意： Kamal每天早上都要从A点走到B点。从A点到B点有很多条路，他每天早上都要先选择好一条路线，这条路线从A点走到B点，再从B点走回A点。这条路线不能重复地经过同一条路。两个地点间可能会有多条路。比如多次出现了从A到B的路线, 那么表示每次出现的都是不同的路并查集做法：#include#include#include#include#inclu

2015-01-22 17:06:15 728

原创 UVA The Necklace （并查集判断欧拉回路）

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

2015-01-22 16:57:09 729

原创 UVA Play on Words

题意：按照一个单词的最后一个字母和另一个字母的第一个字母就可以相连，是否可以实现把所有的单词按照这种方式连接起来（第一个单词的首字母可以不与最后一个单词的最后一个字相同）能实现输出Ordering...，不能实现输出The ......#include#include#include#include#include#includeint map

2015-01-22 16:50:46 599

原创 UVA Bicoloring （交叉染色）

题意：输入n个点，m组数据，然后有两种不同的颜色，n个点可能相互相邻。要求相邻的两个点不能用一种颜色，问是否可以做到，可以做到输出代码：#include#include#include#include#include#include#includeusing namespace std;int n,m;int map[205][205];int v[205]

2015-01-22 16:42:19 892

原创 UVA The Monocycle（BFS 4种状态）

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 a

2015-01-22 16:25:58 733

原创 UVA Birthday Cake （一条直线平分草莓）

Problem G. Birthday Cake BackgroundLucy and Lily are twins. Today is their birthday. Mother buys a birthday cake for them.Now we put the cake onto a Descartes coordinate. Its cen

2015-01-22 16:15:17 1090

原创 UVA XYZZY（最短路方法）

DescriptionProblem D: XYZZYADVENT: /ad´vent/, n.The prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer-refe

2015-01-20 18:49:57 594

原创 UVA Dungeon Master （三维BFS）

Dungeon Master You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute

2015-01-20 18:47:27 612

原创 UVA Slash Maze（BFS）

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

2015-01-20 17:25:01 873

原创 UVA The die is cast （BFS）

The die is cast 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

2015-01-20 17:20:34 509

原创 UVA Oil Deposits （BFS）

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 cre

2015-01-20 17:16:37 665

原创 UVA Uniform Generator

Uniform Generator Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formwhere `` " is the modulus ope

2015-01-19 12:22:18 641

原创 UVA The Other Two Trees

The Other Two TreesInput: standard inputOutput: standard outputTime Limit: 2 seconds You have a quadrilateral shaped land whose opposite fences are of equal length. You have four neighbors w

2015-01-19 12:21:16 582

原创 UVA ClockHands （时针分针求夹角）

ClockHands The medieval interest in mechanical contrivances is well illustrated by the development of the mechanical clock, the oldest of which is driven by weights and controlled by a v

2015-01-19 12:17:19 706

原创 UVA Inscribed Circles and Isosceles Triangles

Inscribed Circles and Isosceles Triangles Given two real numbersBthe width of the base of an isosceles triangle in inchesHthe altitude of the same isosceles triangle in inches

2015-01-19 12:13:59 596