task stringlengths 0 154k | __index_level_0__ int64 0 39.2k |
|---|---|
Drawing Circles
Description:
In his first drawing class, a professor assigned a student
to draw one circle on a rectangular paper sized $w \times h$ units. The student sat on
a comfy bench near Powell Library and was about to start
drawing when a terrible thing happened. Although it never rains
in LA, ... | 27,300 |
Dream Team
Description:
Jiro Horikoshi is a young aircraft designer who is looking
to create a team of aircraft engineers to help him design his
first airplane. He wants to build a dream team of $12$ engineers. There are $N$ engineers that he can choose from,
where the $i$-th engineer
has a skill ratin... | 27,301 |
Dreamer
Description:
Bash just woke up from his sweetest dream ever. In his
dream, he became the best Pokenom trainer — like no one ever
was. It was on the date …
Unfortunately, Bash forgot the exact date. He only
remembered that the date was written in format ‘DD MM YYYY’
with exactly $8$ digits.
... | 27,302 |
Drill Sergeant
Description:
Drill Sergeant SoCCat is known for their ability to turn raw
cat recruits into disciplined cat soldiers.
There are $n$ cat
recruits, numbered $1$ to
$n$. Cat recruit
$i$ has height
$i$ cat units.
Being cats, some of them dislike each other. In particular,
there are... | 27,303 |
Drink Menu
Description:
To widen their mixological horizons, some of your bar’s
patrons have decided to work themselves through the entire
drink menu, top to bottom, over a period of many visits. Due to
their forgetfulness, decreptitude, or levels of inebriation,
these patrons cannot be trusted with ke... | 27,304 |
Drink Responsibly
Description:
The University of Lagado is organising events for the
upcoming Fresher’s week and has been told — much to the
surprise of its staff — that some of the undergraduates may
enjoy a beer tasting. While sourcing a wide variety of drinks
for the students to taste, the universit... | 27,305 |
Drinking Song
Description:
Ninety-Nine Bottles of Beer is an anonymous folk
song dating to the mid-20th century. It is a traditional
reverse counting song, sometimes used to sing on long trips, as
it has a very repetitive format which is easy to memorize and
can take a long time to sing. The lyrics des... | 27,306 |
Drive Safely
Description:
A new stretch of road has just been built from Askøy to
Bergen. Before the road can be opened for the public, however,
a decision needs to be made as for which speed limits to
impose. The minister of transportation wants the travelling
time from Askøy to Bergen to be as small ... | 27,307 |
Driver Disagreement
Description:
Alice and Bob are travelling in Italy. They are travelling
by car and unfortunately they took a wrong turn. Now they are
stuck in the city centre of Pisa. (You may know that you need
an allowance to drive in the city centre, so they are at risk
of getting a fine.) As th... | 27,308 |
Driver's Dilemma
Description:
A car driver visiting Canada from the US travels on a road
through isolated New Brunswick territory (no gas stations,
houses, or cell phone coverage). Ominous road signs warn about
collision risks from deer and moose after dark. Suddenly the
driver glances at his fuel gaug... | 27,309 |
Drivers
Description:
## Task
A worldwide logistics company is called Loners since all of
the drivers ride alone. It is very important to the managers of
the company to be able to answer their clients quickly and
accurately about whether or not the drivers are going to
deliver their goods safely from c... | 27,310 |
Driving Lanes
Description:
While driving around a curve on the highway, Sam realizes
that if they use the inside lane, they travel a shorter
distance. Sam wonders what is the minimum distance needed to
travel to the destination.
The multilane highway consists of a sequence of
straightaways that are co... | 27,311 |
Driving Range
Description:
These days, many carmakers are developing cars that run on
electricity instead of gasoline. The batteries used in these
cars are generally very heavy and expensive, so designers must
make an important tradeoffs when determining the battery
capacity, and therefore the range, o... | 27,312 |
Driving in Optimistan
Description:
Optimistan is a strange country. It is situated on an island
with a huge desert in the middle, so most people live in port
towns along the coast. As the name suggests, people of
Optimistan (also called Optimists) like to optimise everything,
so they only built roads n... | 27,313 |
Drone Diversion
Description:
At large programming contests there are often hundreds of
participants competing. Every now and then a contestant may
need some extra energy to solve a particularly difficult
problem. Usually, this happens by ingesting some candy. As a
contest organizer, fetching candy to h... | 27,314 |
Dropping Ball
Description:
You are given a board with $M$ rows and $N$ columns. The rows are numbered
from $1$ to $M$ from top to bottom. The columns
are numbered from $1$ to
$N$ from left to
right.
In each cell of the board, there is a diagonal wall. The
wall either runs from top-left corner to b... | 27,315 |
Dropping Ball
Description:
In the second round of the Hunter Exam, the candidates are
faced with an even more challenging problem, requiring both
agility and mathematical skills.
After entering the Examination Hall for the second round,
candidates are faced with a huge vertical grid containing empty
s... | 27,316 |
Dropping Directions
Description:
Your sports club has a rivaling sports club in the same
city. They did some awful things to you and you want to get
back at them. You have learned that they are planning on doing
a ’drop’: they drive people blindfolded to a city none of the
participants know and tell th... | 27,317 |
Drowning Combinatorist
Description:
loglogloglog. Brandon Greg Jr. is
sometimes a drowning combinatorist.
A permutation of length $n$ can be represented as some order
of the integers $\{ 1,2,\ldots
,n\} $. A run of length
$k$ in a permutation is
$k$ consecutive elements
that appear in increasi... | 27,318 |
Drunk Texting
Description:
Among the many negative effects of alcohol is my inclination
to text my ex when I’m drunk. I have the urge to express my
feelings, but I also need plausible deniability in case my
embarrassing overtures are rebuffed.
Assume the drunk text is “xoxo”, for “hugs and kisses”. I
... | 27,319 |
Drunk Vigenère
Description:
One of the most well-known and classic methods of encryption
is the Vigenère cipher. Given a message and key of equal
length, all you need to do to encrypt the message is shift each
character forward by a certain number of characters in the
alphabet.
For example, if your st... | 27,320 |
Dry Ice Cream
Description:
Dino loves ice cream. In case he ever run out of ice cream
at his office, he keeps a stash of dry ice in order to quickly
make new ice cream.
His recipe for making ice cream includes exactly
$T$ liters of dry ice.
Unfortunately, he has no marked containers in his office.
... | 27,321 |
Država
Description:
A distant country has $N$ cities in it. The elections were
just held in this country, so the new prime minister was
elected. Currently, there is not a single road in this country,
so the prime minister decided to modernize the country by
connecting some cities with two-way highways ... | 27,322 |
Dual Divisibility
Description:
Given two positive integers $a$ and $b$ with the same number of digits,
compute the number of divisors of $a$ that have $b$ as a divisor.
## Input
The first and only line contains the integers $a$ and $b$ ($1
\le b \le a \le 10^{18}$).
## Output
Output the number of divisors ... | 27,323 |
Duck Journey
Description:
In the local park, there are $N$ ponds, numbered from $1$ to $N$, connected by $M$ channels. The duck Anita has
accidentally ended up in a mud puddle, and now all of her
$31$ feathers are muddy!
Anita is currently in pond $A$, and she wants to get to pond
$B$. On the way there... | 27,324 |
Duck Pond
Description:
Suppose there are $n$
ducks floating on the pond in a circle. The pond is also home
for an alligator with a fondness for ducks. Beginning at a
particular position (duck number 1) the alligator counts around
the circle and eats every $m$th duck (the circle closing as
ducks are... | 27,325 |
Duel of Cards
Description:
Alice and Bob are playing a card game. There are
$2n$ cards uniquely
numbered from $1$ to
$2n$. The cards are
shuffled and dealt to the two players so that each player gets
$n$ cards. Each player
then arranges the cards they get into a deck in any order that
they ... | 27,326 |
Dugovi
Description:
In a little town called Križ live $N$ people. Each of them has borrowed
some money from exactly one other inhabitant. Now the time has
come to pay back all the debts, but the problem is that
everybody has spent all of their money!
The major of Križ has decided to solve this problem. Th... | 27,327 |
Dungeon Crawler
Description:
Two of the dungeon rooms are special. One of these rooms
contains a protective idol known as the “helix key.” A
different room contains a nasty “dome trap,” which prevents the
player from moving once activated. Entering the room with the
trap before acquiring the key will r... | 27,328 |
Dungeon Dawdler
Description:
Oh no! The wicked wizard Nocoproco has captured you and
locked you into his dungeon, from which there is no escape.
Looks like you will be here for a while, so you might as well
make good use of the time and scout out the place. Fortunately,
there are no monsters lurking ab... | 27,329 |
Dungeon master
Description:
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 to move
one unit north, south, east, west, up or down. You cannot move
diagonally and the maze is surrou... | 27,330 |
Dunglish
Description:
Given a sentence in Dutch and a dictionary containing both
correct translations as well as phonetic (incorrect)
translations of individual words, find the translation of the
sentence and indicate whether it is correct, or in case there
is more than one find the total number of cor... | 27,331 |
Dutch Democracy
Description:
The process of forming the Dutch government has taken more
than half a year for three elections in a row. Perhaps we can
streamline the initial stages of coalition building?
The first step after the election results is to find a group
of parties (called a coalition) with enoug... | 27,332 |
Dvaput
Description:
Ivana won the bet (Zvonko hadn’t foreseen this and suspects
that it is due to outside interference) and now Zvonko is
waiting for her at the movies. While he is waiting, he is
observing messages on a screen above him.
As Ivana is running late, Zvonko has been looking at the
screen ... | 27,333 |
Dvoniz
Description:
We say that a sequence of $2K$ elements is interesting if
neither the sum of the first $K$ elements, nor the sum of the last
$K$ elements, is greater
than $S$. A sequence
$A$ of length $N$ is given. For every element,
output the length of the longest interesting subsequence
... | 27,334 |
Dyslectionary
Description:
Have you ever been uncertain how to spell a word? If you ask
someone, they will sometimes just tell you to look it up, and
that’s fine if you know how the word starts. However, it’s not
much help if you only feel certain about how the word ends. To
help give a equal treatment... | 27,335 |
Dyson Circle
Description:
A Dyson Sphere is a theoretical construction around the sun
or another star, that captures the entire energy output of the
star. Science fiction writers have speculated that advanced
civilizations will eventually build such a sphere, as the
energy demands of such a society con... | 27,336 |
Déjà vu
Description:
You have $n$ objects
that you like. The $i$-th
object gives you a happiness rating $H_ i$ when you bring it with you.
However, you can only bring exactly $k$ out of those $n$ objects for your upcoming holiday
(due to baggage/airline limitation, etc).
Which objects should you take?
.... | 27,337 |
ETA
Description:
You want to design a level for a computer game. The level
can be described as a connected undirected graph with vertices
numbered from $1$ to
$n$. In the game, the
player’s character is dropped at one of the $n$ vertices uniformly at random and
their goal is to reach the exit locat... | 27,338 |
Early Orders
Description:
You are given a list of integers $x_1, x_2, \ldots , x_ n$ and a number
$k$. It is guaranteed that
each $i$ from $1$ to $k$ appears in the list at least
once.
Find the lexicographically smallest subsequence of
$x$ that contains each
integer from $1$ to
$k$ exactly onc... | 27,339 |
Early Termination
Description:
You are given non-negative integers $a, b, k$ and are to implement
Euclid’s algorithm with inputs $a, b$ but terminate it as soon as
$a, b \leq \sqrt{k}$.
## Input
The first and only line of input contains non-negative
integers $a, b, k \leq
10^{18}$ separated by a spac... | 27,340 |
Early Winter
Description:
Yraglac really hates early winter. So he was greatly annoyed
when it snowed early this year. His friend however claimed that
summer is always too short in Galcary so there’s nothing to
complain about.
Yraglac doesn’t believe his friend. So he decides to look up
the historical... | 27,341 |
Easter Eggs
Description:
Easter is here again, and as usual, the Easter Bunny has
more things on his mind than a gnu balancing a dish of exotic
fruits on its head. As you know, one of the Easter Bunny’s
tasks is to bring easter eggs containing a nourishing
assortment of carrots and sweets to all the go... | 27,342 |
Easter Eggs
Description:
Easter is coming and the Easter Bunny decided to organise a
chocolate egg hunt for the children. He will hide two types of
eggs: blue milk chocolate and red dark chocolate. In the field
there are some redberry and some blueberry plants where the
Easter Bunny could hide the eggs... | 27,343 |
Easter Holidays
Description:
Scandinavians often make vacation during the Easter holidays
in the largest ski resort Åre. Åre provides fantastic ski
conditions, many ski lifts and slopes of various difficulty
profiles. However, some lifts go faster than others, and some
are so popular that a queue forms... | 27,344 |
Easy Arithmetic
Description:
Harry is now a third-year student at Hogwarts School of
Witchcraft and Wizardry. Contrary to popular belief, arithmetic
(known as Arithmancy in the wizard world) is crucial to
becoming a powerful wizard.
For today’s Arithmancy homework, Harry is given a super long
expressi... | 27,345 |
Easy Climb
Description:
To do so, we will model the mountain as follows: the
mountain consists of $n$
adjacent stacks of stones, and the $i$’th of these stacks has height
$h_ i$. The successive
height differences are therefore $h_{i+1}-h_ i$ (for $1\le i\le n-1$). We would like all
absolute values ... | 27,346 |
Easy Multiplication
Description:
Members of the Modern Arithmetic Puzzle Society (MAPS) love
to multiply numbers together using long multiplication. One of
the members of MAPS, Molly, observed that multiplying two
integers in this way is much easier when their
base-$b$ representations
have few nonz... | 27,347 |
Easy Probability
Description:
As a Hunter, you will undoubtedly face difficult obstacles
during your journey. At such time, a Hunter is expected to
model the situation using Mathematical models, and apply
probability and statistics knowledge to overcome the
situation.
Thus, the third round of the Hunt... | 27,348 |
Easy Query
Description:
You are given an array $a$ with $n$ integers $a_{1}, a_{2}, \ldots , a_{n}$.
You need to answer $q$
queries. In each query, you are given $4$ integers $\ell $, $r$, $u$ and $v$ $(1
\le \ell \le r \le n, 1 \le u \le v \le r-\ell +1)$:
* Consider the sub-array of $a$ from index $\ell $ ... | 27,349 |
Eating Everything Efficiently
Description:
Margriet A. is in pizza heaven! She has bought a one-day
access pass to Pizza World. Pizza World is a food festival,
where all stands have their own special type of pizza. Margriet
would really like to try many different types of pizza, but she
thinks that she... | 27,350 |
Eating Out
Description:
Alice, Bob, and Clara are eating at a new restaurant today.
They’re having trouble deciding what to order, so Alice
proposes that they each pick some items from the menu, and then
they will order the items that everyone picked. The menu has
$m$ items, and Alice, Bob,
and Cla... | 27,351 |
Eavesdropper Evasion
Description:
Alice wants to send $n$
messages to Bob over a communication channel. The $i$th message takes $t_ i$ time steps to send. At each
integer time step, Alice can start sending any number
of her messages. Once started, a message must be transmitted in
its entirety (it canno... | 27,352 |
Eb Alto Saxophone Player
Description:
My fingers move a lot when playing
some music, and I’m quite interested in how many times each
finger presses a button. Assume that
the music is composed of only $14$ different notes. They are: C D E
F G A B in one octave and C D E F G A B in a higher octave. We
... | 27,353 |
Ebony and Ivory
Description:
Piano fingering describes the process of assigning fingers
of a hand to keys on the piano when playing a musical passage.
Although professional musicians consider piano fingering an art
rather than a science, students often search for finger
assignments that make them easie... | 27,354 |
Eccentric Excursion
Description:
Eddy is planning a cross-country trip across $n$ different cities. There are
$n-1$ roads connecting the
cities. Each road connects two cities and is bidirectional. The
roads are laid out such that it is possible to travel between
any two cities using only roads.
Eddy w... | 27,355 |
Echo Echo Echo
Description:
If you have ever visited a canyon or a cave, you may have
yelled and heard the echo of your own voice. In this problem,
you should simulate that effect:
Your program will be given as input a single word, and it
should print out that word three times, separating the words
wi... | 27,356 |
Eco-driving
Description:
My colleague Elisabeth is lazy, both at work and when going
to work. She never wants to do more than necessary, which also
applies to her journey to work. Her goal is to use a minimum
amount of energy, which she achieves by braking and
accelerating as little as possible. This m... | 27,357 |
Economic Inequality
Description:
There is an event involving $N$ banks and $M$ stakeholders, where Bob is
stakeholder 1. The banks are giving money to the stakeholders,
where bank $i$ needs to
give out a total of $A_ i$
dollars, and each bank can give each person at most
$K$ dollars, to mitigate
... | 27,358 |
Economical Coverage
Description:
Providing wireless network coverage for a large office can
be tricky. In this problem you are asked to set up wireless
network coverage for an entire office floor plan. The floor
plan can be viewed as an $N\times
M$ grid. Each grid cell represents a single office. Each
... | 27,359 |
Edge Removal
Description:
Today Harry is studying minimum spanning
trees of graphs.
A minimum spanning tree of a
connected, edge-weighted undirected graph is a subset of its
edges that connects all its vertices together, without any
cycles and with the minimum possible total edge weight.
For example,... | 27,360 |
Edit Step Ladders
Description:
An edit step is a transformation from one word
$x$ to another word
$y$ such that $x$ and $y$ are words in the dictionary, and
$x$ can be transformed to
$y$ by adding, deleting,
or changing one letter. So the transformation from “dig” to “dog” or from
“dog” to “do”... | 27,361 |
Editing Explosion
Description:
Charles complains to Ada, “That Keats!
So many spelling errors in this manuscript! How will I get
them all fixed?”
Ada responds, “I’ve got a routine in
the Engine that will help you. For a given word, it considers
small errors and finds all the words that are clo... | 27,362 |
Eeny Meeny
Description:
Similar verses exist in most languages, such as “Ulle dulle
dof” in Finnish, “Akka bakka bonka rakka” in Norwegian, and
“Ole dole doff” in Swedish.
Two teams are to be selected for a game and the rhyme is
used to select one kid for a team at a time, alternating
between the two ... | 27,363 |
Eerie Subarrays
Description:
Brandon Greg Jr. considers an array to be scary if its leftmost element is the median of its
elements. Given an array with distinct
elements $[p_1, p_2, \ldots , p_
n]$, Brandon wants to count the number of scary
subarrays.
A subarray is some contiguous chunk of elements $... | 27,364 |
Efficiency
Description:
Steve enjoys parties and word games. At one party, he
challenges his friends to play a new word game that he
invented.
In Steve’s game, there are four words: “Efficiency”, “Unbreaking”, “Silk”,
and “Touch”.
There are $P$ players
playing the game. At a given $N^{th}$ ro... | 27,365 |
Efficient Bus Routing
Description:
In the country of Optopia, they do everything as optimal as
possible, and everything inside of Optopia has been designed
with this in mind. For example, in order to guarantee that GPS
route planners are always optimal, the road network of Optopia
has been designed suc... | 27,366 |
Efficient Exchange
Description:
You have recently acquired a new job at the Bank for
Acquiring Peculiar Currencies. Here people can make payments,
and deposit or withdraw money in all kinds of strange
currencies. At your first day on the job you help a customer
from Nijmegia, a small insignificant coun... | 27,367 |
Egypt
Description:
A long time ago, the Egyptians figured out that a triangle
with sides of length $3$,
$4$, and $5$ had a right angle as its largest
angle. You must determine if other triangles have a similar
property.
## Input
Input represents several test cases (at most $1\, 000$), followed by a l... | 27,368 |
Eidam-Sand Lair
Description:
In your base you have dug through sand and rock to construct
a deep pit with stairs and a lift. The pit goes very deep into
the ground where on various floors you leave equipment and on
the deepest levels you leave cheeses to age, particularly
Eidam. You often take a stroll... | 27,369 |
Eight Queens
Description:
In the game of chess, the queen is a powerful piece. It can
attack by moving any number of spaces in its current row, in
its column or diagonally.
In the eight queens puzzle, eight queens must be placed on a
standard $8 \times 8$
chess board so that no queen can attack anothe... | 27,370 |
Eiginnöfn
Description:
Most Icelanders have either one or two given names. Those
that have two given names are usually addressed only with their
former given name, but not the latter. The parents of those
people sometimes react quite harshly when this happens. When
Arnar’s parents were asked whether Ar... | 27,371 |
Eilíf æska
Description:
Hildur enjoys mixing drinks and has now created the drink
eternal youth. She poured the drink into
a few glasses and intends to share it with some friends. After
having poured into the glasses she noticed there isn’t an equal
amount between all the glasses. To make sure everythi... | 27,372 |
Eindahraðall
Description:
A particle accelerator is being built in Iceland. The
accelerator is $N$ Planck
lengths in length and is circular. An experiment is planned
where two particles should collide. At the start, an electron
is placed inside the circular accelerator and the magnets then
start to... | 27,373 |
Einfalt Dæmi!
Description:
Hey, to help you get going we’ve decided to give you one
very simple problem! The only thing you need to do is read one
integer $N$ and print
$N!$
Wow, it couldn’t be simpler!
## Scoring
The solution will be tested on input data of varying
difficulty and the data is divide... | 27,374 |
Einfasa Eindahraðall
Description:
As was covered in the last contest, an Icelandic particle
accelerator has been built. Since last time the accelerator has
been converted to use single phase power, since according to
some electrical engineer the other phases were interfering with
measurements. The tin ... | 27,375 |
Einkunnir
Description:
Karen has to review the multiple choice exams some students
turned in. For each question there is exactly one correct
answer. Each question is worth equally much in terms of the
grade and there is no penalty for wrong answers. Karen doesn’t
enjoy going over this by hand and has t... | 27,376 |
Einvígi
Description:
Tómas is a great fan of war games. His favorite game these
days is Einvígi margra. In the game two
players battle one another. Each battle consists of a series of
duels.
Tómas has $n$ soldiers,
each denoted by a strength $a_i$. Tómas’ opponent also has
$n$ soldiers, each denot... | 27,377 |
Ekki dauði opna inni
Description:
## Input
The input consists of two lines. Each contains at most
$2100$ characters and the
character “|” denotes where Ketill
starts writing on a new line.
## Output
One line containing the writing of Ketill written from left
to right.
## Scoring
Group
Points
Con... | 27,378 |
Ekki minn forseti
Description:
In Iceland it is impossible for a candidate with a lower
amount of votes to win against the candidate with the most
votes. Even though our electoral system is not susceptible to
this flaw in particular, it is hardly perfect. In Iceland’s
electoral system, a voter simply c... | 27,379 |
Eko
Description:
Lumberjack Mirko needs to chop down $M$ metres of wood. It is an easy job
for him since he has a nifty new woodcutting machine that can
take down forests like wildfire. However, Mirko is only allowed
to cut a single row of trees.
Mirko’s machine works as follows: Mirko sets a height
p... | 27,380 |
Eksplozija
Description:
Mirko likes to play with strings of characters, but this
time he has taken it too far – he put an “explosion” in the
string! An explosion is a series of characters which, if found
in the vicinity of fire, explodes and starts a chain
reaction.
Mirko, being as negligent as he usu... | 27,381 |
Elapid Errands
Description:
Carl the snake is in his burrow at the point $(0,0)$ in an infinite plane. He wants
to visit the points $(x_1, y_1),
(x_2, y_2), \dots , (x_N, y_N)$. These points must be
visited in the order they are given, and Carl must end up at
the point $(x_N, y_N)$. In
one move, he... | 27,382 |
Elder Scrollbar
Description:
When the first scrollbars appeared on resizable windows
during user interface development in the Elder Days, computer
graphics were still primitive. Widgets were made with ASCII
symbols and text was monospaced. A window displayed a
viewport: a part of a much longer text, ad... | 27,383 |
Eldspýtur
Description:
## Input
The input is a single line containing two integers
$n$ and $k$, the number of matches at the
start of the game and the maximum number of matches one may
remove in a single move.
## Output
Print Jebb if Benni is willing to
play, print Neibb otherwise.
## Scoring
Grou... | 27,384 |
Election
Description:
Reports from the voting stations are starting to trickle in
and you hope that you can soon declare a victory.
There are $N$ voters
and everyone votes for one of the two candidates (there are no
spoiled ballots). In order to win, a candidate needs more than
half of the votes. A ce... | 27,385 |
Election
Description:
Canada has a multi-party system of government. Each
candidate is generally associated with a party, and the party
whose candidates win the most ridings generally forms the
government. Some candidates run as independents, meaning they
are not associated with any party. Your job is ... | 27,386 |
Election Paradox
Description:
In Oddland, the leader of the country is determined by a
democratic election. The country is divided into an odd number
of regions, in which each region has an odd number of
voters.
There are two (an even number!) political parties in
Oddland, and the winning party is the... | 27,387 |
Election Security
Description:
Elections Canada has decided to add a security code at the
bottom of each of its ballots to help distinguish valid ballots
from invalid (fraudulent) ballots. These codes must differ from
region to region, and election officials in each region have
been given the responsib... | 27,388 |
Electrical Outlets
Description:
Roy likes to watch TV as he works on his computer, and to
listen to his HiFi system (on high volume) while he vacuums, so
using just the single outlet is not an option. Actually, he
wants to have all his appliances connected to a powered outlet,
all the time. The answer,... | 27,389 |
Electronic Components
Description:
Sara is doing her summer internship at NCPC (Never Crashing
Personal Computers). One day, a rare creature appeared in the
office: an algorithmic problem!
The company has a machine that places electronic components
on circuit boards. Normally, it would do this one compone... | 27,390 |
Elegant Showroom
Description:
A car showroom is one of the few places where cars can be
found indoors. Showrooms often have many cars, even above
ground level! As cars are sold and new cars are bought in to
sell, the cars must be moved carefully out of the showroom.
Clearly employees only wish to move car... | 27,391 |
Elementary Math
Description:
Ellen has already chosen the $n$ pairs of numbers. All that remains
is to decide for each pair which of the three possible
operations the students should perform. To avoid students
getting bored, Ellen wants to make sure that the $n$ correct answers to her exam are
all diff... | 27,392 |
Elevated Rails
Description:
Brandon and Geoffry like trains! They have been tasked with
building a network of rails connecting $n$ train stations. Each of the
stations is on one of three islands, and each island has at
least one station on it.
Brandon has been working hard to establish connections
bet... | 27,393 |
Elevating the Prank
Description:
After Loke beat you in last week’s programming competition
you want play a prank on him. You both live in the same student
apartment and in order to get from floor $A$ to floor $B$, Loke (who is very lazy) of course
wants to take the elevator. You want him to suffer as long... | 27,394 |
Elevator Pitch
Description:
You are in charge of ensuring all building designs meet
accessibility requirements. As law dictates, every part of your
building should be reachable for wheelchair users, which means
elevators will have to be installed. You are given the
blueprints of the company’s current p... | 27,395 |
Elevator Trouble
Description:
You are on your way to your first job interview as a program
tester, and you are already late. The interview is in a
skyscraper and you are currently in floor $s$, where you see an elevator. Upon
entering the elvator, you learn that it has only two buttons,
marked “UP $u$”... | 27,396 |
Eligibility
Description:
Every year, students across the world participate in the ACM
ICPC1. In order to participate in this
contest, a student must be eligible to compete. In this
problem, you will be given information about students and you
will write a program to determine their eligibility to
p... | 27,397 |
Ellipse Eclipse
Description:
An Ellipse is a 2D geometric figure. It consists of
the set of all points such that the sum of the distance from
each point to two specific points is constant. The two specific
points are called the Foci of the ellipse. The
Major Axis of an ellipse is the diameter of the
... | 27,398 |
Elliptic Curve Addition
Description:
Let $p$ be a prime and
$a,b\in \mathbb {F}_p$
such that $4a^3 + 27b^2
\not\equiv 0 \pmod{p}$. Let $P=(x_1,y_1)$ and $Q=(x_2,y_2)$ be two points on the
elliptic curve $E : y^2 =
x^3+ax+b$. Calcuate $P
\oplus Q$ given $p, a, b,
x_1, y_1, x_2$ and $y_2$.
#... | 27,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.