task stringlengths 0 154k | __index_level_0__ int64 0 39.2k |
|---|---|
Bitcoin Toss
Description:
But, Yraglac has an idea; no, it does not include tossing
virtual coins, the problem title is misleading in that sense.
Instead, he will print out all the possible outcomes of tosses
of $N$ coins (as a string
of Tails and Heads), put them into a hat and
get someone to draw... | 26,500 |
Bitmask
Description:
Masking greatly reduces the transmission of certain viruses.
This is true for computer viruses as well. In order to protect
binary data from infection, we must cover it up with masks!
Binary data can be represented as a string of $n$ $0$s and $1$s. A bitmask can be used to cover a
por... | 26,501 |
Bitonic Ordering
Description:
Noah suggests the following card game: You are given a deck
of cards, each with a distinct positive integer value written
on it. The cards are shuffled and placed in a row. Your
objective is to arrange the cards in the row so that the values
are monotonically increasing in... | 26,502 |
Bits
Description:
As we all know, it takes more energy to store binary numbers
with lots of ones in them. Yraglac’s calculator has some
batteries that are almost dead, and he’s concerned that the
battery may run out as he types in a number.
The way the calculator processes numbers being entered is as
... | 26,503 |
Bits Equalizer
Description:
You are given two non-empty strings $S$ and $T$ of equal lengths. $S$ contains the characters
‘0’, ‘1’
and ‘?’, whereas $T$ contains ‘0’ and ‘1’ only. Your
task is to convert $S$
into $T$ in minimum number
of moves. In each move, you can
* change a ‘0’ in $S$ to ‘1’,
*... | 26,504 |
Bitte ein Bit
Description:
The city of Bitburg in Rhineland–Palatinate, Germany, is
home to the Bitburger Brewery founded in 1817. Since 1951, the
company slogan is, “Bitte ein Bit,” literally, “A Bit,
please.”
Given some bits, output one of them.
## Input
The input consists of a single line of $n$ bits... | 26,505 |
Bitwise
Description:
Barr the Bear is playing the game Bits with Swanky Shen!
Bits is a very simple game. At the start, a circle of
$N$ non-negative integers
$A_1$, $A_2$, $A_3$, $\ldots $, $A_ N$ is shown to both players. That
is, to the left of the integer $A_ i$ is the integer $A_{i-1}$ if $i > 1$; and... | 26,506 |
BizzFuzz
Description:
Algot was just at an interview at a software company and had
to solve the classic FizzBuzz problem. It consists of printing
the integers from 1 to 100, but replacing each integer
divisible by 3 to "Fizz", each divisible by 5 to "Buzz" and
each divisible by both to "FizzBuzz".
He ... | 26,507 |
Bið, endalaus bið
Description:
Svala has been waiting for forever and the wait barely
shortens, it seems. She looked at the clock quite a while ago
so she’s going to check what the time is. Svala doesn’t know
how to read the time off a clock though, can you help her and
tell her how many minutes have p... | 26,508 |
Bjagað Beðaltal
Description:
At the end of every programming contest, statistics and fun
facts are collected to show the contestants afterwards. Often
average number of solves, or average number of tries to solve a
given problem are calculated. Allegedly, someone at the
statistics department said that ... | 26,509 |
Black Friday
Description:
Black Friday is the Friday following Thanksgiving Day in the
United States (the fourth Thursday of November). Since the
early 2000s, it has been regarded as the beginning of the
Christmas shopping season in the US, and most major retailers
open very early and offer promotional... | 26,510 |
Black Out
Description:
When you’ve finished solving all problems in this contest,
there’s no need to get bored, be- cause we introduce a new and
fun game called Black Out! Grab a piece of paper and draw a
table of 5 by 6 squares. Next, choose your favorite teammate to
play against. Each player in turn ... | 26,511 |
Black Vienna
Description:
Black Vienna is a puzzle game where players try to
deduce the secret identities of the three spies. There are
$26$ suspects, represented
by cards with a single letter from ‘A’ to ‘Z’. Suspect
cards are shuffled and three are secretly set aside; these form
the Black Vienna ... | 26,512 |
Black and White
Description:
Black and White is a Chinese
children’s game played in rounds. During each round, the
children who are playing all put their hands in either face-up
(“White”) or face-down (“Black”). If all the children but one
make the same choice, then the “odd one out” sits out for the
... | 26,513 |
Blackboard Numbers
Description:
Your maths teacher, Professor Prime, likes writing integers
on the blackboard at the end of class. You have been taking
notes all semester, and have noticed two things:
* There is an equal chance of the number being written in
binary, octal, decimal, and hexadecimal.
*... | 26,514 |
Blacksmith Training
Description:
Zapray is playing the game World of Warcraft Classic. In the
game he needs to train his blacksmith skill from level
$0$ to level $300$. He will improve his blacksmith
skill by crafting items described in blacksmith plans.
Blacksmith plans are taught by trainers around the ... | 26,515 |
Blandað Best
Description:
Níels is at his favourite kebab place, KFFÍ (Kebab Fyrir
Forritara á Íslandi) and now he needs to decide what type of
meat he wants on his kebab. KFFÍ offers a wide range of
options, a whole two different types, beef or chicken. If you
are like Níels, you always prefer getting... | 26,516 |
Blazing New Trails
Description:
Your state has just purchased a large, unspoiled tract of
land, and wishes to turn it into a nature park with hiking
trails. The land has $n$
places of interest to which guests may wish to hike, and of
these, $k$ are very
special. The state wishes to connect these pl... | 26,517 |
Blaðra
Description:
In Forritunarkeppni Framhaldsskólanna all teams get a
balloon for each problem they solve, the balloons being
different colours depending on what problem was solved.
This year there will be $k$ problems. Thus $k$ employees will be needed to
inflate balloons. Each employee will inflate ... | 26,518 |
Blaðra
Description:
The common element of birthdays and programming contests are
the balloons. You have arrived to the 20 year anniversary of
Forritunarkeppni Framhaldsskólanna. There you receive a really
neat balloon.
OH NO!
You lose your grip on the balloon and it floats upwards. If
you find a long... | 26,519 |
Bless You Autocorrect!
Description:
The autocorrect feature on Jenny’s phone works like this:
the phone has an internal dictionary of words sorted by their
frequency in the English language. Whenever a word is being
typed, autocorrect suggests the most common word (if any)
starting with all the letters... | 26,520 |
Bling
Description:
Each fruit can be sold for $100$ Bling, or planted to become a
fruit tree (but not both). Every three days, starting on the
third day after it was planted, a fruit tree yields three new
fruits.
There are also some more exotic fruits that can be bought
from the neighboring village. O... | 26,521 |
Blobs of Doom
Description:
The Mischievous Troublemakers’ Association (MTA) has hatched
a sinister plot for world domination! All through the night,
the Troublemakers work tirelessly, arranging rocks in the shape
of hideous, misshapen blobs on the lawns of the unsuspecting
residents of Quackville. For ... | 26,522 |
Block Crusher
Description:
You are responsible for testing the compressive strength of
various composite materials. You take a rectangular block,
crush it from the sides and see where it beaks. This is hard
work, and it’s dirty, so you decide to write a simulator to get
yourself some help.
Computation... | 26,523 |
Block Game
Description:
You are attending the International Construction by
Preschoolers Contest. Unfortunately, you are too old to
participate, but you still enjoy watching the competition.
In between rounds, you are walking around the contest area
when you see a toddler, one of the contestants, playing ... | 26,524 |
Blocks on Blocks
Description:
If you know the game tetris, you may be familiar
with the following figures:
These figures contains rows of squares. In each row, squares
are consecutive. Adjacent rows share at least one side of a
square, so the following figures are not allowed:
Given the number of squares... | 26,525 |
Blokovi
Description:
$N$ rectangles with
given masses $m_1, m_2, \ldots ,
m_ N$, fixed length $l =
2$ and height $h$
are arranged in a Cartesian plane such that:
* rectangle edges are parallel to the coordinate axes;
* the $y$-coordinates
of the lower horizontal edges are distinct and assume ... | 26,526 |
Blooper Game
Description:
Mario is competing in the most important elimination game of
his entire life. He has been given a dalgona cookie, which is a
cookie made out of caramelized sugar, that has a shape with
$N$ sides etched into its
surface. He also have a sewing needle that he is using to cut
... | 26,527 |
Blowing Candles
Description:
As Jacques-Édouard really likes birthday cakes, he
celebrates his birthday every hour, instead of every year. His
friends ordered him a round cake from a famous pastry shop, and
placed candles on its top surface. The number of candles equals
the age of Jacques-Édouard in ho... | 26,528 |
Blueberry Waffle
Description:
You are using a waffle maker machine to make a delicious
blueberry waffle. One side of your waffle is covered in
blueberries, while the other side is plain. Initially, the
cooking pan of the waffle maker lies horizontally, and the
blueberries are on the top side of the waf... | 26,529 |
Bluetooth
Description:
King Harold of Denmark (c. 998–1098) wants to eat an apple
to celebrate the founding of the town Lund. Harold’s teeth are
in terrible condition; some are missing, some are rotten and
discoloured, earning him the nickname “Bluetooth.”
Harold can chew the apple on the left or the righ... | 26,530 |
BnPC
Description:
You are playing your favorite game, Basements and Pigeonlike
Creatures, for the umpteenth time. You know the game pretty
well, but you have never spent enough time on it to figure out
the best strategy. That is, until now. The game consists of a
certain sequence of events, such as bat... | 26,531 |
Board Coloring
Description:
One day you were visiting a museum where you saw a modern
piece of art that shows a grid of $N$ rows and $M$ columns. Each cell in the grid has
a color, which can be one of the four: red (‘R’), green (‘G’),
blue (‘B’), and white (‘W’).
You think that the art is so simple so tha... | 26,532 |
Board Covering
Description:
Given a board with $M$
rows and $N$ columns. A
cell at the $i^{th}$ row
from the top and the $j^{th}$ column from the left is
denoted by $(i, j)$. Each
cell of the board is one of $3$ types:
* A blocked cell.
* An empty cell.
* A number in range $[1,
9]$.
A b... | 26,533 |
Board Wrapping
Description:
The small sawmill in Mission, British Columbia, has
developed a brand new way of packaging boards for drying. By
fixating the boards in special moulds, the board can dry
efficiently in a drying room.
Space is an issue though. The boards cannot be too close,
because then the... | 26,534 |
Boastin' Red Socks
Description:
You have a drawer that is full of two kinds of socks: red
and black. You know that there are at least $2$ socks, and not more than
$50\, 000$. However, you
do not know how many there actually are, nor do you know how
many are red, or how many are black.
You have noticed... | 26,535 |
Boat Parts
Description:
Boating season is over for this year, and Theseus has parked
his boat on land. Of course, the boat looks nothing like it did
as of the beginning of the season; it never does. You see,
Theseus is constantly looking for ways to improve his boat.
At every day of the boating season, Th... | 26,536 |
Bob
Description:
Little Bob is a famous builder. He bought land and wants to
build a house. Unfortunately, the problem is the land’s
terrain, it has a variable elevation.
The land is shaped like a rectangle, $N$ meters wide and $M$ meters long. It can be divided
into $N\cdot M$ squares
(see the image)... | 26,537 |
Bobby's Bet
Description:
Bobby and Betty have a bet. Betty bets Bobby that he cannot
roll an $S$-sided die
(having values $1$ through
$S$) and obtain a value
$\ge R$ on at least
$X$ out of $Y$ rolls. Betty has a variety of dice
with different numbers of sides $S$, and all her dice are fair (for... | 26,538 |
Bocchi's Rocks
Description:
Bocchi has a collection of $N$ rocks of differnet weights. For
each rock in her collection, Bocchi wants to know the amount of
the other rocks that weigh less than the actual rock.
## Input
First row consists of a single integer, $N$ $(1
\leqslant N \leqslant 2\cdot 10^5)$, am... | 26,539 |
Bog of Eternal Stench
Description:
You are trying to reach the center of a Labyrinth, which
means you must cross the Bog of Eternal Stench. Legend says
that if you put so much as one toe in the Bog you will smell
bad... forever. You would of course prefer to make it through
the Bog with the minimum lev... | 26,540 |
Boggle
Description:
I am sure, you are a big fan of the board game
“Boggle”. Don’t worry if you are not familiar with the
rules, I will explain them to you. A Boggle is a $4 \times 4$ grid of letters where
your job is to find as many words as you can. If I play Boggle
with (or against) my wife, she alw... | 26,541 |
Boiling Vegetables
Description:
The trick to boiling vegetables is to make sure all pieces
are about the same size. If they are not, the small ones get
too soft or the large ones get undercooked (or both).
Fortunately, you have heard of the kitchen knife, but your
parents’ warnings of using sharp instr... | 26,542 |
Bokstavstärningar
Description:
Klara has $N$ dices
with letters written on them. Each die has a letter on each of
its $K$ sides. By throwing
the dice and rearranging them in some arbitrary order, you can
make construct a word with $N$ letters.
Write a program to count the number of valid words that ca... | 26,543 |
Bolir
Description:
One of the most fun parts of competing in a programming
contest is of course getting a shirt. But this year the
planning committee has messed everything up…When a contestant
registers for the contest they register their shirt size as
well. But this data got lost so the committee inst... | 26,544 |
Bomas
Description:
You are a manager of a zoo. The zoo is a collection of
enclosed areas formed by circular fences (known as bomas). The
bomas do not intersect nor do they touch, but they can nest.
You may choose not to use all of the zoo’s areas for holding
animals at a given time (to prepare for futu... | 26,545 |
Bombardment
Description:
You are designing an old-school game you call
Bombardment where the goal is to destroy a number of
points by bombarding them. You do not yet know the theme of
your game, just that the core mechanics should involve a
bombardment.
The points to be destroyed are located on the re... | 26,546 |
Bona Fide
Description:
“Never attribute to malice that which is
adequately explained by stupidity.” –Robert Hanlon.
A well-known trendsetter from a faraway land once needed
strings with certain palindromic
properties for inspiration. Unable to produce them all herself,
she decided to outsource the wo... | 26,547 |
Bonbons
Description:
Ylva loves bonbons, probably more than anything else on this
planet. She loves them so much that she made a large plate of
$R \cdot C$ bonbons for
her fikaraster1.
Ylva has a large wooden tray which can fit $R$ rows of $C$ bonbons per row, that she will put
the bonbons on. Her bon... | 26,548 |
Bond
Description:
Everyone knows of the secret agent double-oh-seven, the
popular Bond (James Bond). A lesser known fact is that he
actually did not perform most of his missions by himself; they
were instead done by his cousins, Jimmy Bonds. Bond (James
Bond) has grown weary of having to distribute ass... | 26,549 |
Bonsai
Description:
Many people love to grow bonsai trees because they say that
it is “difficult” and “harmonious”. That’s not why Torstina
grows bonsai trees. She only wants to sell them and make lots
of money so she can buy lots of cherimoya. She has just planted a new nodule and
is really craving ch... | 26,550 |
Book Circle
Description:
A couple of computer science students have decided to start
a book circle, in which they will be able to share the passion
of their lives, namely reading. Finally, the first season of
reading is coming to its end, and the students in the book
circle are going to present their f... | 26,551 |
Book Club
Description:
Porto’s book club is buzzing with excitement for the annual
book exchange event! Every year, members bring their favorite
book and try to find another book they like that is owned by
someone willing to trade with them.
I have been to this book exchange before, and I definitely
d... | 26,552 |
Book Shelves
Description:
You are going to buy book shelves to put all your books in.
You already know how many books you have and need to count the
number of book shelves required. The books have three sizes: a
small book has width $1$,
a medium book width $2$
and a big book width $3$.
Each sh... | 26,553 |
Booking
Description:
Pierre is in great trouble today! He is responsible for
managing the bookings for the ACM (Accomodation with Moderate
Costs) hotel and has just realized that the booking software
has a severe bug. It has created overlapping and wrong room
assignments. Pierre is now worried that the... | 26,554 |
Booking a Room
Description:
In this problem, you should write a program to search for
available rooms in a given hotel. The hotel has $r$ rooms, numbered from $1$ to $r$, and you will be given a list
describing which of these rooms are already booked.
## Input
The input consists of:
* one line with two inte... | 26,555 |
Bookshelf Bottleneck
Description:
Brianna is a bookworm. At home, she has a big bookshelf with
all her favourite books. She has a large collection ranging
from detective novels and science-fiction novels to
biographies.
Recently, Brianna has expanded her collection with
$n$ graphic novels.
However... | 26,556 |
Bookshelf Building
Description:
Anna just came home from her favourite furniture store
Ikey Yeah! where she bought a new
bookshelf designed by her favourite artist Bill Lee. The shelf has a rectangular shape with
a width of $x$ and a
height of $y$. Included in
the box of the shelf is one board th... | 26,557 |
Boom!
Description:
Blowing things up usually requires careful planning,
something Luntas is not especially good at. He has randomly
thrown a number of bombs on his backyard, which can be seen as
a grid of width and height $N$. Now he only has one bomb left,
which he intends to use to start the explosio... | 26,558 |
Booming Business
Description:
You are an expert in bonsai, the Japanese art of cultivating
small trees in small containers. Every year, you win the Bonsai
Association’s Pruning Competition (BAPC). With all this talent,
it would be a shame not to turn your hobby into your job.
Recently, you have rented ... | 26,559 |
Bootstrapping Number
Description:
Neelix has been working on making the Altonian warp bubble
power itself up. While waiting for the system checks to
complete, he saw a number on his screen and wondered if there
is a number that powers itself up to this number.
## Input
The first and only input line consi... | 26,560 |
Borders
Description:
Consider a black and white image, where every pixel has a
value of either 0 or 1. Define a region of the image as a
collection of pixels that all have the same value, and are
interconnected. Specifically, for any two pixels in a region,
there is a path between them only going up, d... | 26,561 |
Boredom Buster
Description:
It goes like this: You have a shuffled deck of $n$ cards, where $n$ is even and each card contains a
number from $1$ to
$n/2$. There are exactly
two cards of each number. The cards are laid face down on the
table and your goal is to find what number is written on each
of... | 26,562 |
Borg Boogie
Description:
On the Borg ship there is also a sentry, placed there by the
Borg eons ago. This sentry operates according to a rather
unsophisticated algorithm, namely walking at random. This gives
the sentry one advantage, however: You will never know where it
is! More precisely, once every ... | 26,563 |
Borðspil
Description:
Arnar and Unnar recently bought a new board game. In the
game Arnar gets $n$ pieces
and Unnar gets $m$ pieces.
You can place pieces in three different spots. Arnar starts by
distributing all his piece on the spots and then Unnar does the
same. For each spot if Unnar has more p... | 26,564 |
Boss Battle
Description:
You are stuck at a boss level of your favourite video game.
The boss battle happens in a circular room with $n$ indestructible pillars arranged
evenly around the room. The boss hides behind an unknown
pillar. Then the two of you proceed in turns.
* First, in your turn, you can thr... | 26,565 |
Bottle Flip
Description:
After many failed attempts, we noticed that this task gets
significantly easier if the bottle is filled with just the
right amount of water. The simple reason for this is that the
amount of water affects the centre of mass of our bottle as it
is about to land.1 A lower centre
... | 26,566 |
Bottle Opening
Description:
The crown cork bottle stopper, used to seal beer bottles,
was the first highly successful disposable product. It was
invented by William Painter in 1892 in Baltimore; the product’s
disposability and success inspired King C. Gillette to invent
the disposable razor when he was... | 26,567 |
Bottled-Up Feelings
Description:
Peter is expecting a large shipment of fuel oil, but he has
a small problem (doesn’t everyone in these programming
problems!). The only containers he has are a set of large
bottles (each with the same volume) and a set of smaller
bottles (also each with the same, but sm... | 26,568 |
Bounding Box
Description:
The Archeologists of the Current Millenium (ACM) now and
then discover ancient artifacts located at vertices of regular
polygons. (Recall that an $n$-sided regular polygon is a polygon
where all $n$ sides have
the same lengths, and the $n$ internal angles where two sides
m... | 26,569 |
Bounding Robots
Description:
As you design your new household helper robot, the
SERVE-O-MATIC 1000, you are running it through a number of
tests. In one test, you want to make sure that it always knows
where it is. In particular, you’re concerned about the
situation where the robot runs into a wall tha... | 26,570 |
Bouquet
Description:
After visiting Keukenhof, one of the world’s largest flower
gardens, Lieke became very fond of flowers, so she has decided
to collect some tulips growing next to the road in order to
build a beautiful bouquet. However, when collecting the
flowers, she has to respect some rules due ... | 26,571 |
Bowlstack
Description:
Baking bread is my favourite spare-time pursuit. I have a
number of stainless steel mixing bowls with straight sides, a
circular bottom and a wider circular top opening.
Geometrically, my bowls are truncated circular cones and for
this problem, the thickness of the metal may be
... | 26,572 |
Bowser's Pipes
Description:
Princess Peach is in trouble again! Of course, Mario is on a
quest to rescue her from Bowser. To save her, he has to collect
a number of coins located in coin rooms under the surface. To
get to a coin room, he must enter pipes on the surface which
send him to a room below.
... | 26,573 |
Box and Arrow Diagram
Description:
In this part of the exam you are given a piece of Python
code and you have to draw how the memory structure will look
like when the program reaches a given line. Since Itaf is a
high-rated competitive programmer her ego always came in the
way whenever she tried to stu... | 26,574 |
Box of Mirrors
Description:
Mathematician Andris likes different puzzles and one of his
favorites is a covered box of mirrors. If we look at a
horizontal cross-section of such a box, we can see that its
bottom part contains $n \times
m$ square cells ($n$ rows, and $m$ columns). In each cell there can
... | 26,575 |
Boxed Letters
Description:
The New York Times publishes a puzzle called “Boxed Letters”
for puzzle enthusiasts. In this puzzle, $12$ letters are shown along the
$4$ sides of a box. The
task is to find words that are spelled when these letters are
connected, subject to the following rules:
* You may st... | 26,576 |
Boxes
Description:
There are $N$ boxes,
indexed by a number from $1$ to $N$. Each box may (or not may not) be
put into other boxes. These boxes together form a tree
structure (or a forest structure, to be precise).
You have to answer a series of queries of the following
form: given a list of indices o... | 26,577 |
Braaaains
Description:
Aha, you may have found a solution to the zombie apocalypse!
All zombies want to do is eat brains, so why not synthesize
your own?
You have come up with a new recipe for a plant-based brain
substitute and have begun mass production. Orders from other
strongholds are pouring in.
... | 26,578 |
Bracket Matching
Description:
Given a bracket sequence $s$ of length $n$, you are to determine if it is
valid!
A valid bracket sequence is defined recursively as:
* “”
* $(x)$ where
$x$ is a valid bracket
sequence
* $[x]$ where
$x$ is a valid bracket
sequence
* $\{ x\} $ where
... | 26,579 |
Bracket Matrix
Description:
A bracket sequence consisting of ‘(’ and ‘)’ is defined to
be valid as follows:
* An empty sequence is valid.
* If $x$ is a valid
bracket sequence, then $(x)$ is a valid bracket
sequence.
* If $x$ and
$y$ are valid bracket
sequences, then the concatena... | 26,580 |
Bracket Pairing
Description:
There are four types of brackets: round (), square [], curly {}, and angle <>. A bracket
sequence is defined to be valid as
follows:
* An empty sequence is valid.
* If $X$ is a valid
bracket sequence, then $pXq$ is a valid bracket sequence,
where $p$ is an open
... | 26,581 |
Bracket Sequence
Description:
Two great friends, Eddie John and Kris Cross, are attending
the Brackets Are Perfection Conference. They wholeheartedly
agree with the main message of the conference and they are
delighted with all the new things they learn about
brackets.
One of these things is a bracket... | 26,582 |
Brackets
Description:
* An empty sequence is valid.
* If $X$ is a valid
bracket sequence, then $(X)$ is a valid bracket
sequence.
* If $X$ and
$Y$ are valid bracket
sequences, then the concatenation of $X$ and $Y$, $Z=XY$, is a valid bracket
sequence.
An empty sequence is val... | 26,583 |
Brahmagupta-Fibonacci
Description:
You are given non-negative integers $a, b, c, d$. Let $p = a^2 + b^2$ and $q = c^2 + d^2$. You are to use these
two formulas to find two ways to write $pq$ as a sum of two squares.
## Input
The first and only line of input contains non-negative
integers $a, b, c, d \leq
... | 26,584 |
BrainFsckVM
Description:
Given a brainfsck program, determine whether it terminates
or enters an endless loop.
A brainfsck interpreter has a data array (consisting of
unsigned 8-bit integers) with an index, the so called “data
index”; the entry of the array pointed to by the data
index is the so calle... | 26,585 |
Brainfuck
Description:
Brainfuck is an esoteric programming language that operates
on a two-way infinite one-dimensional array of $8$-bit memory cells, each initialised
to $0$. A pointer points
to one of these memory cells.
Brainfuck uses the following commands:
>
Move the pointer one memory cell to t... | 26,586 |
Branch Assignment
Description:
The Innovative Consumer Products Company (ICPC) is planning
to start a top-secret project. This project consists of
$s$ subprojects. There
will be $b \ge s$ branches
of ICPC involved in this project and ICPC wants to assign each
branch to one of the subprojects. In ot... | 26,587 |
Branch Manager
Description:
You are managing a transportation network of one-way roads
between cities. People travel through the transportation
network one by one in order all starting from the same city,
and each person waits for the person before them to stop moving
before starting. The people follow... | 26,588 |
Brandvägg
Description:
On the Internet, there are many bad guys who always try to
hack the computers of others. They steal cat pictures, bank
logins and membership lists on programming dating sites. One of
the first countermeasures against network-based attacks is the
firewall. A firewall filters some ... | 26,589 |
Bread First Search
Description:
All the Mushroom Kingdom’s local $N$ bakeries ran out of bread so
Captain Toad went on a quest to buy as much bread as possible.
All bakeries form a connected graph with each other, so he
decided to apply his favorite algorithm to find the bread:
Bread First Search. The ... | 26,590 |
Bread Pit
Description:
New breeds of underground bacteria help in terraforming
Mars. The bacteria feed mainly on regular bread loafs which are
baked in huge quantities on the Mars surface and subsequently
dropped into a specially constructed pit. To distribute the
bread evenly in the subsurface, the pi... | 26,591 |
Bread Sorting
Description:
Michael works in a bakery. At the end of his shift, his boss
wants the breads sorted in a certain order. She can’t seem to
decide on which order, though – every day there seems to be a
new one – to Michael’s despair. Michael has worked there for a
while now and has learned a ... | 26,592 |
Breaking Bad
Description:
Walter was once a promising chemist. Now he teaches high
school students chemistry, and was recently diagnosed with lung
cancer. In both desperation and excitement he decides to use
his chemistry skills to produce illegal drugs and make quick
money for his family. He forms a p... | 26,593 |
Breaking Bars
Description:
Selma is visited by her two grandchildren Elsa and Asle who
love chocolate. To be precise, they are especially fond of the
brand Nut Cream Puffed Chocolate that comes in bars made up by
$6 \times 6$ squares. The
bars can be broken along the valleys between squares into
sm... | 26,594 |
Breaking Branches
Description:
Your parents decided that it would be “fun” to spend the
entire Sunday walking near the Mookerheide close to
Nijmegen.
Although you can pass the time by solving programming
problems in your head, your siblings do not have the same
luxury. After a short while, your younge... | 26,595 |
Breaking Cake
Description:
The Hunter Exam has begun!
The first round of the Hunter Exam is a real-life problem
solving test: Each candidate is given a rectangular
parallelepiped cake of size $a
\times b \times c$, which can be divided into unit cubes
of size $1 \times 1 \times
1$.
Inside the cak... | 26,596 |
Brexit
Description:
A long time ago in a galaxy far, far away, there was a large
interstellar trading union, consisting of many countries from
all across the galaxy. Recently, one of the countries decided
to leave the union. As a result, other countries are thinking
about leaving too, as their particip... | 26,597 |
Brexit Negotiations
Description:
As we all know, Brexit negotiations are on their way—but we
still do not know whether they will actually finish in
time.
The negotiations will take place topic-by-topic. To organise
the negotiations in the most effective way, the topics will all
be discussed and finali... | 26,598 |
Bribe
Description:
After having done a lot of spying and infiltrating a
criminal network, you are now ready to try and dismantle it.
This, however, requires the cooperation of a certain number of
the henchmen. This in turn requires money in order to bribe
them, but due to budget cuts, you only have a l... | 26,599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.