task stringlengths 0 154k | __index_level_0__ int64 0 39.2k |
|---|---|
Magic Trick
Description:
You are performing a magic trick with a special deck of
cards.
You lay out the cards in a row from left to right, face up.
Each card has a lower-case letter on it. Two cards with the
same letter are indistinguishable. You select an audience
member to perform an operation on th... | 28,700 |
Magic Word Square
Description:
Cornelius has always enjoyed the fact that his name has nine
unique letters. Recently he wrote his name as a $3 \times 3$ grid, but was
disappointed to find that none of the rows or columns made
words. Now he is wondering: is there a set of eight words such
that a $3 \tim... | 28,701 |
Magical Cows
Description:
Baxter Scott owns The Enlightened Dairy Co., a dairy company
with magical cows. Early each morning, he brushes his teeth,
strolls outside, and finds that the cows have doubled in
number. With double the number of cows, he can produce double
the quantity of milk. While he is ec... | 28,702 |
Magical Crystals
Description:
There are $n$ cities in
the Magical Island, numbered from $1$ to $n$. These cities are connected by
$n-1$ bi-directional roads
such that there is a unique path between every pair of cities.
Each road has a congestion factor. The
traffic condition on the Magical Island ... | 28,703 |
Magical Distances
Description:
There are $n$ cities in
the Magical Island, numbered from $1$ to $n$. These cities are connected by
$m$ bi-directional roads
such that there exists a path between every pair of cities.
There may be multiple roads between two cities. Each road has a
positive length.
M... | 28,704 |
Magical GCD
Description:
The Magical GCD of a nonempty sequence of positive
integers is defined as the product of its length and the
greatest common divisor of all its elements.
Given a sequence $(a_1, \ldots
, a_ n)$, find the largest possible Magical GCD of its
connected subsequences.
## Input
The... | 28,705 |
Magical Mystery Knight's Tour
Description:
A knight’s tour on a rectangular board of $n$ rows and $m$ columns of squares (traditionally
$8$-by-$8$) is a labelling of the squares by
integers $1$ through
$n \cdot m$ so that label
$n+1$ is a knight’s move
from label $n$. That is,
$2$ squares horiz... | 28,706 |
Magical Runes
Description:
You maintain a very nice collection of magical runes. They
generally come in two types, type A
and type B.
You have arranged your runes on a shelf to show them off.
Because they are magical runes, they change each day. That is,
at the start of each day the leftmost rune will... | 28,707 |
Magical String
Description:
Lajuk loves to play with magic, especially with a magical
string.
A magical string consists of $N$ lowercase English characters which
has no substring containing $3$ or more identical characters,
e.g., “aabbaacbb”, “icpc”, “asia”,
“singapore” are magical strings. On
the... | 28,708 |
Magnesium Supplementation
Description:
At a recent doctor’s appointment, Brandon has been marked as
being deficient in magnesium. His doctor has advised him to
take exactly some number of picograms of magnesium a day. His
doctor can prescribe pills that have any integer number of
picograms of magnesium... | 28,709 |
Mahjong Madness
Description:
Mahjong is an ancient game similar to poker, where players
build hands of tiles to win. You are playing a very simple
version of the game, where there is only one player and one
“suit” of tiles. Tiles can be numbered from $1-9$, and there are a total of
$4$ of each numbered... | 28,710 |
Majority Card
Description:
You are going to play a Majority1 Card
game. In this game, there will be a deck of cards, initially
empty. Each card is labelled with a number between $1$ to $2~ 000~ 000~ 000$ (or just between
$1$ to $20$ on some occasions.) You will play
the game in $N$ rounds,
consecut... | 28,711 |
Majstor
Description:
Rock-paper-scissors is a popular two-player game. In the
game, each of the players uses their hand to show one of three
symbols: rock, paper or scissors. If both players show the same
symbol, the game is a tie. Otherwise, scissors beat paper,
paper beats rock and rock beats scissor... | 28,712 |
Majór Skýrsla
Description:
You have been assigned the task of ordering and preparing a
report for a British major. This major does mathematics
research in his spare time, so he appreciates patterns and
sequences in everything he sees. When he recieves a stack of
papers he likes to consider the index of... | 28,713 |
Make Them Meet
Description:
Mila and Laura have been friends online for a long time;
they have never met in real life. Currently, they are both
attending the same onsite event, which means that they will
surely meet. However, the hotel where they both are staying is
very big and confusing. Therefore, a... | 28,714 |
Making A Meowth
Description:
After suffering an embarrassing defeat at the hands of Team
Rocket, you come to the obvious conclusion that the only way to
beat them is by teaching your own Meowth how to read.
To prevent burn out, you’ve created the following study
plan: your Meowth will read every $N$th pag... | 28,715 |
Making Palindromes
Description:
An alphabetical string is a string
consisting of $0$ or more
capital letters (i.e. [‘A’..‘Z’]). Given an
alphabetical string $S[1..N]$, determine the number of
palindromic alphabetical strings of length $2N$ that contains $S$ as a subsequence (not necessarily
contigu... | 28,716 |
Malfunctioning Robot
Description:
Arthur is participating in the Vietnamese Robotic Olympiad
$2\, 020$. In the first
round, candidates must build a path-finding robot. More
precisely, the organizers have prepared an infinite,
obstacle-free grid. One candidate’s robot is placed at a
starting positio... | 28,717 |
Mali
Description:
Mirko and Slavko are playing a new game. Again. Slavko
starts each round by giving Mirko two numbers $A$ and $B$, both smaller than 100. Mirko then
has to slove the following task for Slavko: how to pair all
given $A$ numbers with all
given $B$ numbers so that
the maximal sum of s... | 28,718 |
Mall Mania
Description:
Waterloo has two giant shopping malls, each enclosing
several city blocks. Kim and Pat like to shop and to walk
within the malls but they don’t like walking between the malls
because such walking does not contribute directly to the task
at hand: shopping. They would therefore li... | 28,719 |
Managing Packaging
Description:
Modern operating system distributions have tools to manage
installed software, making it easy to keep the software
up-to-date. Putting different pieces of software into
‘packages’ that can be installed separately keeps things simple
and avoids duplicate effort and code. ... | 28,720 |
Mancala
Description:
Mancala is a family of board games played around
the world, sometimes called sowing games, or
count-and-capture games, which describes the game
play. One simple variant is a solitaire game called
Tchoukaillon which was described by Véronique
Gautheron. Tchoukaillon is played on... | 28,721 |
Mandelbrot
Description:
Born in Warsaw, Benoît Mandelbrot (1924–2010) is considered
the father of fractal geometry. He studied mathematical
processes that described self-similar and natural shapes known
as fractals. Perhaps his most well-known contribution is the
Mandelbrot set, which is pictured below... | 28,722 |
Manhattan
Description:
You are the mayor of a city with severe traffic problems. To
deal with the situation, you have decided to make a new plan
for the street grid. As it is impossible to make the streets
wider, your approach is to make them one-way (only traffic in
one direction is allowed on a stree... | 28,723 |
Manhattan Mornings
Description:
As a New Yorker you are always very busy. Apart from your
long work day you tend to have a very long list of errands that
need to be done on any particular day. You really hate getting
up early so you always end up going over your to-do list after
work, but this is start... | 28,724 |
Manhattan Positioning System
Description:
The Manhattan Positioning System (MPS) is a modern variant
of GPS, optimized for use in large cities. MPS assumes all
positions are discrete points on a regular two-dimensional
grid. Within MPS, a position is represented by a pair of
integers $(X,Y)$.
To deter... | 28,725 |
Manhattan Shopping
Description:
After attending the ProgNova contest, Peter walks out of the
school to enjoy a weekend of shopping in Manhattan!
Peter has a shopping list with $m$ different items (numbered
$1$ to $m$) he wants to purchase. There are
$n$ shopping malls in
Manhattan. Each shopping mall ... | 28,726 |
Manhattan Walk
Description:
It’s a grid system! You begin at the top left corner and
want to walk to the bottom right corner. Every location is at
integer coordinates, and has an arrow pointing down or right
and a timer that, every few seconds, flips the arrow from down
to right, or from right to down.... | 28,727 |
Manhattanstíflur
Description:
As you probably already know, the streets in Manhattan all
lay north to south or east to west. Let us number the streets
that go from north to south $0,
1, \dots , n$ where the $0$ is the street furthest west. Let
us also number the streets going east to west $0, 1, \dots ... | 28,728 |
Map
Description:
A pirate’s treasure map typically contains a series of
instructions which, if followed, lead you from the landing
place on a desert isle to the spot marked X where the
treasure is buried. You are to construct such a series of
instructions for a particular desert isle.
The island is a ... | 28,729 |
Map Colouring
Description:
A map maker wants to colour different countries or provinces
on his maps using different colours. That is, he wants to
colour countries that share a common border with a different
colour. He has heard that any map can be coloured with four
colours, but even after a lot of puz... | 28,730 |
Map Tiles
Description:
Publishing maps is not an easy task. First you need some
appropriate transformation to display the earth’s spherical
shape in a two-dimensional plane. Then another issue arises –
most high-quality maps are too large to be printed on a single
page of paper. To cope with that, map ... | 28,731 |
Map of Sweden
Description:
Vidar wants to know how large Sweden is. After a lot of
effort, he has managed to launch a satellite into the
atmosphere that can take several low-resolution images of
Sweden for him. Unfortunately, the satellite’s camera is very
poor. Each square in the image will either con... | 28,732 |
Marathon
Description:
Next weekend, it’s time for the Codeville Ultramarathon, a
$5\, 000$ kilometer race
only for the sportiest of programmers. As it happens, you are
responsible for organizing the medical coverage for the
marathon.
For simplicity, the race track can be seen as a single long
line... | 28,733 |
Marbles On A Tree
Description:
The task is to move the marbles such that each box contains
exactly one marble. This is to be accomplished be a sequence of
moves; each move consists of moving one marble to a box at an
adjacent vertex. What is the minimum number of moves required
to achieve the goal?
##... | 28,734 |
March of the Penguins
Description:
Somewhere near the south pole, a number of penguins are
standing on a number of ice floes. Being social animals, the
penguins would like to get together, all on the same floe. The
penguins do not want to get wet, so they have use their limited
jump distance to get tog... | 28,735 |
Marching Orders
Description:
Dean Bob Roberts is in charge of the order in which the
professors of his college march in the graduation ceremonies.
Because of complaints among certain professors from the newly
created DEI Studies Department, it has been decided that the
order in which they march should ... | 28,736 |
Mario
Description:
In a final attempt to complete an impossible Super Mario
level, you decided to write an AI and let it play the game for
you.
As a first step, we forget about badguys and only implement
navigation. In this problem, you will implement navigation over
a river. The river has width $W$ a... | 28,737 |
Mario or Luigi
Description:
Mario and Luigi are playing a game where they pick distinct
numbers $M, L$
($0 \leq M,L <
2^{10^{18}}$). In order to place careful bets on the
outcome of the game, you wish to know whose number is larger.
Both Mario and Luigi have already shared their secret numbers
... | 28,738 |
Marko
Description:
Good old Marko came across a new feature on his mobile phone
– T9 input! His phone has a keyboard consisting of numbers
looking like this:
1
2
3
abc
def
4
5
6
ghi
jkl
mno
7
8
9
pqrs
tuv
wxyz
In order to input a word using this keyboard, one needs to
press a key multiple... | 28,739 |
Mars Window
Description:
Your engineers have calculated that optimal launch windows
occur once every 26 months, and that one of them occurs in
April 2018. They also tell you that they will not have any Big
Finished Rockets by then, so you will have to wait for a later
launch window.
Since your rocket ... | 28,740 |
Marshland Rescues
Description:
The Marshland Accident Prevention Syndicate (or MAPS for
short) has just assumed stewardship of a newly discovered
marshland. The marshland is made up of areas that are solid
ground and areas that are water-logged. Each water-logged area
can be modelled by a convex polygo... | 28,741 |
Martian DNA
Description:
As you are probably aware, human DNA can be represented as a
long string over an alphabet of size four (A, C, G, T), where
each symbol represents a distinct nucleobase (respectively;
adenine, cytosine, guanine, and thymine).
For martians, however, things are a bit different; resea... | 28,742 |
Marvelous Marathon
Description:
A marathon race is being planned in the beautiful
countryside. The course will be somewhere along a long,
bidirectional, road. The organizers want to determine exactly
where along this road the race should be in order to maximize
the experience for the runners, so that t... | 28,743 |
Massive Card Game
Description:
You and a friend have been playing a card game for a while.
In the game, a player has a list of cards, each containing an
integer. The goal is to guess exactly what cards the opponent
has. To accomplish this, they take turns asking the opponent
how many of the integers on... | 28,744 |
Mastering Mastermind
Description:
Mastermind is a two-person code breaking game which works as
follows. The first person (the code maker) creates a
sequence of $n$ colored
pegs (with duplicate colors allowed) and hides it from view.
This sequence of pegs is the code.
The second person (the code breake... | 28,745 |
Matarinnkaup
Description:
A lot of food and drinks were sold at Nauthóll over the last
few days. Now it is time to take inventory and figure out
necessary purchases. This job falls to you. Given the recipes
used at Nauthóll and all receipts from the past few days, how
much was used of each ingredient?
... | 28,746 |
Match Game
Description:
Match sticks can be used to form digital numbers. The
arrangement of matches that forms each digit between
‘0’ and ‘9’ is
illustrated in the figure.
You are given two sequences of digits $X$ and $Y$. There are matches that have been
arranged to form the digits in $X$. Can you m... | 28,747 |
Match the Clocks
Description:
Toto and Moto are two retired brothers who are passionate
about digital electronics, so they decide to enroll in studies
at the Atlantic Circuit Programming College (ACPC). For their
graduation project, they each choose to make a digital clock.
As they often disagree, they... | 28,748 |
Matchings
Description:
Yraglac has just finished building a robot! It’s fancy: two
wheels, with an auto-balancing system, several cameras,
wireless connectivity, and a sattelite dish. There’s just one
little problem…
He powered it up, sent it off for a test, and now it’s not
responding to any inputs. ... | 28,749 |
Matchsticks
Description:
Matchsticks are ideal tools to represent numbers. A common
way to represent the ten decimal digits with matchsticks is the
following:
This is identical to how numbers are displayed on an
ordinary alarm clock. With a given number of matchsticks you
can generate a wide range of ... | 28,750 |
Mate in One
Description:
When you are looking back in old editions of the New in
Chess magazine, you find loads of chess puzzles. Unfortunately,
you realize that it was way too long since you played chess.
Even trivial puzzles such as finding a mate in one now far
exceed your ability.
But, perseveranc... | 28,751 |
Math Homework
Description:
Since entering $2^\text
{nd}$ grade Theta has daily math homework sheets. The
problems on her worksheet usually go like this:
It is always the same problem, just written in different
ways: sometimes with horses, cows, sheep, goats, chickens,
beetles, or even spiders – but ne... | 28,752 |
Math Trade
Description:
Suppose a group of people have objects they want to trade,
and objects they want to get in return:
Name
Has
Wants
Sally
Clock
Doll
Steve
Doll
Painting
Carlos
Painting
Clock
Maria
Candlestick
Vase
Notice how none of the people listed can pair off and trade
with each other... | 28,753 |
Math Worksheet
Description:
You are an elementary school student and you have been asked
to solve a bunch of simple problems. You have to report your
results in a nice pretty table. Of course, being a budding
computer scientists, you are not going to solve these problems
yourself; you are going to get ... | 28,754 |
Mathemagicians
Description:
There are $n$
mathemagicians standing in a circle. Each mathemagician wears
either a blue hat or a red hat. A mathemagician can cast a
color change charm which changes the color of their hat to the
same color as the hat of the mathemagician directly to the left
or to the... | 28,755 |
Matrica
Description:
A matrix is a rectangular table of letters. A square matrix
is a matrix with an equal number of rows and columns. A square
matrix $M$ is called
symmetric if its letters are symmetric with respect to the main
diagonal ($M_{ij} =
M_{ji}$ for all pairs of $i$ and $j$).
The follow... | 28,756 |
Matrix Fraud
Description:
For the purposes of this problem: A matrix is a binary
matrix if all its entries are $0$ or $1$. A matrix is a banded binary
matrix if its rows and columns satisfy the following
properties:
* Every row has at least one $1$.
* Every column has at least one $1$.
* All $1$s in eac... | 28,757 |
Matrix Inverse
Description:
Given a square $n\times
n$ matrix $A$, the
definition of its inverse $B=A^{-1}$ is the matrix that fulfills
the equality:
where $B$ and
$I$ are $n\times n$ matrices, and $I$ is the identity matrix with ones
along the diagonal, and zeros everywhere else:
For this proble... | 28,758 |
Matrix Keypad
Description:
When a button at row $i$ and column $j$ is pressed, the wire for row
$i$ and the wire for
column $j$ will carry an
electrical current. If just a single button is pressed, it can
be identified by sequentially checking if a current can be
detected at each row wire and at ea... | 28,759 |
Max Arithmetic Subsequence
Description:
You are given a strictly increasing array of $n$ numbers $0\leq a_1<a_2<\ldots <a_ n \leq
10^{18}$. Define an arithmetic progression subsequence
as a series of indices $i_1<i_2<\ldots <i_ k$ such
that $a_{i_2}-a_{i_1} =
a_{i_3}-a_{i_2}\ldots = a_{i_ k}-a_{i_{k-1}... | 28,760 |
Maximal Parentheticals
Description:
The Association for Curtailing Parentheses in Computations
disbanded after last year’s schism regarding exponentiation.
You are trying to archive and zombie-proof their documents, and
have come across a series of arithmetic expressions. To make
the expressions more i... | 28,761 |
Maximal Sequences
Description:
The problem is simple. You are given a long sequence of
integers $a_1, a_2, \ldots , a_
n$. Then you are given a query consisting of a start
index $i$ and a
subset of integers $B$.
What is the longest consecutive subsequence of the given
sequence that starts at po... | 28,762 |
Maximizing (And Minimizing) Your Winnings
Description:
You are a contestant on a game show where the goal is to win
as much money as you can. The game is played in a building with
many numbered rooms, and starting from room 1 with no money,
you take a fixed number of turns. For each turn you either stay
... | 28,763 |
Maximizing Your Pay
Description:
It’s tougher to find work these days than it has been in the
past. However, you are fortunate to have a job leading people
on walking tours around various areas in your city. There are
two interesting things about your job. First, your contract
requires you to take peop... | 28,764 |
Maximum Choice
Description:
Bryan is a passenger on a voyage to a distant planet. Like
the other passengers he awaits in cryosleep. However, due to a
malfunction he awoke early and finds himself awake and alone.
The ship’s sophisticated navigation AI, ChatHAL, is responsible
for waking passengers.
It ... | 28,765 |
Maximum Clique
Description:
In an undirected graph, a clique is defined to be a
subsets of vertices where all pairs are connected. Given such a
graph, determine the size of a largest clique.
## Input
The first line contains the integer $V$ ($1
\le V \le 50$) and $E$ ($0
\le E \le \frac{V(V - 1)}{2}$)... | 28,766 |
Maximum Color Clique
Description:
You found a complete, undirected graph with $n$ nodes, labeled $1$ to $n$. Each edge has a color. For
simplicity, each color is identified by a number between
$1$ and $300$ inclusive. Interestingly, you
noticed that for each and every simple cycle in this graph,
there ... | 28,767 |
Maximum Expression
Description:
There is an expression with $n$ question marks, and $n-1$ operators between them. The
operators only include addition, subtraction, and
multiplication. Here is an example:
You are going to replace every question mark with a digit
from $\{ 0, 1, 2\} $.
After the replacem... | 28,768 |
Maximum Fix
Description:
A permutation is a list of integers $a_1,a_2,\dots ,a_ n$ where every
number from $1$ to
$n$ appears exactly once.
We can rotate a permutation $a_1,a_2,\dots ,a_ n$ by $k$ to get a new permutation
$b_1,b_2,\dots ,b_ n$ by
moving the first $k$
elements to the end. For ex... | 28,769 |
Maximum Flow
Description:
## Input
The first line of input contains a line with four
non-negative integers, $2 \le n
\le 500$, $0 \le m \le
10\, 000$, $0 \le s \le
n-1$ and $0 \le t \le
n-1$, separated by single spaces, where $n$ is the numbers of nodes in the
graph, $m$ is the number
of e... | 28,770 |
Maximum Loot
Description:
A burglar wants to maximize the value of his loot given that
he has a limited carrying capacity. Which items should he
choose?
More precisely, there is for every item $i$ a value $v_{i}$ and a cost (or weight)
$c_{i}$, and there is a
maximum cost $C$. The
object is to fin... | 28,771 |
Maximum Number of Colinear Points
Description:
## Input
Input contains several test cases. Each test case begins
with an integer $n$
($1 \leq n \leq 1000$).
Then follow a list of n points, one per line, each of the form
$x\ y$. Coordinates are
integer with absolute value bounded by 10000. The give... | 28,772 |
Maximum Rent
Description:
Yan and Fen have just accepted jobs in TechValley California
allowing them to pursue their childhood dream of renting the
most expensive apartment in the area.
Yan and Fen have decided that the rent of an apartment
denoted $R$ is a function
of its square footage $x$
and t... | 28,773 |
Maximum Subarrays
Description:
You may have heard of the “maximum subarray problem” from
your university’s undergraduate algorithms course. The problem
goes like this: You are given an array $A$ of $n$ integers, and the task is to find
a contiguous subarray of $A$ whose sum is maximum. For example,
in ... | 28,774 |
Maxwell's Demon
Description:
Relax: No knowledge of thermodynamics is needed to solve
this problem.
Maxwell’s demon sits in a container of height $h$ and width $2w$. The container is divided into
two adjacent chambers, each of height $h$ and width $w$. An impenetrable wall separates
the two chambers, and ... | 28,775 |
Mayhem
Description:
You are a seasoned Fight Club member who recently stumbled
upon the classified plans of Project Mayhem, a secret
organization that the other members have created to bring down
consumerism and corporate America. To completely destabilize
modern civilization, Tyler Durden and his Proj... | 28,776 |
Maze
Description:
You have been blindfolded and deposited someplace in a maze.
You have no idea where you are. You do know, however, that the
maze is laid out on a grid, and that each grid location is
either blocked or free. In fact, you have memorized a map of
the maze. Also, your magnetic personality... | 28,777 |
Maze Movement
Description:
Your boss gave you the task of creating a walking maze, and
you are evaluating different designs. Before you commit to one,
you want to know how quickly people can move in and out of each
different maze. After all, your boss is interested in making
money on this venture and, ... | 28,778 |
Maze Reduction
Description:
Jay runs a small carnival that has various rides and
attractions. Unfortunately, times are tough. A recent roller
coaster accident, flooding in the restrooms, and an unfortunate
clown incident have given Jay’s carnival a bad reputation with
the public. With fewer paying cust... | 28,779 |
MazeMan
Description:
You now work for a video game company - every programmer’s
dream! You are working on a multiplayer game where players
cooperate to enter a maze and try to consume all of the “dots”
as quickly as possible. Each player enters the maze at a
different entrance. The mazes are randomly g... | 28,780 |
MeTube
Description:
You know that you should be sleeping by now... but you are
going to just watch some more MeTube before going to
bed.
On MeTube, there are number of categories you are
interested in. Each video on MeTube can belong to one or more
categories. Before going to bed, you must have watche... | 28,781 |
Mean Words
Description:
Little Timmy got caught by his teacher using some mean
words. After getting sent to the principal, little Timmy
learned his lesson - he should do his best to not get caught
next time!
What Timmy decided to do is to take all the mean words that
he wants to say, and combine them ... | 28,782 |
Measuring Problem Difficulty
Description:
If you are the lucky one to advance to the ACM-ICPC World
Finals, one of the situations you will face is the World Finals
competition itself. Wait, isn’t that the main reason to go
there?
In the beginning of each ACM-ICPC competition, there are two
separate go... | 28,783 |
Medals
Description:
In general, a ranking scheme can be thought of as a vector
of positive weights. This vector is multiplied with the vector
of medals won by each country, and the scalar product of the
two vectors defines the score of the respective country, which
is then used to produce the ranking. ... | 28,784 |
Meeting Points
Description:
This problem is very simple. Given $n$ lines lying in the $x$-$y$ plane, determine the number
of intersection points. Here are the details:
* Each line is specified by two distinct points,
$(x_1, y_1)$ and
$(x_2, y_2)$, through which
the line passes.
* All $n$ ... | 28,785 |
Mega Inversions
Description:
The $n^2$ upper bound
for any sorting algorithm is easy to obtain: just take two
elements that are misplaced with respect to each other and swap
them. Conrad conceived an algorithm that proceeds by taking not
two, but three misplaced elements. That is,
take three elemen... | 28,786 |
Meltdown
Description:
A polygon is lowered at a constant speed of $v$ metres per minute from the air
into a liquid that dissolves it at a constant speed of
$c$ metres per minute from
all sides. Given a point $(x,y)$ inside the polygon that moves
with the polygon, determine when the liquid reaches the
... | 28,787 |
Melting Snow
Description:
The snowfall in Alberta is setting records this year. At the
beginning of every single day, $S$ centimeters of snow falls. At the
end of every single day, $P$ percent of the snow currently on
the ground melts. As a member of the Alberta Consecutive
Precipitation Calculation (A... | 28,788 |
Memories of Passport Stamps
Description:
You just got your new passport, fresh with pages ready to be
stamped by immigration officers. Sadly, because your passport
has so many pages, immigration officers are too lazy to try to
use your pages efficiently, so you may need to get a new
passport sooner tha... | 28,789 |
Memory Device
Description:
Grandpa has a special memory device.
The device’s memory is an array of length $n$, numbered from $0$ to $n-1$. The device also support
$2$ operations: Allocation
and Deallocation.
For an allocation operation, an integer $l$ will be given. The device will
have to find the le... | 28,790 |
Memory Game
Description:
The game of Memory is played with $N$ pairs of cards where each pair has
the same picture, i.e. there are $N$ different pictures, and each of
them appear on exactly two cards.
The cards are shuffled and placed face down on a large
table. On each turn you flip two cards of your cho... | 28,791 |
Memory Game
Description:
You’re playing memory with David. $2N$ cards are placed face down in a
row, each number between $1$ and $N$ shown on two cards. The players
take turns choosing two cards, if a player chooses two cards
with the same number they earn a point, the cards are removed
and the player ... | 28,792 |
Memory Match
Description:
You are playing the game “Memory Match”.
This game revolves around a set of $N$ picture cards. The cards are
organized in pairs: there are $N/2$ different pictures, each picture
occurring on exactly two cards.
At the beginning of the game, the cards are shuffled and
laid face do... | 28,793 |
Menger Sponge
Description:
The Menger sponge is a simple 3D fractal. Its
level-$L$ approximation
can be constructed with the following algorithm:
* Start with a single solid $1\times 1\times 1$ cube with
opposite corners at $(0, 0,
0)$ and $(1, 1,
1)$.
* For each iteration $i =
... | 28,794 |
Menu Updates
Description:
Egdirbhtel is running a successful restaurant, and every day
has either a new recipe idea or retires an old one. The
restaurant menu uses a unique number to represent each menu
item in order to help customers order items efficiently.
Unfortunately, the clientele find it confus... | 28,795 |
Meow Factor
Description:
While some cats are naturally chic and have an innate
ability to see the meow factor of numbers, others who struggle
to stay in vogue can not even tell the difference between
$3\, 584$ and $4\, 711$ (the former clearly having a
higher meow factor). Can you help those poor unfor... | 28,796 |
Meow Factor 2
Description:
Naturally, some strings are more stylish than others, and
for cool cats it is important to engage in their string-playing
pastime with style. The meow factor of a string
$S$ is the minimum number
of operations needed to transform $S$ into a string $S’$ which contains the word... | 28,797 |
Mergjað Mál
Description:
After turning in the draft of the problems for
Forritunarkeppni Háskólanna á Íslandi the results were that the
prose was too terse and dated. It had to appeal to a younger
audience better, to use their language. This problem exists as
a response to this criticism. This sentence... | 28,798 |
Message
Description:
A student wants to send to his friend a message, which is a
text string $p$ consisting
of only lowercase latin alphabet letters. To encrypt his
message, he creates a lowercase alphabet string $h$ of size $n$ that contains $p$ as a substring. The student is
curious to find out how m... | 28,799 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.