task stringlengths 0 154k | __index_level_0__ int64 0 39.2k |
|---|---|
Xtreme Driving
Description:
Alice, one of the IEEEXtreme participants, is on her way to
her university to take part in this year’s contest. To get to
the university she has to drive on a four lane highway, but as
the highway is very long she quickly becomes bored. She decides
to practice for the contes... | 30,600 |
YATP
Description:
This is Yet Another Tree Problem. You are given a tree,
where every node has a penalty and every edge has a weight. The
cost of a simple path between any two nodes is the sum of the
weights of the edges in the path, plus the product of the
penalties of the endpoint nodes. Note that a ... | 30,601 |
Yes, Yes, It's Nonograms
Description:
Nonograms (also known as Paint by Numbers or Hanjie) is a
logic puzzle which encodes a black-and-white picture using
sequences of numbers. The object of the puzzle is to recreate
the picture from the numbers. The puzzle initially consists of
a blank $n \times m$ gr... | 30,602 |
Yet Another Divisor Problem
Description:
There have been many problems involving divisors. This is
yet another one.
## Input
The input consists of a single line containing two
space-separated positive integers, $a$ and $b$, satisfying $a\leq b\leq 10^8$.
## Output
Output a single integer: the number of odd... | 30,603 |
Yet Satisfiability Again!
Description:
## Input
The first line of input contains a single integer, not more
than $5$, indicating the
number of test cases to follow. The first line of each test
case contains two integers $n$ and $m$ where $1 \le n \le 20$ indicates the number
of variables and $1 \le m ... | 30,604 |
Yikes - Bikes!
Description:
In recent years the riders in the Tour de France bicycle
race have been having problems with dogs running in the road,
causing expensive damage to bicycles and serious injuries to
riders. In this problem you will take the point of view of a
dog named Max. Just as the peloton... | 30,605 |
Yin and Yang Stones
Description:
A mysterious circular arrangement of black stones and white
stones has appeared. Ming has been tasked with balancing the
stones so that only one black and one white stone remain.
Ming has two operations for balancing the stones:
* Take some consecutive sequence of stones wher... | 30,606 |
Yoda
Description:
A long, long time ago in a galaxy far, far away a big
collision of integers is taking place right now. What happens
when two integers collide? During collision, each digit of one
number compares itself to the corresponding digit of the other
number (the least significant digit with th... | 30,607 |
You Be the Judge!
Description:
Congratulations! You are now the judge of a programming
contest! You’ve been put in charge of a problem, and since your
problem may not have unique correct output, you’ve got to write
an output checker for it.
Your problem is called “Good as Goldbach”, and it’s based on
... | 30,608 |
You be The Judge, Again
Description:
You are a judge, again! The contest you’re judging includes
the following problem:
Your team is to write a checker for this problem. Validation
of the input values and format has already taken place. You
will be given a purported tiling of a $2^ n$ by $2^ n$ grid, wher... | 30,609 |
Yule Lads
Description:
The kids in Iceland are pretty lucky. Not only do they have
one Santa Claus, but $N$
of them! They’re called the Yule Lads, and on each of the
$N$ nights before
Christmas, one of them comes to town, giving those that have
been nice a small present, and those that have been na... | 30,610 |
Zabava
Description:
A new student dorm has been opened! It consists of
$M$ buildings, labeled
with integers from $1$ to
$M$. The dorm is initially
empty, but soon $N$
students will be moving in at a rate of exactly one student per
day.
Each time a new student moves in a building, a big party i... | 30,611 |
Zadaca
Description:
Mirko has received a homework assignment to compute the
greatest common divisor of the two positive integers
$A$ and $B$. Since the numbers are quite
large, the teacher provided him with $N$ smaller integers whose product is
$A$, and $M$ integers with product $B$.
Mirko would like ... | 30,612 |
Zagrade
Description:
Mirko was bored at his chemistry class, so he played Bomb
Switcher on his cell phone. Unfortunately, he was spotted and
was given a ridiculously heavy assignment for homework. For a
given valid math expression with brackets, he must find all
different expressions that can be obtain... | 30,613 |
Zamka
Description:
The impossible has happened. Bear G. has fallen into his own
trap. Lured by a delicious box of Domaćica, without even
thinking, he rushed and fell into his trap. In order to get out
of the trap, he must solve the following task with your help.
You are given three integers $L$, $D$ an... | 30,614 |
Zapis
Description:
A regular bracket-sequence is a string of characters
consisting only of opening and closing brackets, and satisfying
the following conditions:
* An empty string is a regular bracket-sequence.
* If $A$ is a regular
bracket-sequence, then ($A$), [$A$]
and {$A$} are also regul... | 30,615 |
Zbrka
Description:
Consider a sequence of $N$ integers where each integer
between $1$ and
$N$ appears exactly
once.
A pair of numbers in the sequence is confused if
the number that comes earlier in the sequence is larger than
the later number.
The confusion of the sequence is the number of confus... | 30,616 |
Zebras and Ocelots
Description:
## Input
Input consists of a number $N$ in the range $1$ to $60$, followed by $N$ lines, each of which is a single
character, either Z (for zebra) or
O (for ocelot). These give the order of the
creatures from top (first) to bottom (last).
## Output
Output should be a sing... | 30,617 |
Zerg Rush!!!
Description:
A typical strategy in the game Starcraft is to mass up large
amounts of low-tier units such as Zerglings, then throw them at
your opponent and laugh maniacally as they overwhelm any
opposition. However, when both players opt for the same
strategy, the result can often become..... | 30,618 |
Zgodan
Description:
An integer is considered handsome if every two of its
consecutive digits are of different parity. For a given integer
$N$, what is its closest
handsome number?
Please note: numbers consisting of only one digit are
handsome numbers. The distance of two numbers is the absolute
va... | 30,619 |
Zig Zag Nametag
Description:
When ninjas go to conferences they wear fake nametags. One
ninja in particular wants to impress his Sensei. His Sensei
chooses a new favorite number every day. The pupil wants to put
a name on his nametag that encodes his Sensei’s favorite
number! This name will consist of ... | 30,620 |
Zigzag
Description:
A sequence of integers is said to Zigzag if
adjacent elements alternate between strictly increasing and
strictly decreasing. Note that the sequence may start by either
increasing or decreasing. Given a sequence of integers,
determine the length of the longest subsequence that
Zi... | 30,621 |
Zipf's Law
Description:
Harvard linguistics professor George Kingsley Zipf
(1902-1950) observed that the frequency of the $k$th most common word in a text is
roughly proportional to $1/k$. He justified his observations
in a book titled Human behavior and the principle of least
effort published in 1949.... | 30,622 |
Zipf's Song
Description:
At first, you figure that the most listened to songs must be
the best songs. However, you quickly realize that this approach
is flawed. Even if all songs of the album are equally good, the
early songs are more likely to be listened to more often than
the later ones, because mon... | 30,623 |
Zipline
Description:
A zipline is a very fun and fast method of travel. It uses a
very strong steel cable, connected to two poles. A rider (which
could be a person or some cargo) attaches to a pulley which
travels on the cable. Starting from a high point on the cable,
gravity pulls the rider along the ... | 30,624 |
Znanstvenik
Description:
In this economy, we all know how hard it is to get a job.
Mirko, a recent college graduate, however, got lucky – he is
now employed as a runeologist by the Language Institute of
Croatia. His friend Slavko believes runeology isn’t a science
and is hence angry at Mirko for believ... | 30,625 |
Zoning
Description:
A town is often divided into zones, e.g, industrial zones,
commercial zones, and residential zones. If some residential
zone is very far from all commercial zones, then the people
living there will have a long journey whenever they want to do
some shopping, and this is undesirable.
... | 30,626 |
Zoning Houses
Description:
Given a registry of all houses in your state or province,
you would like to know the minimum size of an axis-aligned
square zone such that every house in a range of addresses lies
in the zone or on its border. The zoning is a bit lenient and
you can ignore any one house from ... | 30,627 |
Zoo Management
Description:
The way you move animals is by using special tunnels that
connect the enclosures — you do not want the animals to move
outside, both because of the risk that they will be scared, and
because of the risk that they might run away and hurt
themselves.
Unfortunately, you have a... | 30,628 |
Zoom
Description:
To determine whether your company is successful, your boss
has to look at a long list of numbers! So many numbers, in
fact, that they need some way to simplify the data. You came up
with the idea to summarize the list by “zooming out”. How do
you zoom out? Just discard everything exce... | 30,629 |
Zuma
Description:
One day Mirko, while he was walking through the high grass,
stumbled upon a sequence of $N$ colored marbles. Soon he noticed
that if he touches $K$ or
more consecutive marbles of the same color, they start to
twinkle and then he could wish them to magically vanish,
although he doe... | 30,630 |
Zyxab
Description:
You ask your friend for a list of names and tell him you
will pick the best one, defining the best one to be the
shortest word, with ties being broken by which name is larger
alphabetically. You furthermore require the name to be at least
five characters long and that it has no repea... | 30,631 |
basic
Description:
The programming language Ada has integer constants that look
like this: 123, 8#123#, 16#abc#.
These constants represent the integers $123$, $83$ (123
base $8$) and $2739$ (abc
base $16$). More
precisely, an integer may be a decimal integer given as a
sequence of one or more d... | 30,632 |
e-Coins
Description:
At the Department for Bills and Coins, an extension of
today’s monetary system has newly been proposed, in order to
make it fit the new economy better. A number of new so called
e-coins will be produced, which, in addition to having a value
in the normal sense of today, also have a... | 30,633 |
iBoard
Description:
After years of success with a single-button mouse, a well
known computer company has decided to offer a similarly
simplified interface for the keyboard. The iBoard has only two
keys. The user types by entering the ASCII code for each
letter. To help people type faster, the iBoard us... | 30,634 |
iCar
Description:
You are at home and about to drive to work. The road you
will take is a straight line with no speed limit. There are,
however, traffic lights precisely every kilometer, and you can
not pass a red light. The lights change instantaneously between
green and red, and you can pass a light ... | 30,635 |
if-then-else
Description:
Saladin loves to make computers and languages. This time, he
has made a CPU that works on $12$-bit words, and created his own
language called Salang on top of it. The language itself works
well, except for one weird bug. To fix the problem, he has
designed a decompiler: A prog... | 30,636 |
ilove Strings
Description:
It’s that time of year when love is in the air. You’re no
stranger to love. You are obsessed with strings but not just
any strings. You love “ilove” Strings. An “ilove” String is a
string of length 5 with the following properties:
* Alternates between vowels (excluding ‘y’ and ‘... | 30,637 |
jigsawpuzzle
Description:
Is it possible to construct a puzzle from a specified set of
identically dimensioned square blank pieces, other than for the
number and position of notches and projections on the edges? We
will assume that any projection will fit into any notch.
Arbitrary rotations with either... | 30,638 |
k-Colouring of a Graph
Description:
You are given a simple graph with $N$ nodes and $M$ edges. The graph has the special
property that any connected component of size $s$ contains no more than $s + 2$ edges. You are also given two
integers $k$ and
$P$. Find the number of
$k$-colourings of the
graph... | 30,639 |
kcuD dlanoD
Description:
Oh no! Donald Duck accidentally went through Professor
Ludwig von Drake’s reversing machine, so now everything he sees
is mirror inverted.
Quack-it, this was very untimely. Scrooge McDuck namely has
a very important quest for Donald Duck. He needs Donald to
choose the biggest ... | 30,640 |
ls
Description:
You are implementing an operating system, and now need to
write a program to list files in a directory: “ls”. You want
the user to be able to list only files that match a given
pattern that can include wildcards (*), for
example *.c. A wildcard matches zero or
more characters of any... | 30,641 |
m-ary Partitions
Description:
A partition of an integer $n$ is a set of positive integers
which sum to $n$,
typically written in descending order. For example:
```
10 = 4+3+2+1
```
A partition is $m$-ary
if each term in the partition is a power of $m$. For example, the $3$-ary partitions of $9$ are:
```... | 30,642 |
nnnnn
Description:
Hsara and Simone like to communicate without anyone else
knowing what they’re saying. This time, Simone invented a very
sneaky cipher. When she wants to tell Hsara a non-negative
number $n$, she performs
the following encryption procedure.
Let $d(n)$ denote the
decimal expansion... | 30,643 |
víRUs
Description:
You have discovered a new computer virus calling itself
víRUs and it seems to have been written by a student from
Reykjavík University. The virus has now infected all the
computers at the university, but so far no one else seems to
have noticed, since it is very discreet and only mak... | 30,644 |
Á leið í bíó
Description:
Hannes and Arnar are going to the cinema. They have already
ordered their tickets online and they just ate, so they are not
stopping in the lobby for snacks and drinks. Therefore, they
will be able to enter the screening room in no time. Hannes is
still a bit unsure about when... | 30,645 |
Åboulevarden
Description:
Your study group is planning a pub crawl in the bars along
one side of the Aarhus River.
All the bars are nice and inviting, but each serves only one
kind of beer. The members of your group have different,
varying, and even conflicting preferences in beverages, so you
switch ... | 30,646 |
Ævintýraröð
Description:
Jörmunrekur was looking into his old favourite video game
called DeceitfulLOAM and discovered that not only was it
considered ancient history, but there had been three new
versions of it since he played it, two of which are also
considered ancient as well, and one of which had ... | 30,647 |
Ég elska hann
Description:
She let the flower decide whether she should talk to him.
She started by numbering the petals from $1$ to $N$ counter-clockwise, where
$N$ is the number of
petals.
She starts at petal $1$
and says “He loves me”. She leaves this petal be and moves onto
petal $2$. She then... | 30,648 |
Ég elska hann
Description:
She let the flower decide whether she should talk to him.
She started by numbering the petals from $1$ to $N$ counter-clockwise, where
$N$ is the number of
petals.
She starts at petal $1$
and says “He loves me”. She leaves this petal be and moves onto
petal $2$. She then... | 30,649 |
Órökrétt
Description:
Anna is a renowned logician. Recently she has been looking
into boolean expressions of different forms. Two common ones
are ANF (and normal form) and ONF (or normal form).
In ANF the expression is composed of one or more clauses
with ANDs between, where each clause consists of one or... | 30,650 |
Óvissa
Description:
## Input
Input consists of a single line which represents the sound
Unnar made the last time he was uncertain. There will be at
least one and at most $100\,
000$ symbols in the input.
## Output
Output one integer, Unnar’s level of uncertainty.
## Scoring
Group
Points
Constraints
... | 30,651 |
Öfugsnúið
Description:
Jóna needs a program. The program should read in integers
and print them in reverse order. Jóna asks for your help.
## Input
The first line contains the integer $n$. Then there is a list of
$n$ integers, each on
their own line. Each integer will be between $0$ and $10^9$.
## Outpu... | 30,652 |
Önnur tilgáta Goldbachs
Description:
The integer $P$ is
called prime if the only integers dividing it are $1$ and $P$ itself. As an example $20$ is not prime since it’s divisible
by $5$. On the other hand
$11$ is prime since only
$1$ and $11$ divide $11$.
There is a famous conjecture about primes, Gol... | 30,653 |
Önnur tilgáta Goldbachs
Description:
The integer $P$ is
called prime if the only integers dividing it are $1$ and $P$ itself. As an example $20$ is not prime since it’s divisible
by $5$. On the other hand
$11$ is prime since only
$1$ and $11$ divide $11$.
There is a famous conjecture about primes, Gol... | 30,654 |
Östgötska
Description:
Anders talks in the Swedish dialect of östgötska.
Unfortunately, this makes it somewhat hard to get a programming
job in the Swedish capital of Stockholm. The trendy Stockholm
hipsters only accept applicants speaking the standard Swedish
dialect, rikssvenska.
To increase his cha... | 30,655 |
Úllen Dúllen Doff 2
Description:
Lárus is a middle manager at a stellar company, He manages
$n$ members of the staff,
all of which are related to him except for one.
When a new assignment pops up, Lárus is in charge of
assigning it to a member of the staff. Lárus wants to minimise
the work his relativ... | 30,656 |
Úllen dúllen doff
Description:
Stefán Valur Hansson, also known as Svalur Handsome, is
going on an exciting adventure and can bring a single friend
with him. He doesn’t want to hurt his friends’ feelings so he
decides to use a mantra to choose someone randomly to bring
with him. He asks his $n$
fri... | 30,657 |
Þarasöfnun
Description:
Yet again certain unnamed individuals within KFFÍ are trying
to make easy cash and they heard from their engineer friends
that anything with sustainable or futuristic in the title gets
plenty of grants these days. With this in mind one of them had
the idea of building a kelp har... | 30,658 |
Þjarki
Description:
In his spare time Gunnar has programmed a small robot that
follows arrows on the floor. His floor is divided into squares
and he has put an arrow down on each square that points to one
of its four adjacent squares.
Gunnar puts the robot down on a square on the ground. The
robot loo... | 30,659 |
Šuma
Description:
Mirko lives in a big enchanted forest where trees are very
tall and grow really quickly. That forest can be represented as
an $N\cdot N$ matrix where
each field contains one tree.
Mirko is very fond of the trees in the enchanted forest. He
spent years observing them and for each tree... | 30,660 |
Žabe
Description:
The Frog Regent has arranged his $N$ frog servants in a circle, with
each frog facing the back of the next one. Each frog is
assigned a unique integer identifier (ID) from the set of
$1$ to $N$. The frog arrangement is specified
as a sequence of IDs. The sequence always starts with th... | 30,661 |
Матрёшка
Description:
Matryoshkas are sets of traditional Russian wooden dolls of
decreasing size placed one inside the other. A matryoshka doll
can be opened to reveal a smaller figure of the same sort
inside, which has, in turn, another figure inside, and so
on.
When reassembling the sets, you must ... | 30,662 |
Life, the Universe, and Everything (TEST)
Your program is to use the brute-force approach in order to
find the Answer to Life, the Universe, and Everything
. More precisely... rewrite small numbers from input to output. Stop processing input after reading in the number 42. All numbers at input are integers of one or ... | 30,663 |
Prime Generator (PRIME1)
Peter wants to generate some prime numbers for his cryptosystem. Help him!
Your task is to generate all prime numbers between two given numbers!
Input
The input begins with the number t of test cases in a single line (t ≤ 10). In each of the next t lines there are two numbers m and n ... | 30,664 |
Substring Check (Bug Funny) (SBSTR1)
Given two binary strings, A (of length 10) and B (of length 5), output 1 if B is a substring of A and 0 otherwise.
Please note, that the solution may only be submitted in the following languages: Brainf**k, Whitespace and Intercal.
Input
24 lines consisting of pairs of bina... | 30,665 |
Transform the Expression (ONP)
Transform the algebraic expression with brackets into RPN form (Reverse Polish Notation). Two-argument operators: +, -, *, /, ^ (priority from the lowest to the highest), brackets ( ). Operands: only letters: a, b ... z. Assume that there is only one RPN form (no expressions like a*b*c).... | 30,666 |
The Next Palindrome (PALIN)
A positive integer is called a
palindrome
if its representation in the decimal system is the same when read from left to right and from right to left. For a given positive integer
K
of not more than 1000000
digits
, write the value of the smallest palindrome larger than
K
to output. ... | 30,667 |
Simple Arithmetics (ARITH)
One part of the new WAP portal is also a calculator computing expressions
with very long numbers. To make the output look better, the result is
formated the same way as is it usually used with manual calculations.
Your task is to write the core part of this calculator. Given two numb... | 30,668 |
The Bulk! (BULK)
ACM uses a new special technology of building its transceiver stations. This technology is called
Modular Cuboid Architecture
(
MCA
) and is covered by a patent of Lego company. All parts of the transceiver are shipped in unit blocks that have the form of cubes of exactly the same size. The cubes ca... | 30,669 |
Complete the Sequence! (CMPLS)
You probably know those quizzes in Sunday magazines: given the sequence 1, 2,
3, 4, 5, what is the next number? Sometimes it is very easy to answer,
sometimes it could be pretty hard. Because these "sequence problems" are very
popular, ACM wants to implement them into the "Free Time" ... | 30,670 |
Direct Visibility (DIRVS)
Building the GSM network is a very expensive and complex task. Moreover,
after the
Base Transceiver Stations
(
BTS
) are built and
working, we need to perform many various measurements to determine the state
of the network, and propose effective improvements to be made.
The ACM t... | 30,671 |
Complicated Expressions (CMEXPR)
The most important activity of ACM is the GSM network. As the mobile phone
operator, ACM must build its own transmitting stations. It is very important
to compute the exact behaviour of electro-magnetic waves. Unfortunately,
prediction of electro-magnetic fields is a very complex ta... | 30,672 |
Factorial (FCTRL)
The most important part of a GSM network is so called
Base Transceiver Station
(
BTS
). These transceivers form the
areas called
cells
(this term gave the name to the cellular phone)
and every phone connects to the BTS with the strongest signal (in
a little simplified view). Of course, BTSes ... | 30,673 |
The Game of Master-Mind (MMIND)
If you want to buy a new cellular phone, there are many various types to
choose from. To decide which one is the best for you, you have to consider
several important things: its size and weight, battery capacity, WAP support,
colour, price. One of the most important things is also th... | 30,674 |
Hotline (HOTLINE)
Every customer sometimes needs help with new and unusual products. Therefore,
hotline service is very important for every company. We need a single phone
number where the customer can always find a friendly voice ready to help with
anything. On the other hand, many people are needed to serve as ho... | 30,675 |
I-Keyboard (IKEYB)
Most of you have probably tried to type an SMS message on the keypad of
a cellular phone. It is sometimes very annoying to write longer messages,
because one key must be usually pressed several times to produce a single
letter. It is due to a low number of keys on the keypad. Typical phone has
t... | 30,676 |
The Shortest Path (SHPATH)
You are given a list of cities. Each direct connection between two cities has its transportation cost (an integer bigger than 0). The goal is to find the paths of minimum cost between pairs of cities. Assume that the cost of each path (which is the sum of costs of all direct connections belo... | 30,677 |
Sphere in a tetrahedron (TETRA)
Of course a Sphere Online Judge System is bound to have some tasks about spheres.
So here is one. Given the lengths of the edges of a tetrahedron
calculate the radius of a sphere inscribed in that tetrahedron
(i.e. a sphere tangent to all the faces).
Input
Number N of test ca... | 30,678 |
The Bytelandian Cryptographer (Act I) (CRYPTO1)
The infamous Bytelandian Bit-eating Fanatic Organisation (BBFO for short) plans to launch an
all-out denial-of-service attack on the Bytelandian McDecimal's fast food
network by blocking the entrance to every restaurant with a camel (the
purpose being to rid the... | 30,679 |
The Bytelandian Cryptographer (Act II) (CRYPTO2)
Encouraged by his last successful exploit, the Bytelandian fanatic cryptographer impudently encrypted a three-digit number by subtracting 1 from it.
This time he has
really
overstepped the mark! Soldier, go and beat him, for Burger King & Country! Oh, and remember you... | 30,680 |
The Bytelandian Cryptographer (Act III) (CRYPTO3)
The Bytelandian cryptographer acknowledged he was sorely beaten in Act 2. He renounced his own methods of encryption and decided to return to the classic techniques.
Not knowing what to do next, he went to the cinema to chew the problem over. To his surprise, he fo... | 30,681 |
The Bytelandian Cryptographer (Act IV) (CRYPTO4)
The Bytelandian Cryptographer has been requested by the BBFO to put forward an encryption scheme which would allow the BBFO to communicate with its foreign associates. After some intensive studies, he has decided upon the Vigen�re cipher. Messages written using 26 upp... | 30,682 |
Triangle From Centroid (TRICENTR)
Given the length of side a of a triangle and the distances from the centroid (the point of concurrence of the medians - red in the picture) to all sides: a, b and c, calculate this triangle's area and the distance (blue line) from the orthocenter (the point of concurrence of the heigh... | 30,683 |
Pyramids (PIR)
Recently in Farland, a country in Asia, the famous scientist Mr. Log Archeo discovered ancient pyramids. But unlike those in Egypt and Central America, they have a triangular (not rectangular) foundation. That is, they are tetrahedrons in the mathematical sense. In order to find out some important facts... | 30,684 |
Small factorials (FCTRL2)
You are asked to calculate factorials of some small positive integers.
Input
An integer t, 1 ≤ t ≤ 100, denoting the number of testcases, followed by t lines, each containing a single integer n, 1 ≤ n ≤ 100.
Output
For each integer n given at input, display a line with the value of n!... | 30,685 |
Pouring water (POUR1)
Given two vessels, one of which can accommodate
a
litres of water and the other -
b
litres of water, determine the number of steps required to obtain exactly
c
litres of water in one of the vessels.
At the beginning both vessels are empty. The following operations are counted as 'steps':
... | 30,686 |
Build the Fence (BSHEEP)
At the beginning of spring all the sheep move to the higher pastures in the mountains. If there are thousands of them, it is well worthwhile gathering them together in one place. But sheep don't like to leave their grass-lands. Help the shepherd and build him a fence which would surround all t... | 30,687 |
Sorting Bank Accounts (SBANK)
In one of the internet banks thousands of operations are being performed every day. Since certain customers do business more actively than others, some of the bank accounts occur many times in the list of operations. Your task is to sort the bank account numbers in ascending order. If an ... | 30,688 |
Help the Military Recruitment Office! (HMRO)
At the end of year 2004, the regional agencies of the Polish Military Recruitment Office (known as WKU in Polish) is sending a call to all boys born in 1984. Every recruit has his personal 11-digit identification number (PESEL, format: YYMMDDXXXXX, where YYMMDD is the date ... | 30,689 |
Hash it! (HASHIT)
Your task is to calculate the result of the hashing process in a table of 101 elements, containing keys that are strings of length at most 15 letters (ASCII codes '
A
',...,'
z
').
Implement the following operations:
find the index of the element defined by the key (ignore, if no such element... | 30,690 |
Bytelandian Blingors Network (BLINNET)
We have discovered the fastest communication medium
Bytelandian scientists announced, and they called it
blingors
.
The blingors are incomparably better than other media known before. Many companies in Byteland started to build blingors networks, so the information society in... | 30,691 |
Fast Multiplication (MUL)
Multiply the given numbers.
Input
n
[the number of multiplications ≤ 1000]
l1 l2
[numbers to multiply (at most 10000 decimal digits each)]
Text grouped in [ ] does not appear in the input file.
Output
The results of multiplications.
Example
Input:
5
4 2
123 43
324 342
0... | 30,692 |
A Needle in the Haystack (NHAY)
Write a program that finds all occurences of a given pattern in a given input string. This is often referred to as finding a
needle
in a
haystack
.
The program has to detect
all
occurences of the needle in the haystack. It should take the needle and the haystack as input, and out... | 30,693 |
Trip (TRIP)
Alice and Bob want to go on holiday. Each of them has drawn up a list of cities to be visited in turn. A list may contain a city more than once. As they want to travel together, they have to agree upon a common route. No one wants to change the order of the cities on his list or add other cities. Therefore... | 30,694 |
Run Away (RUNAWAY)
One of the traps we will encounter in the Pyramid is located in the Large Room.
A lot of small holes are drilled into the floor. They look completely harmless
at the first sight. But when activated, they start to throw out very
hot java, uh ... pardon, lava. Unfortunately, all known paths to the ... | 30,695 |
Equipment Box (EQBOX)
There is a large room in the Pyramid called
Room-of-No-Return
. Its
floor is covered by rectangular tiles of equal size. The name of the room
was chosen because of the very high number of traps and mechanisms in it.
The ACM group has spent several years studying the secret plan of this room.
... | 30,696 |
Secret Code (CODE1)
The Sarcophagus itself is locked by a secret numerical code. When somebody
wants to open it, he must know the code and set it exactly on the top of the
Sarcophagus. A very intricate mechanism then opens the cover. If an incorrect
code is entered,
the tickets inside would catch fire immediately ... | 30,697 |
The Proper Key (PROPKEY)
Many people think that Tetris was invented by two Russian programmers. But that
is not the whole truth. The idea of the game is very old -- even the Egyptians had
something similar. But they did not use it as a game. Instead, it was used as
a very complicated lock. The lock was made of wood... | 30,698 |
Labyrinth (LABYR1)
The northern part of the Pyramid contains a very large and complicated labyrinth. The labyrinth is divided into square blocks, each of them either filled by rock, or free. There is also a little hook on the floor in the center of every free block. The ACM have found that two of the hooks must be con... | 30,699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.