task stringlengths 0 154k | __index_level_0__ int64 0 39.2k |
|---|---|
IsItHalloween.com
Description:
HiQ recently got an assignment from a client to create a
clone of the immensely popular website https://IsItHalloween.com. The
website is a very simple one. People will visit the site
occasionally to see if it is Halloween. Whenever it is, the
website should print out yup... | 28,300 |
Island Alliances
Description:
In a vast ocean there are $n$ islands numbered from $1$ to $n$, where each island constitutes a
sovereign state.
However, the large number of states is making foreign policy
a very complicated matter, so the inhabitants of the islands
have decided to simplify things by joinin... | 28,301 |
Island Buses
Description:
The Island Cargo and Passenger Company is planning to
provide bus service for a number of South Pacific island
nations. Each nation consists of a collection of islands, some
of which are connected by bridges. To save costs, the company
wants to use the fewest number of buses p... | 28,302 |
Island Hopping
Description:
You are a contractor for the small independent nation of
Microisles, which is far out in the Pacific ocean, and made up
of a large number of islands. The islanders travel between
islands on boats, but the government has hired you to design a
set of bridges that would connect... | 28,303 |
Island Memories
Description:
There is an island country that has $n$ islands numbered $1$ to $n$. The islands are connected by
$n - 1$ bidirectional
drawbridges, such that it is possible travel from each island
to every other island. Every drawbridge can be lifted to
provide clearance for boat traffic.... | 28,304 |
Island Tour
Description:
Unfortunately, current distancing measures only allow one
visitor at a time at any given attraction, so they have decided
to split up. Each person will start at a different attraction,
visiting the remaining attractions in circular order around the
Ring Road, i.e. a person star... | 28,305 |
Islands
Description:
Weenesia is an archipelago of perfectly circular islands in
the 2D plane. Many islands have palm trees growing in them,
perfectly straight up, so we can represent a tree by a 2D point
and a height.
We want to build a courier system in the islands, i.e., we
want to be able to move ... | 28,306 |
Islands
Description:
You are mapping a faraway planet using a satellite. The
planet’s surface can be modeled as a grid. The satellite has
captured an image of the surface. Each grid square is either
land (denoted as ‘L’), water (denoted
as ‘W’), or covered by clouds
(denoted as ‘C’). Clouds mean th... | 28,307 |
Islands from the Sky
Description:
You might never have heard of the island group of
Iceepeecee, but that suits their inhabitants just fine. Located
in a remote part of the South Pacific, they are truly off the
beaten track, without any regular air or sea traffic, and they
have remained a tropical parad... | 28,308 |
Islands in the Data Stream
Description:
Given a sequence of integers $a_1, a_2, a_3, \ldots , a_ n$, an
island in the sequence is a contiguous subsequence for which
each element is greater than the elements immediately before
and after the subsequence. In the examples below, each island
in the sequence... | 28,309 |
Isolated Island
Description:
On a small island far far away, a handful of old men live
isolated from the rest of the world. The entire island is
divided into plots of land by fences, and each old man owns a
single plot of land bounded by fences on all sides. (The region
outside all fences is the ocean.... | 28,310 |
Isomorphic Inversion
Description:
Let $s$ be a given
string of up to $10^6$
digits. Find the maximal $k$ for which it is possible to
partition $s$ into
$k$ consecutive contiguous
substrings, such that the $k$ parts form a palindrome. More
precisely, we say that strings $s_0, s_1, \dots , s_{k-1... | 28,311 |
Ispiti
Description:
It’s exam time in Mirko’s village. Everyone wants to pass
the exam with as little effort as possible, which is not easy.
Mirko realized that it would be best for him to find someone
who knows more than him and learn from them. Everyone followed
and now everyone is looking for someon... | 28,312 |
It Can Be Arranged
Description:
Every year, several universities arrange inter-university
national programming contests. ACM ICPC Dhaka site regional
competition is held every year in Dhaka and one or two teams
are chosen for ACM ICPC World Finals.
By observing these, MMR (Mission Maker Rahman) has made a... | 28,313 |
It's About Time
Description:
Greg Orian works for the Temporal Innovations for Multiple
Earths (TIME) program. One of his main jobs is determining
yearly calendars for the numerous human colonies on various
planets (did we mention this problem takes place in
$2123$?). One issue when
creating calend... | 28,314 |
It's Hip to Be Square
Description:
Suppose we have a certain number of red square tiles, all of
size $1 \times 1,$ that we
would like to place, without overlapping, to form the largest
two-dimensional square possible, such that the only gap is a
single $1 \times 1$ square
left empty in the middle. ... | 28,315 |
It's a Kind of Magic
Description:
Everyone knows that a $3\times
3$ magic square must meet two criteria:
* All nine numbers must be positive and distinct.
* The sums along all rows, columns, and diagonals are
equal.
All nine numbers must be positive and distinct.
The sums along all rows, columns, and d... | 28,316 |
It's a Mod, Mod, Mod, Mod World
Description:
You are given multiple problems with three integers
$p$, $q$, and $n$. Find $\sum \limits _{i=1}^ n [(p{\cdot }i) \bmod
{q}]$. That is, the first $n$ multiples of $p$, modulo $q$, summed. Note that the overall sum
has no modulus.
## Input
Each input will begin... | 28,317 |
It's a Secret
Description:
In junior high, you were fascinated by secret codes. When
you discovered the Playfair cipher, you shared the knowledge
with a friend, and the two of you started using the cipher in
order to pass notes in class without fearing that they would be
read if intercepted. Because yo... | 28,318 |
Item Selection
Description:
You are browsing a website that lists items for sale. The
website has a paging UI that displays a fixed number of items
per page, one page at a time.
For example, if there are $55$ items and the page displays
exactly $20$ at a time,
then there are $3$ pages
in total. It... | 28,319 |
Ivana
Description:
Even though she saw Zvonko steal Mirko’s microprocessor in
the second task, Mirko’s sister Ivana did not tell Mirko
because she likes Zvonko. She suggested to him that they go see
a movie together so that she would “forget” about the
incident.
Zvonko does not care much for girls bec... | 28,320 |
Jabuke
Description:
Ante bought a piece of land. The land contains N apple
trees, but his piece is triangular and it is not easy for him
to determine which apple trees belong to him.
Your program will be given the coordinates of the vertices
of the triangle forming Ante’s piece, and the coordinates of
... | 28,321 |
Jabuke
Description:
It is often heard that the apple doesn’t fall far from the
tree. But is that really so?
The National Statistics Department has tracked the falling
of apples in a fruit garden for $G$ consecutive years. The fruit
garden can be represented as a matrix with dimensions
$R \times S$. Ea... | 28,322 |
Jack The Lumberjack
Description:
Jack the Lumberjack used to love chopping down trees. Jack
is getting older and is becoming tired of this activity he used
to love. He thinks of an idea, ‘The Big One’, and fantasizes
about going out into the forest one last time to harvest as
many trees as possible.
J... | 28,323 |
Jack and Jill
Description:
Ever since the incident on the hill, Jack and Jill dislike
each other and wish to remain as distant as possible. Jack and
Jill must attend school each day; Jack attends a boys’ school
while Jill attends a girls’ school. Both schools start at the
same time. You have been retai... | 28,324 |
Jack and the Beanbag
Description:
Jack, naïve fellow that he is, has fallen into the clutches
of a dastardly and sophisticated multi-level marketing
scheme.
It all started when a mysterious stranger pushed upon young
Jack a bag of ordinary beans, promising that if only he could
amass the right quantit... | 28,325 |
Jack-O'-Lantern Juxtaposition
Description:
Every year, Pumpkin Pete comes up with a couple of different
Jack-O’-Lantern ideas for his annual Halloween special. He
stacks them up on haystacks for everyone to enjoy and take
pictures with. To make sure that there’s a wide variety of
displays, he wants to ... | 28,326 |
Jackdaws And Crows
Description:
A comment chain is alternating if the scores $s_1, s_2, \ldots , s_ n$ of the
comments all are non-zero, and every pair of adjacent scores
$s_ i$, $s_{i+1}$ have opposite signs. In
particular, a single comment with a non-zero score or even a
comment chain without any com... | 28,327 |
Jackpot
Description:
Bill has found the perfect way to make money playing the
slot machines. After months of careful research, he has finally
figured out the mechanics behind how the machines operate. Now
he is ready to make profit of his findings.
But first an introduction to the game. A slot machine
... | 28,328 |
Jail or Joyride
Description:
A group of teenagers has stolen a fast sports car for a
Saturday night joyride. The local police department has only
one car available to catch the teenagers red handed and put
them in a youth detention center.
The city consists of a set of junctions and bidirectional
road... | 28,329 |
Jailbreak
Description:
John is on a mission to get two people out of prison. This
particular prison is a one-story building. He has managed to
get hold of a detailed floor plan, indicating all the walls and
doors. He also knows the locations of the two people he needs
to set free. The prison guards are... | 28,330 |
Jamboree
Description:
A group of scouts are preparing to go to a large meeting
with other scouts. Their leader Hildeborg, in spirit of the
scout motto “be prepared”, wants to distribute some useful
items among the scouts that they most probably will need on
their adventure. The items come in different ... | 28,331 |
Jane Eyre
Description:
Anna wants to read the famous book Jane Eyre, but
annoyingly its title is somewhat late in the alphabet. This is
a problem, since Anna always reads books in alphabetical order;
as soon as she finish reading a book, she immediately begins
reading the next book in her possession wh... | 28,332 |
Janitor Troubles
Description:
The maximum quadrilateral problem is
quite easy to state: given four side lengths $s_1, s_2, s_3$ and $s_4$, find the maximum area of any
quadrilateral that can be constructed using these lengths. A
quadrilateral is a polygon with four vertices.
## Input
The input consists o... | 28,333 |
Jazz Journey
Description:
Ivan is planning a large European tour with his jazz band.
There are a total of $n$
cities in Europe, numbered with integers $1$ through $n$. Ivan is planning $d$ concerts in cities $a_1, a_2, \dots , a_ d$ in that exact
order, never having two consecutive concerts in the same cit... | 28,334 |
Jazz it Up!
Description:
Along with some friends you formed the Band of Atonal
Percussionists and Cellists. You have been playing for some
years together, but you feel unsatisfied with the current level
of play. Doing research into some interesting new styles, you
are gripped by the intricate details o... | 28,335 |
Jaðarjuð
Description:
For the last few years, the prospect of merging some of the
universities of Iceland has been considered. Finally, some
actual plans are being drawn about how this could be
implemented, but in order to make good plans the organising
committee needs some data on how the plans are lo... | 28,336 |
Jealous Youngsters
Description:
Tom has been studying the behavior of the kids and now
understands exactly under what circumstances they start crying.
First, a child will cry if they have no toy to play with.
Second, even having a toy, a child $A$ will cry if there is some other
child $B$ playing with
... | 28,337 |
Jednakost
Description:
While browsing a math book, Mirko found a strange equation
of the form $A=S$. What
makes the equation strange is that $A$ and $S$ are not the same. Mirko realized
that the left side of the equation should have addition
operations between some pairs of digits in $A$.
Write a prog... | 28,338 |
Jelly Raid
Description:
The full-board residents of the famous but misnamed
Adephagia School For Boys feel hard done by. Recent savings
have seen dinnertime puddings cut back to a single biscuit
while the masters finish their meals with fine raspberry jelly
every night. Although the choice of custard c... | 28,339 |
Jeopardised Journey
Description:
Little Red Riding Hood’s1 grandmother’s
hut is already quite old. It needs to be torn down and will be
replaced with a new hut. Naturally, she wants the hut to be as
safe as possible – nothing could be worse than Little Red
Riding Hood being eaten by the big bad wolf.
... | 28,340 |
Jet Lag
Description:
The ICPC World Finals are here and they are packed full of
activities you want to attend — speeches, presentations, fun
events, not to mention the contest itself. There is only one
problem: when are you going to sleep?
When you fall asleep, you always set a timer because
otherwise... | 28,341 |
Jet Set
Description:
Your wealthy friends love to brag about all their
travelling. Every time you see them, they have visited some new
exotic place you have never heard of. All of them are all too
happy to tell you they have been all around the
world—but you’re not so sure about that. Have these jetset... | 28,342 |
Jetpack
Description:
Little Mirko got a new mobile phone for his birthday! As all
kids nowadays, he quickly downloaded all of the popular mobile
games, including Jetpack Joyride.
In the game, the protagonist Barry is running across a field
consisting of $10$ rows
and $N$ columns of squares
of equa... | 28,343 |
Jewel Heist
Description:
Arsen Lupin, the master thief, aims to steal Evil Erwin’s
jewels. Erwin has n jewels on display in his store. Every
precious stone is of one of $k$ distinct colors. The exposition is
so large that we can treat it as the Euclidean plane with the
jewels being distinct points. The... | 28,344 |
Jewel Thief
Description:
The grand museum has just announced a large exhibit on
jewelry from around the world. In the hopes of his potential
future prosperity, the world-renowned thief and master criminal
Edward Terrenando has decided to attempt the magnum opus of his
career in thievery.
Edward is hop... | 28,345 |
Jewelry Box
Description:
Vy is obsessed with all the little pieces of jewelry and she
has collected so many of them. During her recent holiday trip,
she bought even more items so she needs a new jewelry box now.
She decided that she would make it on her own.
She bought a paperboard with very cute decorati... | 28,346 |
Jez
Description:
Luka found a very unusual game board in his attic.
Surprisingly, it consists of $R
\cdot C$ square cells. The rows are numbered
$0$ to $R-1$ top to bottom and the columns
$0$ to $C-1$ left to right.
What makes the board unusual is the way in which the cells
are coloured. Each cell... | 28,347 |
JezzBall
Description:
“JezzBall is a computer game in which red-and-white ’atoms’
bounce about a rectangular field of play. The player advances
to later levels (with correspondingly higher numbers of atoms
and lives) by containing the atoms in progressively smaller
spaces, until at least $75\%
$ of... | 28,348 |
Jib Job
Description:
After last year’s success of building an infinite wall, Bob
was hired for a new job. His first task is to set up multiple
cranes on a new construction site.
Each crane consists of a central tower with a horizontal
beam (the jib) attached to the top that can freely
rotate around th... | 28,349 |
Jigsaw
Description:
You have found an old jigsaw puzzle in the attic of your
house, left behind by the previous occupants. Because you like
puzzles, you decide to put this one together. But before you
start, you want to know whether this puzzle was left behind for
a reason. Maybe it is incomplete? Mayb... | 28,350 |
Jigsaw Present
Description:
James is already very excited and would like to know in
advance what he will get. Therefore, he used some of his
criminal energy to gather information about the gift. In
particular, he has managed to obtain an encrypted message
containing the total difficulty and total numbe... | 28,351 |
Jinxed Betting
Description:
Julia is betting on a large sporting competition involving
matches between pairs of teams. There are no parallel matches
and each bettor receives one point for every correct bet they
make. Julia had a good streak and is in the lead. Now she
worries that her good luck may be ... | 28,352 |
Job DNA
Description:
For hundreds of years, people have been dissatisfied with
their jobs. Maybe they are too boring, too difficult or simply
not right for some reason. After much research, JobAgent has
successfully modeled how good you are at a job using a circular
string of length $N$, your
so-ca... | 28,353 |
Job Expenses
Description:
At ACME Corp, the seller Robin is selling software like
hotcakes. To sell the software, he arranges meetings all over
the country. Of course, he always needs to travel there, and
sometimes even stay the night. Other times, he decides that a
hot dog on the way to a meeting coun... | 28,354 |
Job Postings
Description:
Your university has jobs available for students, and the
administration needs for you to help them assign students to
jobs. The goal is to have students select their desired
positions, and then allocate each student to one of the
positions so that the maximum satisfaction is a... | 28,355 |
Job Switching
Description:
You and your friends all work at different companies.
However, not everyone may be satisfied with their current job.
You therefore asked JobAgent to find out if there’s a job that
fits you even better. After some computation, JobAgent came
back with a list for which job is th... | 28,356 |
Jobs
Description:
You have a successful business where you make money by
completing jobs for your clients. Currently, you can choose
from $N$ one-time jobs,
numbered from $1$ to
$N$.
Completing job $i$ will
make you a profit of $x_
i$ euros. The profit may also be negative ($x_ i < 0$).
Some ... | 28,357 |
Joe is learning to speak
Description:
Joe is a 4-year-old child learning to speak his mother
tongue. He tried to memorize every possible sentence in the
language but he soon realized that the number of different
sentences is unbounded. He decided to concentrate on memorizing
the subsequences of size up... | 28,358 |
Jogging Tour
Description:
You may know that in the 17th century, a group of Dutchmen
founded a settlement called New Amsterdam on Manhattan Island
that later went on to become New York City. Less well-known is
the story of another group of Dutchmen that also moved over to
America and founded a city cal... | 28,359 |
Jogging Trails
Description:
Gord is training for a marathon. Behind his house is a park
with a large network of jogging trails connecting water
stations. Gord wants to find the shortest jogging route that
travels along every trail at least once.
## Input
Input consists of several test cases. The first li... | 28,360 |
Jogurt
Description:
A complete binary tree is made of nodes arranged in a
hierarchic structure. One of the nodes is the root node, said
to be at level 0. The root node has two child nodes, which are
at level 1. Each of those has two children at level 2 etc.
In general, a complete binary tree with $N$ leve... | 28,361 |
John Dillermand
Description:
For most episodes, this task has been adequately performed
by training your university’s machine-learned information
curation algorithms to remove red and white pixels from
individual frames. However, the Christmas episode S1E11,
John redder julen, needs more attention. Man... | 28,362 |
John's Book Stack
Description:
John has a big stack of books of various sizes. Such a stack
is stable if the books have non-decreasing sizes (viewed from
top to bottom); otherwise, it is unstable, and likely to fall
over.
To prevent this, John wants to sort the books in the stack
by size. He does so b... | 28,363 |
Johnny Applesack
Description:
Johnny Applesack has grown his seeds into trees and
harvested all the apples. He has a huge pile of $N$ apples next to him, a sack that
can hold $K$ apples at a
time, and an infinitely long, straight road in front of him. At
each kilometer mark of the road there is a toll ... | 28,364 |
Johnny5 and the Exploding Oil Cans
Description:
In the hit video game “Johnny5 and the Exploding Oil Cans”,
you control the robot “Johnny5”. The robot can be moved one
cell at a time in one of the directions up, down, left, or
right on an $N \times N$
grid. One move takes one second and costs one unit ... | 28,365 |
Join Strings
Description:
You are given a collection of $N$ non-empty strings, denoted by
$S_1, S_2, \ldots , S_ n$.
Then you are given $N$-$1$ operations which you execute in
the order they are given. The $i^{th}$ operation is has the
following format: ‘$a$
$b$’ ($1$-based indexing, without the
qu... | 28,366 |
Joining Flows
Description:
The heart of the factory is the Chocolate River, where raw
molten chocolate flows from $k$ chocolate-producing faucets, to
outlets where different types of pralines and choclate bars are
made. The $i$’th of the
$k$ chocolate faucets
produces chocolate at some fixed temper... | 28,367 |
Joining Networks
Description:
A network of size $N$
contains $N$ computers
connected by $N-1$ cables,
so that there is exactly $1$ path between any pair of
computers.
The transmission cost between $2$ computers is equal to the square
of the number of cables on the path connecting the $2$ computers... | 28,368 |
Joining Points
Description:
You have $N$ points on
a Cartesian coordinate plane. The $i$-th point is located at
$(X_ i, Y_ i)$, where
$X_ i$ and $Y_ i$ are integers.
As a competitive programmer, you hate non-rectilinear
geometrical objects. Therefore, you wish to connect all the
points such that t... | 28,369 |
Joint Attack
Description:
General Torstein has sent the $x$-coordinate for the next joint
attack and is expecting you to promptly follow his orders in
order to avoid impeding doom. Unfortunately Torstein hates
numbers with more than 2 digits and loves horizontal line
segments, and has therefore sent th... | 28,370 |
Joint Excavation
Description:
As an initial quick demonstration, mother mole is going to
start by digging out a few of the chambers and tunnels, in the
form of a non-self-intersecting path in the planned tunnel
network. She will then divide the remaining chambers between
the two mole kids, making sure ... | 28,371 |
Joint Jog Jam
Description:
Like so many good stories, this one begins with a claim that
Kari is a faster runner than Ola, who of course challenges Kari
to a run-down. Dubbed (rather ironically) Non-Competitive Pace
Challenge, they want to see who can run the furthest in a
certain amount of time $t$. Cl... | 28,372 |
Jolly Jumpers
Description:
A sequence of $n >
0$ integers is called a jolly jumper if the absolute
values of the difference between successive elements take on
all the values $1$ through
$n-1$. For instance,
```
1 4 2 3
```
is a jolly jumper, because the absolutes differences are
$3$, $2$, and $1... | 28,373 |
Journal Editing
Description:
David is writing an article for the Bulletin of the
Association of Proof Completions. In his article, he proves
several theorems. For every theorem, David came up with a
proof. Since David is a very eager student, he even came up
with multiple proofs for some of the theorem... | 28,374 |
Journey of the Repetitor
Description:
After watching the novel “Around the World in Eighty Days”,
Alice becomes enthusiastic in travelling abroad. However, due
to the lack of flights during the COVID-19 pandemic, Alice
decides to travel around the world on foot!
However, Alice is suffering from decidophob... | 28,375 |
Joyless Game
Description:
Playing games is the best way to improve flexibility,
critical thinking and strategy.
To become the best Pokenom player, Bash is playing some
games with his Pokenom Chikapu.
* Bash writes down a string $S$ containing only lowercase
English letters. No $2$ consecutive charact... | 28,376 |
Judging Moose
Description:
The point system works like this: If the number of tines on
the left side and the right side match, the moose is said to
have the even sum of the number of points. So, “an even
$6$-point moose”, would
have three tines on each side. If the moose has a different
number of t... | 28,377 |
Judging Troubles
Description:
## Input
The input consists of:
* one line with one integer $n$ ($1\leq n \leq 10^5$), the number
of submissions;
* $n$ lines, each
with a result of the judging by DOMjudge, in arbitrary
order;
* $n$ lines, each
with a result of the judging by Kattis, i... | 28,378 |
Judo Championship
Description:
There are $n$ judokas
participating in the judo championship. Each judoka is assigned
a unique number from $1$
to $n$. There are
currently $m$ scheduled
matches. The $i$-th match
is between judokas $u_ i$
and $v_ i$.
A judoka $s$ will say
that they are st... | 28,379 |
Jug Hard
Description:
You have two empty jugs and tap that may be used to fill a
jug. When filling a jug from the tap, you can only fill it
completely (i.e., you cannot partially fill it to a desired
level, since there are no volume measurements on the jug).
You may empty either jug at any point.
You may... | 28,380 |
Juggler
Description:
As part of my magical juggling act, I am currently juggling
a number of objects in a circular path with one hand. However,
as my rather elaborate act ends, I wish to drop all of the
objects in a specific order, in a minimal amount of time. On
each move, I can either rotate all of t... | 28,381 |
Juggling
Description:
Ada the bartender wants to enhance her already impressive
range of showmanship by incorporating juggling into her act.
The first thing to learn is the siteswap notation for
juggling patterns, also known as Cambridge
notation.
The notation describes juggling patterns in which ball... | 28,382 |
Juggling Patterns
Description:
Juggling patterns are notated by a system called siteswap.
Siteswap patterns look like strings of digits, like this:
‘$3$’, ‘$441$’, ‘$345$’, etc. Each number represents
the time duration of a throw (how long it is in the air). For
example, a $5$ throw is
higher than ... | 28,383 |
Juggling Sequence
Description:
The Juggling Sequence is an integer
sequence with $n$
elements, defined as follow:
* $a_1 = 1$,
* For every $i \geq
1$:
If $a_ i \leq
i$, then $a_{i+1}
= a_ i + i$,
If $a_ i >
i$, then $a_{i+1}
= a_ i - i$.
* If $a_ i... | 28,384 |
Juggling Troupe
Description:
At the national centre for computing and advanced circus
skills, technical demonstrations by students are strongly
encouraged.
A troupe of $n$ novice
performers are at this very moment arrayed in a row attempting
to put on a juggling show. Unfortunately, none of them are v... | 28,385 |
Juice
Description:
In the Favela of Rio de Janeiro there was a flicker of
light. After months of careful building, they finally connected
the generator to the thousands of extension cords and the slum
was illuminated by millions of bright lights
However, the capacity of the extension cords was not enough
... | 28,386 |
Juice
Description:
You are holding a party. In preparation, you are making a
drink by mixing together three different types of fruit juice:
Apple, Banana, and Carrot. Let’s name the juices A, B and
C.
You want to decide what fraction of the drink should be made
from each type of juice, in such a way t... | 28,387 |
Julmust
Description:
Maj is a creature of habit. She consumes exactly the same
number of bottles of julmust every day from the 1st of October
until Christmas Eve (the 24th of December). The number of
bottles per day is a positive integer $r$, where $0 < r \leq R$.
You need to determine the total number of... | 28,388 |
Jumbled Communication
Description:
Luckily, the document also describes how the sensor
scrambles its communication. The document states that the
sensor applies the expression x ^ (x << 1) to
every byte sent. The ^ operator is bit-wise
XOR1, e.g., $\verb|10110000 ^ 01100100| =
\verb|11010100|$. The ... | 28,389 |
Jumbled Compass
Description:
The compass gives the current direction the phone is
pointing and Jonas’ task is to animate the needle taking the
shortest path from the current needle direction to the
correct direction. Many ifs, moduli,
and even an arctan later, he is still not convinced his
minimumD... | 28,390 |
Jumbled Journey
Description:
Together with some friends you are planning a holiday to the
Beautiful Authentic Parks Centre. While there, you want to
visit the parks as much as you can. As part of the preparation
you, together with your best friend, decided to make an
extensive map of the parks, the roa... | 28,391 |
Jumbled String
Description:
Jingfei wants to create a nonempty bit string that has the
following properties:
* the subsequence 00 occurs
$a$ times,
* the subsequence 01 occurs
$b$ times,
* the subsequence 10 occurs
$c$ times, and
* the subsequence 11 occurs
$d$ times.
the subse... | 28,392 |
Jumbo Javelin
Description:
Jessica wants to become a javelin thrower, moreover she
wants to become a famous one. However, she doesn’t want to
train $40$ hours a day. To
avoid much training while still becoming famous, she has
concocted a plan: make all her javelins gigantic.
As a software developer by... | 28,393 |
Jumper
Description:
You lost your favourite jumper during last night’s pub crawl
with your fifteen friends. You remember very little, but thanks
to some selfies on your phone you have been able to identify a
pub $p$ where you
already lost the jumper. Moreover, from another selfie’s
timestamp it is ... | 28,394 |
Jumping Choreography
Description:
As you may know, the frogs are the biggest show-offs of the
entire animal kingdom. Some weeks ago, they greatly impressed
the other animals by forming a large tower. However, the frog
king wants to surpass this performance at the next Benelux
Amphibian Pillaring Ceremo... | 28,395 |
Jumping Monkey
Description:
You are a hunter chasing a monkey in the forest, trying to
shoot it down with your all-powerful automatic machine gun. The
monkey is hiding somewhere behind the branches of one of the
trees, out of your sight. You can aim at one of the trees and
shoot; your bullets are capab... | 28,396 |
Jumping Yoshi
Description:
Yoshi is a frog. He lives in the ZOO under a log which was
specially transported there from a distant equatorial
rainforest. The log is big and wet and attracts the flies and
that is what makes Yoshi satisfied.
There is also a line of pebbles which runs through the
wetland i... | 28,397 |
Jungle Game
Description:
Denise is designing a rainforest themed board game. The goal
of the game is for each player to form a team of two characters
and complete various challenges.
There are $N$ different
characters numbered from $1$ to $N$. Each character $i$ has two attributes $p_i$ and $s_i$ (problem... | 28,398 |
Junk Journey
Description:
You are MALL-E, the mall scooter scooper robot. Your job is
to fetch all the misplaced mall scooters at the end of the day
and return them to the scooter depot. The mall is an infinite
grid, containing $n$
scooters that need to be returned. You can move in one of four
dire... | 28,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.