Occult

Doctor Ghee is teaching Kia how to calculate the sum of two integers. But Kia is so careless and alway forget to carry a number when the sum of two digits exceeds 9. For example, when she calculates 4

1038. Recover the Smallest Number (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Given a collection of number s

1037. Magic Coupon (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue The magic shop in Mars is offering some magic

Description Now you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i<j≤|n|, here |

Description A burglar got into a matches warehouse and wants to steal as many matches as possible. In the warehouse there are m containers, in thei-th container there are ai matchboxes, and each

1033. To Fill or Not to Fill (25) 时间限制 10 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 ZHANG, Guochuan With highways available, drivi

Description A dartboard is a disc divided into n segments, with each segment labeled with a distinct positive integer between 1 and n. That integer indicates the score for hitting the segment. To m

Problem Description There are n soda conveniently labeled by 1,2,…,n. beta, their best friends, wants to invite some soda to go hiking. The i-th soda will go hiking if the total number of sod

Problem Description There are n soda sitting around a round table. soda are numbered from 1 to n and i-th soda is adjacent to (i+1)-th soda, 1-st soda is adjacent to n-th soda. Each so

1046. Shortest Distance (20) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue The task is really simple: given N exits

1070. Mooncake (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Mooncake is a Chinese bakery product traditionall

Description Given a simple undirected graph G with n vertices and m edges, your task is to select a sub-bipartite graph of G with at least m/2 edges. In the mathematical field of graph theory, a

There are two horizontal lines on the XoY plane. One is y 1 = a, the other is y 2 = b(a 1, there are N points from left to right, the x-coordinate of which are x = c 1, c 2, ... , c N (c 1 2 N) resp

1125. Chain the Ropes (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Given some segments of rope, you are suppo

Though ZCC has many Fans, ZCC himself is a crazy Fan of a coder, called "Memset137".  It was on Codefires(CF), an online competitive programming site, that ZCC knew Memset137, and immediately became

As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs: a big one, a medium one and a small one. Sergey's tw

Problem Description Luras is fond of playing games. Once she gets free, she might try playing games such as dato and cf. However, if you have read the past problems, you will know that luras is

每一个正整数都可以表示成m = An-1(n-1)! + An-2(n-2)! + An-3(n-3)! + ... + A1, (0 你能帮帮他吗?  Input输入首先给出一个N, 代表有N个测试实例。  接下来的N行, 每行包括一个正整数M (1 Output对于每个测试实例输出min(An-1 + An-2 + .. + A1).  Sample Input

把总质量为1kg的水分装在n个杯子里，每杯水的质量均为(1/n)kg，初始温度均为0℃。现需要把每一杯水都烧开。我们可以对任意一杯水进行加热。把一杯水的温度升高t℃所需的能量为(4200*t/n)J，其中，“J”是能量单位“焦耳”。如果一旦某杯水的温度达到100℃，那么这杯水的温度就不能再继续升高，此时我们认为这杯水已经被烧开。显然地，如果直接把水一杯一杯地烧开，所需的总能量为(4200*100)

Problem Description ZZX has a sequence of boxes numbered 1,2,...,n. Each box can contain at most one ball. You are given the initial configuration of the balls. For 1≤i≤n, if the i-th box

Problem Description Teacher Mai is in a maze with n rows and m columns. There is a non-negative number in each cell. Teacher Mai wants to walk from the top left corner (1,1) to the bottom rig

Problem Description Xuejiejie is a beautiful and charming sharpshooter. She often carries n guns, and every gun has an attack power a[i]. One day, Xuejiejie goes outside and comes across m 

Watering Grass Input: standard input Output: standard output Time Limit: 3 seconds n sprinklers are installed in a horizontal strip of grass l meters long and w meters wide. Each sprinkler is

Problem A Bit Mask Time Limit 1 Second In bit-wise expression, mask is a common term. You can get a certain bit-pattern using mask. For example, if you want to make f

Problem C Graph Construction Time Limit 2 Seconds Graph is a collection of edges E and vertices V. Graph has a wide variety of applications in computer. There are dif

http://uva.onlinejudge.org/external/101/10132.pdf 简单来说就是有很多一样的被切成两片，现在给你碎片，问原来的样子。 按长度排个序，把最短的和最长的拼起来试一试就好了。输入处理要弄好 #include #include #include #include #include #include #include #include

4thIIUCInter-University Programming Contest, 2005 A Children’s Game Input: standard input Output: standard output Problemsetter: Md. Kamruzzaman There

Evil Straw Warts Live A palindrome is a string of symbols that is equal to itself when reversed. Given an input string, not necessarily a palindrome, compute the number of swaps necessary to transf

http://uva.onlinejudge.org/external/100/10020.pdf 给定n条线段，问最少用几条可以覆盖0到M。按左端排序，每次选最长的（贪心） #include #include #include #include #include #include #include using namespace std; const int maxn =

Description All programmers of Mocrosoft software company are organized in a strict subordination hierarchy. Every programmer has exactly one chief, except Bill Hates who is also the head of the co

The Trip, 2007 A number of students are members of a club that travels annually to exotic locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadelphia, San

How am I ever going to solve this problem?" said the pilot. Indeed, the pilot was not facing an easy task. She had to drop packages at specific points scattered in a dangerous area. Furthermore

An army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two ants meet they t

Description A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, financial tickers, on-line auctions, and transaction logs such

Problem Description There are n soda living in a straight line. soda are numbered by 1,2,…,n from left to right. The distance between two adjacent soda is 1 meter. Every soda has a teleporter. Th

Problem Description Today is the 1st anniversary of BestCoder. Soda, the contest manager, wants to buy a souvenir for each contestant. You can buy the souvenir one by one or set by set in the shop.

Description Adam and Eve play a card game using a regular deck of 52 cards. The rules are simple. The players sit on opposite sides of a table, facing each other. Each player gets k cards from th

Description A factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers in the square

Description 风风最近迷上了一个打飞机游戏——《雷霆战机》，战机分为白二星、绿三星、蓝四星、紫五星，四种品质。当然，最厉害的是紫色五星的战机啦。 战机分为升级和进阶两种。 升级：提升战机的等级，但战机品质不变。 进阶：可将战机提升一个星级（白二星->绿三星->蓝四星->紫五星）。 为了简化问题，规定战机进阶规则如下： 白色二星： 起始等级Lv1级，满级Lv2

Problem Description Bob is very interested in the data structure of a tree. A tree is a directed graph in which a special node is singled out, called the "root" of the tree, and there is a unique p