task stringlengths 0 154k | __index_level_0__ int64 0 39.2k |
|---|---|
Lineland Airport (LINELAND)
Lineland is a strange country. As the name suggests, it's shape (as
seen from above) is just a straight line, rather than some
two-dimensional shape. The landscape along this line is very
mountainous, something which occasionally leads to some problems. One
such problem now occurs: in ... | 31,200 |
Leonardo Notebook (LEONARDO)
— I just bought Leonardo's secret notebook!
Rare object collector Stan Ucker was really agitated but
his friend, special investigator Sarah Keptic was unimpressed.
— How do you know it is genuine?
— Oh, it must be, at that price. And it is written in the
da Vinci code.
Sarah br... | 31,201 |
Mice and Maze (MICEMAZE)
A set of laboratory mice is being trained to escape a maze. The maze is made up of cells, and each cell is connected to some other cells. However, there are obstacles in the passage between cells and therefore there is a time penalty to overcome the passage Also, some passages allow mice to go... | 31,202 |
Project File Dependencies (PFDEP)
Project managers, such as the UNIX utility
make
, are used to maintain large software projects made up from many components. Users write a
project file
specifying which components (called
tasks
) depend on others and the project manager can automatically update the components in t... | 31,203 |
No Change (NOCHANGE)
Though it might be hard to imagine, the inhabitants of a small country Additivia do not know of such thing as change, which probably has to do with them not knowing subtraction either. When they buy something, they always need to have the exact amount of addollars, their currency. The only other o... | 31,204 |
Making Waves (MKWAVES)
Suppose we know a signal is generated by the function x sin (
f
1
t
) + sin (
f
2
t
). F1 and f2 are two unique
frequencies, each having an integral value in the range 400 to 600 Hz (Hz = cycles per second), and t
represents time. In this problem, you will be given N samples of this function a... | 31,205 |
Making Pals (MKPALS)
A
palindrome
is a sequence that is the same when read forward or backward. For example, “pop” is a
palindrome, as are “Poor Dan is in a droop” (ignoring spaces and case), and “12321”.
In this problem, you are to find the “cheapest” way to transform a sequence of decimal digits into a
pal... | 31,206 |
Making Money (MKMONEY)
A trick sometimes used by parents to teach their children the value of money is to give then a penny – just
a penny! – and the promise that for each day they don’t spend it, the parent will double it. All students of
computing know that long before a month has elapsed without spending a cent, ... | 31,207 |
Making Mountains Out Of Molehills (MKMOOM)
A macro processor is a symbol processing program. It takes a stream of characters as its input, and
produces a stream of characters as its output. A “macro” is similar to ordinary function in that it has a
definition, and when invoked, that definition is applied to the argu... | 31,208 |
Making Labels (MKLABELS)
Trees comes in many varieties other than the popular binary tree. In general, a tree is a connected acyclic
graph. That is, it consists of some number of vertices N (which we’ll assume is at least one in this problem),
and N – 1 edges, each of which connects a pair of vertices.
A “labe... | 31,209 |
Making A Budget (MKBUDGET)
A company uses temporary employees (“temps”) to handle its varying workloads. By doing so, it avoids having
to pay for benefits normally provided to its permanent employees. However, the company must pay an
employment agency a fixed fee for each temp they hire, as well as paying the temp a... | 31,210 |
Accumulate Cargo (ACARGO)
A cargo shipment containing N (1 ≤
N
≤ 10
5
) boxes, has just arrived and it requires some regrouping. All the cargo is currently placed on a long circular conveyor belt of length
L
metres (1 ≤
L
≤ 10
9
), which you can control and perform the following operations.
Rotate the wheel ... | 31,211 |
Burrows Wheeler Precompression (BWHEELER)
The
Burrows-Wheeler transform
(
BWT
, also called
block-sorting compression
), is an algorithm used in data compression techniques such as bzip2. It was invented by Michael Burrows and David Wheeler.
When a character string is transformed by the BWT, none of its character... | 31,212 |
Cool Numbers (COOLNUMS)
Cool numbers are those, whose digits can be partitioned into two sets such that the sum of the digits in either sets are equal.
Example: 23450 is cool because 3+4+0 = 2+5; So is 91125;
The numbers 567, 34523 are not cool, since there is no such digit partition.
Write a program that pri... | 31,213 |
Dragon Curves (DRAGONCU)
Define
r(s)
to be the complement of the reverse of the binary string
s
. i.e. Reverse
s
and then convert all 1's to 0's and all 0's to 1's.
Further define a sequence of binary string as follow: s
0
= 1 and s
n
= s
n-1
1r(s
n-1
). i.e.
s
0
= 1
s
1
= 110
s
2
= 1101100
s
3
=... | 31,214 |
Enrich my purse (EPURSE)
Jack plays this ball game for the first time in his club. Jack has a ball, which bounces with a width of
W
. Coins are arranged on a straight line at regular intervals. If the ball strikes the i-th coin, Jack gains
money
[i] (which could possibly be negative). Jack can take at most
B
turns... | 31,215 |
Farmers Cattle (FCATTLE)
Farmer john owns a single cow and he loves it a lot. The cow has a disease and is going to die. To survive, the cow needs medicine of a particular type each day. Let us say the cow needs
medicine
[i] to survive the i
th
day. (medicine[i] will be terminated by -1, which is an unavailable medi... | 31,216 |
Game Time (GAMETIME)
Jack has got a new game of Super Mario recently. There are
n
castles in the game, and Princess Peach has been kidnapped by the King Koopa and enjailed in castle n - 1 (0-based). The King Koopa has Son Koopas, and the Son Koopas has Grandson Koopas, and the Grandson Koopas has Great-Grandson Koop... | 31,217 |
Hanoi Calls (HANOICAL)
Theory:
Towers of Hanoi is an arrangement consisting of three pegs and
N
discs of radius 1 to
N
.
Each peg can hold zero or more discs, but at any point of time, the radius of the discs must be in decreasing order from bottom to top.
A move consists of moving the topmost disc from one... | 31,218 |
Instruction Decoder (ICODER)
Mathews uses a brand new 16-bit instruction processor. (Yeah i am being sarcastic!). It has one register (say R) and it supports two instructions:
ADD X; Impact: R = (R + X) mod 65536
MUL X; Impact: R = (R * X) mod 65536
[For both instructions 0 <= X <= 65535]
Mathews sees a s... | 31,219 |
Rectangles (RECTANGL)
You are given a set
S
of
N
points in the plane and must count the number of distinct axis-parallel rectangles whose four vertices all lie in
S
(that is, count those rectangles which have two sides parallel to the
x
-axis, and the other two sides parallel to the
y
-axis).
Input
The f... | 31,220 |
Roman Roads (ROMANRDS)
Some 2000 years ago the Roman Empire covered a large part of Europe including the entire coast of the Mediterranean. The transportation network of that empire
consisted of roads and sea routes (the two are considered equivalent and simply called roads for this problem). Each road connected exac... | 31,221 |
Circles (CIRCLES)
Little Gary plays the following video game. Circles pop up on the screen and disappear from it. When the screen flashes, Gary can draw a straight line on the screen and win as many points as there are circles intersected by the line. As a born-to-be-winner, Gary wants to maximize his score. Please, h... | 31,222 |
Image Projections (IMGPROJ)
Given an image
I
with
N
columns and
M
rows, a diagonal projection is the vector (
d
1
,
d
2
, ...,
d
M+N-1
) where
d
i
= Σ
x+y-1=i
I(x,y)
.
Here
I(x,y)
,
1
≤
x
≤
N
,
1
≤
y
≤
M
, is the image intensity (a non-negative integer less than 256) at column
x
and row
y
.
... | 31,223 |
Tree cut (MMCUT)
You are given a tree (a connected, acyclic graph) along with a set of
commodities
, i.e. pairs of vertices, (
s
1
,
t
1
),...,(
s
m
,
t
m
) (
s
i
≠
t
i
). A
multicut
is a set of edges that when removed disconnects
s
i
from
t
i
for all
i
. There is a unique path
P
u,v
between every pair... | 31,224 |
Set Cover (SETCOV)
In the set cover problem there is a collection
C =
{S
1
, ...,S
m
}
of subsets of the universe [
n
] =
{0, ...,n-1}
,
and one must
find a minimum-sized subcollection of
C
that still covers
[
n
] (it may be the case that
S
i
and
S
j
contain the exact same
elements for some
i
≠
j
). ... | 31,225 |
Ski Valley (SKIVALL)
The Society of Sport of New Hampshire has decided to build a new attraction in White Mountains. For the first time, the world will see a ski-valley, a ski path that goes downhill then uphill. They believe that skiers can gain enough speed from going down in the first part in order to climb up the ... | 31,226 |
Another Continuous Fractions Problem (ACFRAC)
The problem description is the same as the problem
CFRAC
and
CFRAC2
.
Input & Output
Multiple test cases, a single line with a single uppercase character C indicates the end of the input. The number of test cases will be less than 1000.
For each test case:
The ... | 31,227 |
Boxes (Hard) (BOX)
There are n boxes on the circle. The boxes are numbered from 1 to n in clock wise order. There are balls in the boxes, and the number of all the balls in the boxes is not greater than n.
The balls should be displaced in such a way that in each box there remains no more than one ball. In one move w... | 31,228 |
Random Number Generator (RNG)
LoadingTime got a RNG (
Random Number Generator
) from his classmate several weeks ago. And he spent a lot of time study it. He found that RNG can generate a real number in range [-
S
,
S
] by executing following steps. First RNG generates n integer
X
1
...
X
n
, the sum of which is e... | 31,229 |
Minus Operation (MINUS)
There are
n
integer numbers listed in one line. Every time you can arbitrarily choose two neighboring integers, kick them out and write down the result of the first number subtract the second number instead. Now, you want to get number
m
after you perform this operation
n-1
times.
Input... | 31,230 |
Load Balancing (BALIFE)
SuperComputer Inc. have built a super-fast computer server consisting of N hyper-scalar lightning-fast processors Beta 007. These processors are numbered from 1 to N and are used to process independent jobs. Every new incoming job is assigned to an arbitrary processor. Sometimes, a processor ma... | 31,231 |
Another Very Easy Problem! WOW!!! (COUNT)
Background
This problem is somewhat easier than the problem
A Very Easy Problem!
because of the super long time limit...
Description
Assurance Company of Moving (ACM) is a company of moving things for people. Recently, some schools want to move their computers to anoth... | 31,232 |
Dab of Backpack (BACKPACK)
One day Blue Mary goes to a nearby supermarket to buy some goods. She has a backpack, whose capacity is
V-Max
. She finds that there are many goods in the market, each has a volume
V
i
(it will always be a multiple of 10 and less than 10000) and an importance
C
i
(1<=
C
i
<=5). Since s... | 31,233 |
Cryptography (CRYPTO)
Your task is to work as a cryptographer for some time, the reason is ...
Blue Mary has set a problem using English. Since the problem is too easy and it will be boring when solving it, she has deleted all the whitespaces and punctuations in the original problem description, and lowercased all t... | 31,234 |
The Rolling Ball (ROLLBALL)
A solid spherical ball of radius
R
rolls without slipping on the inside surface of a fixed cone, whose tip points downward. The half-angle at the
vertex of the cone is
u
. Initial conditions have been set up so that the ball travels around the cone in a horizontal circle of radius
l>R
... | 31,235 |
Truth Or Lie (TRUTHORL)
Suppose you have
m
yes or no questions that you want to ask
n
people. You are allowed to ask each person exactly
two different questions. He/she will answer exactly one of them correctly and one of them incorrectly, you don't know which
is a correct answer and which is an incorrect one. G... | 31,236 |
One Instruction Computer Simulator (ONEINSTR)
A computer with only one instruction!
The instruction is:
SUBLEQ A B C
This means: subtract the value in M(A) from M(B) and store it in M(B); if the result is non-positive jump to the instruction in position C. M(i) represents the value stored in memory positio... | 31,237 |
Please help You-Know-Who (YKH)
Background
Poor You-Know-Who was out of business for quite some time,
being neither dead, nor alive. He would like to get rich so that
he can run for the post of Minister of Magic. From there he could
unfold at least some of his evil plots even if he lost most of
his magical powers... | 31,238 |
Rectangle Tiling (TILING)
We say that a 2-dimensional, rectangular word w of size n × m (imagine it as a board with letter written in the squares) can be tiled with a rectangular pattern p if there are such occurrences of p in w (but not necessarily all of them) that no two of them overlap and each symbol (square) of ... | 31,239 |
Stone Removing Game (REMGAME)
Consider the following game. The game is played on a 5 x 5 board. Initially every array cell has a piece
in it. Two players remove pieces alternatively from the board. The player can remove any number of consecutive pieces in a row or column.
For example, in the... | 31,240 |
Strange Billboard (CERC07B)
The marketing and public-relations department of the Czech Technical University has designed
a new reconfigurable mechanical Flip-Flop Bill-Board (FFBB). The billboard is a regular two-
dimensional grid of R × C square tiles made of plastic. Each plastic tile is white on one side and
bla... | 31,241 |
Cell Phone (CERC07C)
Nowadays, everyone has a cellphone, or even two or three. You probably know where their
name comes from. Do you. Cellphones can be moved (they are "mobile") and they use wireless
connection to static stations called BTS (Base Transceiver Station). Each BTS covers an area
around it and that area... | 31,242 |
Hexagonal Parcels (CERC07H)
A civil engineer that has recently graduated from the Czech Technical University encountered
an interesting problem and asked us for a help. The problem is more of economical than
engineering nature. The engineer needs to connect several buildings with an infrastructure.
Unfortunately, t... | 31,243 |
Key Task (CERC07K)
The Czech Technical University is rather old - you already know that it celebrates 300 years
of its existence in 2007. Some of the university buildings are old as well. And the navigation
in old buildings can sometimes be a little bit tricky, because of strange long corridors that fork
and join a... | 31,244 |
Gates of Logic (CERC07L)
The Department of Computer Science and Engineering runs courses dealing not only with algo-
rithms but also with computer hardware. One such introductory course explains basic principles
of integrated circuits ("chips"), binary logic, boolean algebra, etc. As you may know, the very
basic un... | 31,245 |
Weird Numbers (CERC07N)
Binary numbers form the principal basis of computer science. Most of you have heard of other
systems, such as ternary, octal, or hexadecimal. You probably know how to use these systems
and how to convert numbers between them. But did you know that the system base (radix)
could also be negati... | 31,246 |
Rectangular Polygon (CERC07P)
In this problem, we will help the Faculty of Civil Engineering. They need a software to analyze
ground plans of buildings. Specifically, your task is to detect outlines of a building when all of
its corners are given.
You may assume that each building is a rectangular polygon with... | 31,247 |
Reaux! Sham! Beaux! (CERC07R)
Roshambo - this simple game is known all around the world. In German, it is called "Schnick,
Schnack, Schnuck", in Japanese "Janken", in Spanish "Cachipún",in Polish "Papier, kamień, nożyce".
The Czechs call it "Kámen, nůžky, papír".
Whatever is the name of the game, its principles ... | 31,248 |
Robotic Sort (CERC07S)
Somewhere deep in the Czech Technical University buildings, there are laboratories for examin-
ing mechanical and electrical properties of various materials. In one of yesterday's presentations,
you have seen how was one of the laboratories changed into a new multimedia lab. But there
are sti... | 31,249 |
Tough Water Level (CERC07W)
Czech Technical University has the word "technical" in its name. Beside others, this means
that lectures in physics are important here. Do you still remember some of the basic physical
principles.
For example, imagine a simple glass of water. Or, we will rather call it a cup to avoid ... | 31,250 |
Minimum Distance (MINDIST)
Given an weighted tree, you are to find two nodes A and B of the tree (A and B needn't be different), such that the length of the path between A and B is less than or equals to a given integer S, and the maximum distance from each node of the tree to this path is minimum.
Input
The first... | 31,251 |
Candy I (CANDY)
Jennifer is a teacher in the first year of a primary school. She has gone for a trip with her class today. She has taken a packet of candies for each child. Unfortunately, the sizes of the packets are not the same.
Jennifer is afraid that each child will want to have the biggest packet of candies an... | 31,252 |
Last Non-Zero Digit of Factorials (FCTRL4)
Tom is fascinated by big numbers. Most of all he likes factorials. First, he computed
N!
for some small values of
N
. But factorials were getting longer and longer very quickly and each of them had a long sequence of zeroes at its end. Since he was unable to consider so ma... | 31,253 |
Number Labyrinth (LABYR2)
Fred is a robotic mouse built by a group of students of artificial intelligence. Fred can move around in the labyrinth shown in the picture below. Whenever Fred comes to a place marked by a number, he has to choose one of the possible directions. Behavior of the mouse should look chaotic and ... | 31,254 |
Rain (RAIN3)
Doctor Jones is a famous archeologist. He did some research on the Tiribaki Islands recently. His most famous discovery was the Meteoronome - a machine with a yellow button used by the Tiribakian highest priest to predict the weather. The Meteoronome had been set up by the gods at the Beginning of Time. T... | 31,255 |
K-In-A-Row (KROW)
Hansel and Gretel do not listen to their teacher at school. Instead they secretly play a game called K-In-A-Row. One day in the evening they started to argue who had won more games that day. They collected all the papers they had used for playing the game and they started to count how many times each... | 31,256 |
Cake (CAKE2)
Some time ago a VERY huge cake was made in the village called Nalomena Trieska. Well, it was infinitely large and infinitely thin. For our needs it looked exactly like an infinite plane. It was not very tasty, so nobody wanted to eat it. Instead, local children started to play with it. Each of them drew o... | 31,257 |
Trolls (TROLLS)
In a secret forest, there are many trolls. They are intelligent and most of them even knows programming languages C or PASCAL. They have written many programs. With their super computers, their programs will run for a very short time and they can get the correct answer. Being an excellent programmer, y... | 31,258 |
Get Back! (GETBACK)
Somewhere deep in a desert lives a small, completely forgotten tribe N'Gubara. All the men, women and children of the tribe live with a few camels in the N'Gubara oasis (the N'Gubara people don't have great creativity when it comes to geography names). These poor people have only the N'Gubara well,... | 31,259 |
Puzzle (PUZZLE2)
Sam loves all kinds of puzzles. Recently he received a very special puzzle - a grid of N x M squares, each square is occupied either by a red or by a blue pebble. The puzzle is controlled by several buttons.
Each row of the grid has its corresponding black button. When you press a black button, a c... | 31,260 |
Candy II (CANDY2)
Little Michael loves candies. Most of all, he likes chocolate, strawberry and banana flavored ones. No wonder that he has candy bags everywhere - there are at least four bags on his table, one or two in the pockets of his jeans, and one under his bed (just in case). Each bag contains some candies of ... | 31,261 |
Pibonacci (PIB)
You might have heard of the Fibonacci numbers and of the number
pi
. If you let these two ideas
merge, a new and esoteric concept comes into being:
the Pibonacci numbers
. These can be defined for
real
x ≥ 0
by:
P(x) = 1
for
0 ≤ x < 4
P(x) = P(x-1) + P(x-pi)
for
4 ≤ x
,
... | 31,262 |
Gossipers (GOSSIPER)
Doulnee Keltchow is a small town in the middle of nowhere; what makes it so famous is the number of gossipers who live there. Every morning, each gossiper finds out a new gossip, a gossip so unique that nobody else in the town knows it. The gossipers talk, gossip and exchange rumors all day long. ... | 31,263 |
(un)Fair Play (FAIRONOT)
It is not an easy job to be a coach of a football team. Especially if you do not coach great teams like Ajax, Inter, Dynamo (ok, fill in the name of your dream team), but only a mediocre one like FC Dead Horse, playing in the second league. The season is almost over, only a few matches are lef... | 31,264 |
Golden Garden (GARDEN)
Little Jelly is playing in the Golden Garden alone. She is such a pretty girl that the Evil Uncle wants to catch her. The Evil Uncle drives his flying saucer over the Golden Garden and tries to inhale Little Jelly.
It is known that the Golden Garden is a perfect rectangle and the Evil Uncle's ... | 31,265 |
Arranging Flowers (FLOWERS)
Bratislava has a long tradition in organizing an international flower exhibition – Flora. Professor Andrew as a true flower lover visited the Flora exhibition also this year. He was pleased by the most beautiful flowers and other plants of the world – roses, orchids, magnolias, cactuses. Al... | 31,266 |
Dependency Problems (DEPEND)
We bought a brand new computer and now we would like to install an operating system. The only problem is that our chosen operating system consists of many packages and they cannot be installed in an arbitrary order. E.g. you cannot install the package tuxracer, which depends on the package... | 31,267 |
K Edge-disjoint Branchings (FOREST)
Given a directed graph, may contains repeated edges. We assume that the graph contains and only contains K edge-disjoint branchings rooted by node 0.
A branching for a graph is a set of directed edges that from a certain root (root, in this problem, is node 0) we can find one path t... | 31,268 |
Root of a Linear Equation (ROOT)
Given two nonnegative integers
a
and
b
, you are to generate the solution of the equation
b*x=a
.
Input
The number of test cases is given in the very first line. For each test case there is a single line containing two integers
a
and
b
without any leading zeroes, separated ... | 31,269 |
Candy III (CANDY3)
A class went to a school trip. And, as usually, all
N
kids have got their backpacks stuffed with candy. But soon quarrels started all over the place, as some of the kids had more candies than others. Soon, the teacher realized that he has to step in: "Everybody, listen! Put all the candies you hav... | 31,270 |
Biased Standings (BAISED)
Usually, results of competitions are based on the scores of participants. However, we are planning a change for the next year of IPSC. During the registration each team will be able to enter a single positive integer : their preferred place in the ranklist. We would take all these preferences... | 31,271 |
Counting Subsequences (SUBSEQ)
"47 is the quintessential random number,"
states the 47 society. And there might be a grain of truth in that.
For example, the first ten digits of the Euler's constant are:
2 7 1 8 2 8 1 8 2 8
And what's their sum? Of course, it is 47.
Try walking around with your eyes open.... | 31,272 |
Digital Calculator (CALCULAT)
Dan likes playing with his pocket calculator during those long, boring math classes. Just now the teacher started to talk about the factorial function.
N
factorial, denoted by
N!
, is the product of all the integers between 1 and
N
, inclusive. For example 6! = 6*5*4*3*2*1 = 720.
... | 31,273 |
Hilbert Curve (FRACTAL)
The Hilbert Mole is a small and very rare mole. The first and only specimen was found by David Hilbert
at his backyard. This mole lives in a huge burrow under the ground, and the border of this burrow forms
a Hilbert curve of n-th order (H
n
).
Figure 1. Hilbert curves, order 1 to 4.
H... | 31,274 |
Internet is Faulty (IMATCH)
David has a problem. He wants to transfer a big file through the internet from his home computer to his computer at work. The size of his file is S kilobytes.
The internet consists of N computers, numbered from 1 to N. David's home computer has the number 1 and his computer at work has th... | 31,275 |
Kruskal (KRUSKAL)
A three-headed monkey was on his (theirs?) peaceful way from his dorm to the university. He decided to use the subway. But as soon as he descended into the station, he was stopped by a strange geek with a flashlight, saying strange words...
"I am a servant of the Secret Group Order, wielder of the ... | 31,276 |
Anti-Blot System (ABSYS)
Jimmy is a hard-working pupil in his second year at primary
school. Recently he decided to convert all his notes into an
electronic version. Sadly, he found that
his math notes were full of ink blots.
He scanned the notes and sent them through his own OCR package
(yes, he coded it ... | 31,277 |
Delicious Cake (CAKE3)
Lenka likes to bake cakes since her childhood, when she has learned to bake from her mom. She soon became a cake expert able to bake chocolate cakes, apple pies, muffins, cookies, cheese cakes, tortes and many other cakes.
Recently, she has started her studies of math at Comenius University i... | 31,278 |
Here-There (HERE)
Do you know the game Here-There? I presume you don't. It's a virtual board game, so you should first learn how this virtual board looks like.
The process of making the board is remarkably simple. You start by taking a square with side of length 3
N
, divide it into nine smaller squares of equal siz... | 31,279 |
Pixel Shuffle (JPIX)
Shuffling the pixels in a bitmap image sometimes yields random looking images. However, by repeating the shuffling enough times, one finally recovers the original images. This should be no surprise, since "shuffling" means applying a one-to-one mapping (or permutation) over the cells of the image,... | 31,280 |
Towers of Powers (TOWER)
One of the many problems in computer-generated graphics is realistically modeling the "orderly randomness" of things like mountain ranges and city skylines. A new student intern at a graphics company had an idea - use fluctuations in number representations to model height. In this problem you ... | 31,281 |
Ambiguous Codes (AMCODES)
An extensive area of research in computer science is the field of communications. With computer
networks being part of everyday life of many people, the development of ways for making
networks faster, more reliable and secure is constantly needed. This practical need motivates
an extensive... | 31,282 |
Ballroom Lights (BALLIGHT)
The ICPC world finals will be held in a luxurious hotel with a big ballroom. A buffet meal will
be served in this ballroom, and organizers decided to decorate its walls with pictures of past
champion teams.
In order to avoid criticism about favouring some of those teams over others, ... | 31,283 |
Car Plates Competition (CPC)
Martin and Isa are very competitive. The newest competition they have created is about looking
at the plates of the cars. Each time one of them sees a car plate in the streets, he or she sends
to the other an SMS message with the content of that plate; the one who has seen the newest
pl... | 31,284 |
Drop the Triples (DTT)
The inhabitants of a small Caribbean island in the region known as Bermuda’s Triangle love to
spend their warm summer nights playing cards. As a tribute to the region where they live, all
of their card games have some connection to triangles. One of the most popular games in the
island is kno... | 31,285 |
Emoticons (EMOTICON)
Emoticons are used in chat and e-mail conversations to try to express the emotions that printed
words cannot. This may seem like a nice feature for many, but a lot of people find it really
annoying and wants to get rid of emoticons.
George is one of those people. He hates emoticons so bad,... | 31,286 |
Finding Seats (FSEATS)
A group of K friends is going to see a movie. However, they are too late to get good tickets,
so they are looking for a good way to sit all nearby. Since they are all science students, they
decided to come up with an optimization problem instead of going on with informal arguments
to decide w... | 31,287 |
Galou is back! (GALOU)
The famous witch is back. After killing an incredible amount of monsters in order to find a
hidden treasure, Zak Galou decided to buy vineyards in Burgundy and retired. Everything was
calm in his new life, until the day that his farm tractor stopped working.
His tractor’s engine works ba... | 31,288 |
He is offside! (OFFSIDE)
Hemisphere Network is the largest television network in Tumbolia, a small country located
east of South America (or south of East America). The most popular sport in Tumbolia,
unsurprisingly, is soccer; many games are broadcast every week in Tumbolia.
Hemisphere Network receives many r... | 31,289 |
ICPC Scoreboard (ICPCS)
Charles is the contest director for the ICPC Tumbolian regional contest. His responsibility is
ensuring the contest flows smoothly, that the contest rules are applied fairly, and, of course,
announcing the final contest ranking.
According to ICPC rules, a team with more solved problems ... | 31,290 |
Justice League (JLEAGUE)
Thirty five years ago, a group of super heroes was chosen to form the Justice League, whose
purpose was to protect the planet Earth from the villains. After all those years helping mankind,
its members are retiring and now it is time to choose the new members of the Justice League.
In ... | 31,291 |
Musical Optimization (MUSIC)
Bessie the cow used to write musical melody. A musical melody is
represented as a sequence of N (1 ≤ N ≤ 100,000) notes numbered 1..N.
Note i is represented by the integer A
i
(-10,000 ≤ A
i
≤ 10,000).
To Bessie's cow-like mind, a musical melody is called 'perfect' if and only
if t... | 31,292 |
Making Pairs (MKPAIRS)
The 2×N (3 ≤ N ≤ 1,000) cows have assembled the Bovine Accordion and Banjo Orchestra! They possess various levels of skill on their respective instruments: accordionist i has an associated talent level A
i
(0 ≤ A
i
≤ 1,000); banjoist j has an associated talent level B
j
(0 ≤ B
j
≤ 1,000).
... | 31,293 |
Tan and His Interesting Game (TAN1)
Background
Tan always creates some interesting and strange games to kill time, and the Pick-Number Game on Tree is his favorite one. He got the idea from his another game(Pick-Number Game on sequence): there is an integer sequence, he picks a number from the head or the tail of th... | 31,294 |
Balloons in a Box (BALLOON)
You must write a program that simulates placing spherical balloons into a rectangular box.
The simulation scenario is as follows. Imagine that you are given a rectangular box and a set of points. Each point represents a position where you might place a balloon. To place a balloon at a po... | 31,295 |
Undecodable Codes (UCODES)
Phil Oracle has a unique ability that makes him indispensable at the National Spying Agency. His colleagues can bring him any new binary code and he can tell them immediately whether the code is uniquely decodable or not. A
code
is the assignment of a unique sequence of characters (a
code... | 31,296 |
Crossing the Desert (DESERT)
In this problem, you will compute how much food you need to purchase for a trip across the desert on foot.
At your starting location, you can purchase food at the general store and you can collect an unlimited amount of free water. The desert may contain oases at various locations. At ea... | 31,297 |
Ferries (FERRY)
Millions of years ago massive fields of ice carved deep grooves in the mountains of Norway. The sea filled these grooves with water. The Norwegian people call them fjords. This landscape of mountains and water is beautiful, but it makes traveling difficult. The usual scheme is: drive some kilometers, w... | 31,298 |
Island Hopping (ISLHOP)
The company Pacific Island Net (PIN) has identified several small island groups in the Pacific that do not have a fast internet connection. PIN plans to tap this potential market by offering internet service to the island inhabitants. Each groups of islands already has a deep-sea cable that con... | 31,299 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.