task stringlengths 0 154k | __index_level_0__ int64 0 39.2k |
|---|---|
Halting After All
Description:
A Turing machine is a simple mathematical model for a
computer. It consists of a list of tuples of the form
$<s,i,t,o,d>$, a
memory tape with individual cells containing either
$0$ or $1$, a state, and an input/output
head. The memory tape can be modeled as an infinit... | 28,000 |
Hamiltonian Hypercube
Description:
Hypercube graphs are fascinatingly regular, hence you have
devoted a lot of time studying the mathematics related to them.
The vertices of a hypercube graph of dimension $n$ are all binary strings of length
$n$, and two vertices are
connected if they differ in a singl... | 28,001 |
Hamiltooonian Hike
Description:
Alice loves hiking. She often travels through forests and
over mountains for several days, bringing only a backpack. For
next year’s summer, she decided to travel to a beautiful area
which contains a large number of cabins: places where hikers
can lay down a sleeping bag... | 28,002 |
Hammer Time
Description:
As in the following picture, you have a square board and
you’re trying to drive some nails into it. Your nails are
placed with their centers on a regular $n \times n$ grid with one centimeter
between rows and columns. The head of each nail is a circle
half a centimeter in diame... | 28,003 |
Hamming Ellipses
Description:
In geometry, ellipses are defined by two focal points
$f_1, f_2$ and a length
$D$. The ellipse consists
of all points $p$ such
that $\mathop
{\mathrm{distance}}(f_1, p) + \mathop {\mathrm{distance}}(f_2,
p) = D$.
When one normally thinks of ellipses, it is in the ... | 28,004 |
Han
Description:
Han didn’t want to study solo so he invited his friend
Dominik to come over. After an eventful evening that will be
remembered for a record number of solved tasks from the field
of electronics, Dominik went home. To his surprise, the police
stopped him thinking he was drunk. It is know... | 28,005 |
Hand of the Free Marked
Description:
The assistant uses two ways of passing information to the
magician. First, they can pick which one of the $k$ cards to keep hidden. Second, they
can rearrange the other $k-1$ cards in a specific way. For the
case $n=52$ and
$k=5$ both techniques are
needed, sinc... | 28,006 |
Handheld Fan
Description:
You won a small handheld fan at an office party.
Unfortunately, the battery is not replaceable – it is fused to
the circuitry and is not rechargeable. The company wants you to
buy a new fan when the charge is depleted (Canada is really far
behind with right-to-repair legislati... | 28,007 |
Handkäs and Mispelchen
Description:
You want to enjoy a traditional night out in Frankfurt with
your friends. This involves a good meal of Handkäs mit
Musik followed by a Mispelchen as a digestif.
Sadly, no single pub may have sufficient food or drink to serve
the entire group, so you may have to switc... | 28,008 |
Handy Beer
Description:
Karl is an blazingly fast typist and always wins the anual
speed typing competition at ScrollBar by a wide margin.
This year, he wants to show off even more than usual: he
plans to win while holding a beer. Of course, holding a beer
will slow him down quite a bit, as he can only ty... | 28,009 |
Hanging Out on the Terrace
Description:
The HiQ office in Stockholm has a pretty awesome rooftop
terrace, often used in company parties and events such as
programming competitions.
Unfortunately, fire safety rules limit the number of people
who can be on the terrace at any one point in time – at most
... | 28,010 |
Hangman
Description:
Hangman is a (somewhat macabre) word-guessing game that can
be played by two people. Player $1$ thinks of a word consisting of
$n$ letters, and draws a
row of $n$ dashes on a
piece of paper. These dashes correspond to the letters of the
word, in the same order. Player $2$ then ... | 28,011 |
Hanjie
Description:
Hanjie, also known as Nonograms or Picross, are picture
logic puzzles, where cells in a grid must be colored with black
or white, according to numbers at the side of the grid:
Formally, you are given a board with $r$ rows and $c$ columns. On each row and each
column, you are also given... | 28,012 |
Happy Happy Prime Prime
Description:
RILEY VASHTEE: [reading from display] Find the next number in the
sequence:
THE DOCTOR: 379.
MARTHA JONES: What?
THE DOCTOR: It’s a sequence of happy
primes – 379.
MARTHA JONES: Happy what?
THE DOCTOR: Any number that reduces
to one when you take the sum of the squ... | 28,013 |
Happy Telephones
Description:
In the land of Eden, all phone conversations are happy ones.
People com- plaining on the phone are immediately put in jail.
To enforce this law, the police taps all phone
conversations.
The police wants to hire the approriate number of operators
to listen to all conversat... | 28,014 |
Happy and Unhappy Numbers
Description:
It turns out there are such things as happy numbers and
unhappy numbers. We’re going to assume that you have been using
these poor little lovable creatures your whole life with
absolutely no consideration for their feelings and general
well-being. Perhaps today we... | 28,015 |
Hard Array Problem
Description:
This is an array problem.
Given two arrays of $N$
numbers with values $A_1, \dots ,
A_ N$ and $B_1, \dots , B_
N$. Let $A_{L, R}$
be the sum of elements in the subarray of $A$ from index $L$ to $R$ inclusive. Let $B_{L, R}$ be defined similarly.
Minimise $A_{L, R}^2 + ... | 28,016 |
Hard Drive
Description:
Pia is getting ready for her flight to the NWERC 2018 in
Eindhoven. As she is packing her hard drive, she remembers the
airline’s ridiculous weight restrictions, which may pose a
problem. You see, the hard drive is essentially a string of
ones and zeros, and its weight depends o... | 28,017 |
Hard Evidence
Description:
Consider taking a photo of the base from some point
$P$ outside the fence. Let
$Q$ be the left-most point
of the base when viewed from $P$, and let $R$ be the right-most point of the
base when viewed from $P$.
Then the view angle of the base at $P$ is the angle at $P$ in ... | 28,018 |
Hardware
Description:
Ola Clason’s Hardware store is an old company where most
work is done “the old way”. Among other things, the company is
the one and only provider of marble house numbers. These house
numbers have become extremely popular among construction
companies, especially the ones building l... | 28,019 |
Hardwood Species
Description:
Hardwoods are the botanical group of trees that have broad
leaves, produce a fruit or nut, and generally go dormant in the
winter.
America’s temperate climates produce forests with hundreds
of hardwood species – trees that share certain biological
characteristics. Althoug... | 28,020 |
Harry the Hamster
Description:
Harry the Hamster lives in a giant hamster cage. Inside the
cage there is a set of $n$
plastic balls connected by unidirectional hamster tubes of
varying lengths. Harry is currently in ball $s$ and his bed is in ball
$t$.
Being a simple hamster, the hemispheres of Harry’... | 28,021 |
Harshad Numbers
Description:
We’re all familiar with harshad numbers. For this problem,
you will ... what’s that? You aren’t familiar with
harshad numbers? They’re also known as Niven numbers – does
that ring a bell?? Anything???
Well, it’s a simple enough concept. A harshad
number is a number which i... | 28,022 |
Harvard
Description:
Some modern microcontrollers use the Harvard architecture –
but not paper tape and relays! Data memory is organized in
banks, each containing the same number of data items. Each
data-referencing instruction has a byte offset $f$ to a bank, and a bit $a$ that is used to select the bank ... | 28,023 |
Hash
Description:
Little Mirko is studying the hash function which associates
numerical values to words. The function is defined recursively
in the following way:
* $f( \text {empty word} ) =
0$
* $f( \text {word} + \text
{letter} ) = ( ( f( \text {word} ) \cdot 33 ) \oplus
\mathrm{or... | 28,024 |
Hash Collision
Description:
For security reasons, TU Delft is going to place locks with
numeric keypads on the doors of a large number of rooms. Each
room will have its own pass code. The task of setting up the
server on which all codes will be stored is given to Harry and
Sharon.
Having paid attentio... | 28,025 |
Hashing Algorithm
Description:
You’re researching an equivalence relation on strings. Let
$F(A)$ be the
multiset of all substrings of $A$, and $G(A)$ be the set of all
distinct substrings of $A$. Two strings $A$ and $B$ are isomorphic to each
other if there exists a bijective mapping $\phi : G(A) \to G... | 28,026 |
Hatter's Hat Shop
Description:
Sophie works at a hat shop. She is trying to decorate
$N$ hats, where each hat
belongs to one of $M$
different designs (denoted by an integer from $1$ to $M$). Each hat also starts with a
different amount of starting beauty $S_j$.
Hats of the same design share some prope... | 28,027 |
Haughty Cuisine
Description:
As a waiter, your favourite question from an indecisive
punter is “I’m not sure, what would you recommend?” — so much
so, in fact, that you decided to automate away the answer to
avoid having to spend any brain cycles on this question ever
again.
You have the list of all s... | 28,028 |
Haunted Graveyard
Description:
Tonight is Halloween and Scared John and his friends have
decided to do something fun to celebrate the occasion: crossing
the graveyard. Although Scared John does not find this fun at
all, he finally agreed to join them in their adventure. Once at
the entrance, the friend... | 28,029 |
Hay Bales
Description:
Peter has lined up hay bales. Some hay bales contain
parasites and he wants to move the infected hay bales to the
back of the sequence, to minimize the chance that the parasites
spread. To sort the haybales, he repeatedly takes out any three
consecutive hay bales and puts them ba... | 28,030 |
Hay Points
Description:
Each employee of a bureaucracy has a job
description – a few paragraphs that describe the
responsibilities of the job. The employee’s job description,
combined with other factors, such as seniority, is used to
determine his or her salary.
The Hay Point system frees the Human Re... | 28,031 |
Head Guard
Description:
You are the Head guard at the Royal Blue Mountain
Castle.
Your job is simple: take a tally of how many types of
critters came through which doors, and in what order.
The castle is renowned for its numerous doors, however
sometimes they may or may not be open.
### Input
The input... | 28,032 |
Headline Heat
Description:
To smoothen the waves of conflict in this ocean of rage, a
newly appointed authority is tasked with proofreading media
coverage of GCPC and Winter Contest to prevent uneven
coverage.
## Input
The input consists of:
* One line with the number of universities $n$, rivalries $m$,... | 28,033 |
Heaps from Trees
Description:
You are given a rooted tree with $n$ nodes. The nodes are labeled
$1$ to $n$, and node $1$ is the root. Each node has a value
$v_ i$.
You would like to turn this tree into a heap. That is, you
would like to choose the largest possible subset of nodes that
satisfy this Hea... | 28,034 |
Heaps of Fun
Description:
Consider a rooted tree with $n$ nodes, numbered $1..n$. Each node will have a fixed
integer $b$, and for each,
a uniform random real number is chosen in the interval
$[0..b]$.
What is the probability that the random numbers chosen cause
the tree to form a Heap (i.e., the
... | 28,035 |
Heart Rate
Description:
A common method for determining your own heart rate is to
place your index and third finger on your neck to the side of
your windpipe. You then count how many beats you feel in a span
of $15$ seconds, multiply
that number by four and that gives you a measure of your heart
ra... | 28,036 |
Hearthbreakers
Description:
Pinkie Pie and Applejack are celebrating Hearth’s Warming
Eve together, and as per tradition, they will be serving rock
soup—delicious, nutritious and scrumdiddlyumptious!
To prepare the rock soup, they first need to prepare
$N$ rocks of the
appropriate sizes, catering to t... | 28,037 |
Heating Up
Description:
The spiciness of each slice is measured in Scoville Heat
Units (SHU). Jonas has a certain spiciness tolerance, also
measured in SHU, which corresponds to the spiciness of the
spiciest slice that Jonas can tolerate eating. He has also
noticed that, after eating a slice of $k$ SHU... | 28,038 |
Hectic Harbour
Description:
There are two gantry cranes operating on the same gantry of
length $n$. The gantry has
some fixed integral positions, labelled from $1$ to $n$, at which the cranes must perform
loading/unloading operations. In the beginning the first gantry
crane is located on the very lef... | 28,039 |
Height Ordering
Description:
Mrs. Chambers always has her class line up in height order
(shortest at the front of the line). Every September a new
class of exactly 20 3rd graders arrive, all of different
height. For the first few days it takes a long time to get the
kids in height order, since no one k... | 28,040 |
Height Preservation
Description:
Virtual Reality (VR) is one of the new trends for
applications recently. Wearing a VR headset, you will be in an
immersive virtual environment for education, collaboration,
entertainment, etc.
To enhance user experience, ICPC establishes a VR room for
users to walk and... | 28,041 |
Height Profile
Description:
The cycling classic Amstel Gold Race is held annually in the
nearby Dutch province of Limburg. It features frequent short
climbs giving contestants little time to recover in between.
For instance the last $42$
kilometres of the race has $8$ steep climbs of average length
... | 28,042 |
Heiltölusumma
Description:
Have you heard of the mathematician Carl Friedrich Gauss?
There is a fun story about him from when he was in primary
school. One day his teacher was tired of the children’s antics,
so he assigned them a hard mathematics problem to keep them
busy. The assignment was to add all... | 28,043 |
Heimavinna
Description:
Hneitir is a college student, meaning he has to do homework
in various courses. Hneitir is not lazy, but he dislikes doing
homework, especially when it comes to chemistry. Tomorrow he
will be dragged to the board, being made to solve the assigned
problems. The problem is that he... | 28,044 |
Heimilisverk
Description:
Ómar is a very responsible boy and has a list of chores he
needs to do. The problem is that Ómar is very lazy, so the list
of unfinished chores has become quite long. So long, in fact,
that he does not remember what chores he has already put on the
list and has thus put duplic... | 28,045 |
Heir's Dilemma
Description:
Your favorite uncle has passed away, leaving you a large
estate. Bank account numbers, locations of safe deposit boxes,
and GPS coordinates to buried treasures are all locked in an
electronic safe in your uncle’s office behind a picture of dogs
playing poker. One day he show... | 28,046 |
Heliocentric
Description:
Nicolaus Copernicus, born in Toruń in the Kingdom of Poland
in 1473, was the first to develop a view of the universe which
placed the Sun, rather than the Earth, at the center of the
orbiting planets. Copernicus viewed each planet as revolving in
a circular orbit with the Sun ... | 28,047 |
Hello World!
Description:
## Input
There is no input for this problem.
## Output
Output should contain one line, containing the string “Hello
World!”.
| 28,048 |
Help Me With The Game
Description:
Your task is to read a picture of a chessboard position and
print it in the chess notation.
## Input
The input consists of an ASCII-art picture of a chessboard
with chess pieces on positions described by the input. The
pieces of the white player are shown in upper-case ... | 28,049 |
Help Roomba Find Himself
Description:
Roomba is a healthy, adolescent robot, who loves his job.
The work is simple, but rewarding: every morning Roomba sets
out from his cosy docking station and follows a set path
throughout his masters’ house, carefully sweeping up every dust
bunny he encounters, befo... | 28,050 |
Help a PhD candidate out!
Description:
On his current list Jon Marius has two kinds of problems:
addition problems on the form “$a
+ b$” and the ever returning problem “P=NP”. Jon Marius
is a quite distracted person, so he might have to solve this
last problem several times, since he keeps forgetting t... | 28,051 |
Help!
Description:
MegaFirm Inc. has created a set of patterns to aid its
telephone help-desk operators in responding to customers. A
pattern is a phrase consisting of words and placeholders. A
word is simply a string of letters. A placeholder is a word
enclosed in angle brackets (that is <...>). A phr... | 28,052 |
Helpful Currents
Description:
Lysias loves his full-rigged ship and takes it out to his
island castle as often as possible. On his way back to the
castle one day, the engines capable of turning the sails
failed. As it is a full-rigged ship, he and his crew are now
unable to turn the sails in any direct... | 28,053 |
Helpful Rotations
Description:
Relatively close to Mars, there is a small group of space
habitats shaped as discs. To make movement between them easy,
they are all perfectly aligned in the Z coordinate. But while
movement is usually easy, there are cases when it’s not:
“Hey Sophia, this situation reminds ... | 28,054 |
Herb Mixing
Description:
Leon has collected some herbs of two possible colors: green
and red. Leon’s health level will be boosted after he eats
those herbs. Mixing the herbs can increase their effect
according to the following recipes:
* One green herb: Boosts health by $1$.
* Two green herbs: Boosts hea... | 28,055 |
Herdier Immunity
Description:
You own a lovable pack of $N$ Herdiers that are numbered from
$1$ to $N$, and every day you line them up in
numerical order and count them off lovingly to show your
affection to them. Unfortunately, tragedy struck one day, as
$M$ of your Herdiers
suddenly fell sick wit... | 28,056 |
Herkabe
Description:
Teacher Herkabe has decided to rank his students again. This
time, he wants his list to also be aesthetically pleasant, so
he has decided that similar names (those beginning with the
same letter or sequence of letters) must be close to one
another on the list. Therefore, he has dev... | 28,057 |
Herman
Description:
The 19th century German mathematician Hermann Minkowski
investigated a non-Euclidian geometry, called the taxicab
geometry. In taxicab geometry the distance between two points
$T_1(x_1, y_1)$ and
$T_2(x_2, y_2)$ is defined
as:
All other definitions are the same as in Euclidian ... | 28,058 |
Hermits
Description:
In this modern world, people are moving into more and more
tightly packed cities. This is a development that the hermits
of the world love – if people concentrate in cities, that
leaves much more space for hermits! Well, a development that
almost all hermits love. Hermiticism is a ... | 28,059 |
Hero Leveling
Description:
Edgar wants to be a hero! However, to take the Hero
Qualification Test, he must be at least level $L$. He is currently level 0, and
there are $N$ quests
available for him to take. Quest $i$ requires him to be at least level
$M_ i$ to complete, and he
will gain $X_ i$ leve... | 28,060 |
Hero Power
Description:
Rhythm gaming seems to be having a bit of a renaissance this
October, with both a new “Rock Band” and a “Guitar Hero” game
coming out. Bj0rn is preparing to achieve top scores in “Guitar
Hero Live”, but he needs your help in figuring out what the
maximum score is for all the new... | 28,061 |
Heroes of Velmar
Description:
Welcome to the world of Heroes of Velmar, the
critically acclaimed trading card game developed by Sidney
Games! After the tremendous success of the physical card
game, Sidney Games has decided to take it to the next level and
transform it into an immersive video game exper... | 28,062 |
Hexagon Game
Description:
You are playing a game on a hexagonal board of size
$S$. The middle row is
composed of $S$ hexagons,
and the top and bottom rows each have $(S + 1) / 2$ hexagons. ($S$ will be odd.) The hexagons are
numbered starting with 1 in the upper left, and increasing
left-to-right a... | 28,063 |
Hexagon coloring
Description:
You are given a hexagonal grid with $n$ rows, where $n$ is an odd integer. The rows are
numbered $1$ to
$n$ from top to bottom.
The odd-numbered rows have exactly $n$ hexagons, and the even-numbered
rows have exactly $n-1$
hexagons. Let’s denote the $j$-th hexagon in t... | 28,064 |
Hexagonal Rooks
Description:
It is game night and Alice and Bob are playing chess. After
beating Bob at chess several times, Alice suggests they should
play a chess variant instead called hexagonal chess.
Although the game is very rarely played nowadays, Alice knows
the rules very well and has obtained... | 28,065 |
Hey, Better Bettor
Description:
Recent recessions have not been kind to entertainment
venues, including the gambling industry. Competition is fierce
among casinos to attract players with lots of money, and some
have begun to offer especially sweet deals. One casino is
offering the following: you can ga... | 28,066 |
Heysáta
Description:
## Input
The first line contains the integer $n$, the number of characters in the
hay stack.
The second line contains the character $k$, the needle Unnar should find, it
can be a lower case or upper case letter.
The third and last line contains a string of length
$n$, the hays... | 28,067 |
Hidden Camera
Description:
John wants to put a hidden camera in a room. For this
problem, we ignore the vertical dimension and treat the room as
a two-dimensional object. The room has the shape of a convex
polygon. The camera is placed on a wall, halfway between two
corners. The camera has a limited vi... | 28,068 |
Hidden Password
Description:
Insecure Inc. has decided to shift directions after a
failed attempt at developing a new encryption standard. Their
new effort is a password system used to hide a password inside
another string of characters we denote as a message.
However, it is important that the message ... | 28,069 |
Hidden Words
Description:
Ingrid is solving the Saturday newspaper Hidden Words in
a Grid -puzzle, but is finding it a bit tedious to do by
hand. Luckily Ingrid knows how to program, and has written a
neat image recognition routine that converts a picture of the
puzzle into a nice text-based format. Ho... | 28,070 |
Hide and Seek
Description:
Each round starts with Gloria hiding in one of the caves
(except cave $0$) with
uniform probability. Sven, starting in cave $0$, then has $n$ seconds to find Gloria. Each
tunnel takes some number of seconds for Sven to traverse
depending on the length of the tunnel, and can b... | 28,071 |
Hide the Panchams
Description:
You are the manager of a Pokemon Sanctuary, but a lot of
your Panchams have been acting mischievously like usual. In
order to protect the rest of your Pokemon from the antics of
these Panchams, you want to build safety enclosures for the
Panchams around their houses, so t... | 28,072 |
Hiding Chickens
Description:
“Weeeee,” says the fox after breaking in to the roost and
killing all the chickens. Then he realizes that he has killed
way more chickens then he can eat right now and hence he
decides to hide them in already existing hiding spots nearby.
The fox can only carry two hens at ... | 28,073 |
Hiding Places
Description:
In chess, the knight is one of the more interesting pieces.
As illustrated below, it moves by jumping two spaces up or down
and one to the left or right. Alternatively, it can jump two
spaces to the left or right and one space up or down. This lets
the knight cover a lot of c... | 28,074 |
High Score
Description:
You’ve just been playing a video game in which you had to
move a worm through a maze using a joystick. You got the high
score, and now you have to enter your name using this joystick.
This works as follows.
The initial name displayed on the screen is a string
consisting only of... | 28,075 |
High Score
Description:
One of the ways to score in Seven Wonders is through the use
of Science. During the game, the players may collect a
number of Science tokens of three different types:
Cog, Tablet, and Compass. If a
player has $a$ Cogs,
$b$ Tablets and
$c$ Compasses, that player
gets ... | 28,076 |
High-quality Tree
Description:
The binary search tree is one of the most useful data
structures in computer science. Many methods exist to keep them balanced, such
as using tree rotations (like in AVL-trees) or randomness (like
in treaps). One thing that these methods have in common is that
they are al... | 28,077 |
Higher Arithmetic
Description:
To combat the rise of smarter bots, the Internet Captcha
Production Company (ICPC) has outdone itself this time: given a
distorted image containing many integers, find the maximum
value that can be expressed using each of the given integers
exactly once, using addition, m... | 28,078 |
Highest Hill
Description:
Sweden may not have a particularly impressive mountain range
compared to other NCPC countries such as Norway and Iceland,
but at least it beats the flatlands of Denmark. The situation
is not so clear when comparing other member countries though.
For example, is Estonia more mo... | 28,079 |
Highest Tower
Description:
Oni’s mother took extra care to make sure that it was indeed
possible to use all rectangles in a tower in order not to
discourage Oni. But of course Oni quickly lost interest anyway
and returned to her physical blocks. After all, what is the
point of building a tower if you c... | 28,080 |
Highway Hassle
Description:
A transport company has come to you for help. One of the
biggest expenses that they have is the petrol for the trucks.
They would like to minimize the money they need to spend on
petrol.
Because of the long trips, a truck driver typically needs to
stop multiple times at a p... | 28,081 |
Highway to Mount Fansipan
Description:
In the year $3\, 030$,
Highway to mount Fansipan is the most
popular TV game show in Vietnam.
In this game show, four contestants are given a crossword
puzzle. The crossword consists of $n$ horizontal words. The first
letters of the $n$ words
form a hidden me... | 28,082 |
Hilbert Sort
Description:
Sorting numerical data not only makes it easy to search for
a particular item, but also makes better use of a CPU’s cache:
any segment of data that’s contiguous in memory will describe a
set of items that are similar in some sense. Things get more
complicated if our data repre... | 28,083 |
Hilbert's Hedge Maze
Description:
David has elaborate hedge mazes in his garden. For each of
his mazes of different sizes, he wonders how long it would
take to walk between any pair of locations in and around that
maze. A hedge maze of order $n\geq 1$ is constructed according
to very specific i... | 28,084 |
Hill Climbing
Description:
Everyone knows that the graph edge partitioning problem is
NP-hard. As there are many variants of it, here’s the one that
SoCCat is talking about:
There is a connected graph with $n$ vertices and $m$ edges. You can color each edge
into $m$ possible colors,
numbered from $1$ ... | 28,085 |
Hill Driving
Description:
You’re driving your car in the local hills and returning to
your home town. You’d like to get back as quickly as possible;
however, you notice that you don’t have much fuel left. You
know the most efficient route to take. Some parts of this route
go downhill, and some go uphil... | 28,086 |
Hill Number
Description:
A Hill Number is a positive integer, the digits of which
possibly rise and then possibly fall, but never fall and then
rise. For example:
Given a positive integer, if it is a hill number, print the
number of positive hill numbers less than or equal to it. If it
is not a hill n... | 28,087 |
Hills in Gothenburg
Description:
As most students are aware, Gothenburg somehow seems to have
more roads going uphill than downhill, regardless of which way
you’re going. The knowledge of this made Lazy Smurf feel even
more hopeless when his bicycle broke down in the middle of the
city, on his way to S... | 28,088 |
Hilly Walk
Description:
UCLA is a campus that is full of hills, which makes walking
incredibly tedious (as any UCLA student can tell you about). In
fact, all of the hills in Los Angeles are in the shape of a
parabola bounded by the $x$-axis, defined by the formula
$y=-(x-a)^2+b$ for
integers $a$ an... | 28,089 |
Hipp Hipp
Description:
## Input
There is no input in this problem.
## Output
Print 20 lines. Each line should contain Hipp hipp hurra!
## Scoring
Group
Points
Constraints
1
100
No further constraints
**Sample Input 1**
**Sample Output 1**
```
Hipp hipp hurra!
Hipp hipp hurra!
Hipp hipp hurra!
Hipp hipp hu... | 28,090 |
Hipp Hipp Húrra
Description:
## Input
The first line contains the name of a person celebrating
their birthday, the name only contains English letters and no
whitespace. The second line contains a single integer, how old
they are now.
## Output
If the person is now $x$ years old, print $x$ lines. Each li... | 28,091 |
Hipster Jazz
Description:
A new class has just started at jazz school, consisting of
$N$ students. Among them,
$M$ pairs of students are
friends. Each student has to pick an instrument to focus on
during their studies, either piano or saxophone. Of course, all
the students want to be very original ... | 28,092 |
Hired Help
Description:
Viv’s shoe repair company has seen a spike in demand. Today,
she has a backlog of shoes that need repairs. So Viv wants to
hire some people to assist with the extra work. According to
labour laws, each employee is not allowed to repair more than a
certain number of shoes (say $K... | 28,093 |
Hiring Help
Description:
A certain large unnamed software development company has
$n$ developers. The
productivity of each coder working for the company has been
rigorously measured in terms of two key performance indicators:
the number of lines of code they write per hour, and the number
of bugs t... | 28,094 |
Hiring and Firing
Description:
Unfortunately, due to labor laws, the firing of workers must
follow a last-in-first-out order: the people who have been
employed the shortest time must be fired first. Furthermore, a
fired person cannot be re-hired within the foreseeable future
so it is not possible to ci... | 28,095 |
Hissing Microphone
Description:
A known problem with some microphones is the “hissing s”.
That is, sometimes the sound of the letter s is particularly
pronounced; it stands out from the rest of the word in an
unpleasant way.
Of particular annoyance are words that contain the letter s
twice in a row. W... | 28,096 |
Histogrami
Description:
A histogram is a graphical representation of a statistical
distribution of data. In other words, it is a function that
assigns a positive integer value to each number in the interval
$0, 1, 2, \dots , W - 1$.
For this task, we describe a histogram with a series of points
in ... | 28,097 |
Historic Exhibition
Description:
The Benelux Artistic Pottery Consortium is preparing for an
exhibit of its most prized urns and vases at a gallery in
Nijmegen. Due to the sheer number of vases to be put on display
the gallery has trouble finding a pedestal of the right size
for every single vase. They... | 28,098 |
History of Beer Pong
Description:
Beer Pong is a popular drinking game between two teams. Each
team starts with $10$ cups and takes turns
throwing a ping pong ball into the opposing team’s cups. In the
very first round, the first team is chosen at random and throws
the ball once. In each of the followi... | 28,099 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.