task stringlengths 0 154k | __index_level_0__ int64 0 39.2k |
|---|---|
Mult!
Description:
Nora Mainder has a game she plays with her students to help
them learn multiplication. She calls out a sequence of numbers
and the students have to determine when she names a whole
number multiple of the first number. When a student recognizes
such a multiple, he or she must call out... | 28,900 |
Multi-Class Binary Neural Network for Handwritten Digits
Description:
The objective of this problem is to train a Binary Neural
Network to classify images. The training occurs on your own
computer, and you should submit a program which simply outputs
the trained weights.
The images are of handwritten digi... | 28,901 |
Multi-Touch Gesture Classification
Description:
With the advent of touch-screen based interfaces, software
designers have had to reinvent computer control for
finger-based gestures. The most basic task in interpreting a
gesture is classifying the touches into one of several possible
gestures. This can ... | 28,902 |
Multi-Year Contest Scheduling
Description:
A well-known Canadian programming contest is always held on
a Friday in October each year. We need you to help choose the
dates for years $2019$,
$2020$, …, $2018+Z$.
There are Fridays when we cannot schedule the contest
because of conflicting events. In part... | 28,903 |
Multigram
Description:
Pero is a passionate lover of riddles. The newest type of
riddles he has come across requires the solver to check whether
the given word is a multigram.
A multigram is a word that consists of concatenating two or
more words that are all mutually anagrams. The first of these
word... | 28,904 |
Multiplication
Description:
## Task
Given $N$ integers
$a_1, a_2, ..., a_ N$.
Calculate their product modulo $10^9 + 7$.
## Input
The first line contains one integer $N$.
Then, $N$ lines follow.
The $i$-th line contains
integer $a_ i$.
## Output
Output one integer - the product of the given numbe... | 28,905 |
Multiplication Game
Description:
Alice and Bob are in their class doing drills on
multiplication and division. They quickly get bored and instead
decide to play a game they invented.
The game starts with a target integer $N \geq 2$, and an integer
$M = 1$. Alice and Bob
take alternate turns. At each t... | 28,906 |
Multiplication Table
Description:
In an $N \times N$
multiplication table, how many times does a given number
$M$ appear?
The multiplication table is a matrix where the value of the
$i$’th row of the
$j$’th column
($1$-indexed) has the
value $i \times j$.
## Input
The first and only line con... | 28,907 |
Multiplying Digits
Description:
For every positive integer we may obtain a non-negative
integer by multiplying its digits. This defines a function
$f$,
e.g. $f(38) =
24$.
This function gets more interesting if we allow for other
bases. In base $3$, the
number $80$ is written as
$2222$, so:... | 28,908 |
Mumble Rap
Description:
Willó listens to several different music genres and usually
talks to both his friends about his favorite artists. One day,
Willó asked her parents if they were willing to pay for a
ticket to a music festival. The parents agreed to it at first,
but his mother became quite hesitan... | 28,909 |
Museum
Description:
In a new wing of the Rijksmuseum in Amsterdam, there is an
exhibition of world treasures. The new wing of the museum
consists of rectangular rooms. Each room contains exactly one
treasure, where each treasure is placed on a square pedestal
which is surrounded by glass and wood.
The... | 28,910 |
Mushroom Misery
Description:
The Institute of Ubiquitousness in Lichtenstein, LIU,
conducts a project where the effect of a special type of fungi,
sphera carnelevarium, are studied. This fungus is very special,
since it grows in a circular fashion from its centre, without
interference from other object... | 28,911 |
Music Collection
Description:
Audio Phil has a huge music collection, and he is very
particular about the songs he listens to. Each song has a name
that is a string of characters. His music player has a search
feature that lets Phil type a substring into the search box,
and the player then lists all so... | 28,912 |
Music Your Way
Description:
MyTunes, a new music application from Mapple, allows you to
display and sort your music according to many different
attributes. Attributes like album name, song title, artist, and
song length are available, among others. One feature MyTunes
does NOT have is stable sorting. Y... | 28,913 |
Musical Chairs
Description:
Professor O’Dagio of the music department at Faber College
has come up with a rather interesting way of selecting its
department chair. All $n$
members of the music faculty line up, then the first one in
line calls out an integer $k$ corresponding to the opus number
of h... | 28,914 |
Musical Mending
Description:
Shortly before the concert starts, you notice that your
piano is completely out of tune! Having the ability of relative
pitch, you are able to discern the difference between the pitch
of any piano key to the first piano key. While this does not
help you find the absolute pi... | 28,915 |
Musical Notation
Description:
There are many types of languages, all used for different
purposes. People communicate using natural languages like
English and Spanish, program with formal languages like C++ and
Perl, and compose music with musical notation. Let’s consider
musical notation, which is typi... | 28,916 |
Musical Scales
Description:
The following are musical notes in “increasing order”:
The difference between consecutive notes is a
semitone, and the sequence wraps around so the note
that is one semitone above $G\sharp $ is $A$. The difference between a
tone is the same as two semitones. So the note that is... | 28,917 |
Musical Trees
Description:
It’s Christmas time and JW’s $1$-dimensional shop is selling
Christmas trees. However, the demand for trees is much higher
than the number of trees available. Hence, JW has come up with
a special strategy to help decide who gets what tree: a game of
Musical Trees!
Musical Tr... | 28,918 |
Mutexes
Description:
Anna loves coding multithreaded backend services. In such a
service, multiple threads may sometimes need to read and write
the same data structures in memory. To ensure all threads have
a consistent view of a single datastructure, one can use
so-called mutexes to protect access to ... | 28,919 |
Muzicari
Description:
“The Drinking Musicians”, a widely known and popular folk
group, are coming to your town. The musicians are known not
only by their playing skills, but also their rough character.
They never arrive on time, don’t know which town they’re in,
and frequently have trouble finding the ... | 28,920 |
Mylla
Description:
Hjalti’s favourite game is tic tac toe. The game is played
by two players who take turns placing marks inside the cells of
a $3 \times 3$ grid, but
they can’t place marks in cells that already have marks. The
starting player uses the mark X and
the other uses the mark O. A player... | 28,921 |
Mysterious Array
Description:
There is an array that contains a permutation of the numbers
$1$, $2$, …, $N$ (i.e., each number appears exactly
once in the array). The elements of the array are $1$-indexed.
However, you don’t know the contents of the array. Instead,
you are given the results of $Q$ queries... | 28,922 |
Mysterious Tower
Description:
The Parakeet King is stacking $N$ blocks to make a stable tower.
There is only one type of block, and each block can be placed
face-up or face-down. In order for the tower to be stable, the
tower must satisfy the following property: for every face-up
block, there exists a ... | 28,923 |
Mårten's DFS
Description:
You will be given a simple, connected graph $G$ with $N$ vertices. Each vertex in
$G$ has been numbered
between $0$ and
$N - 1$.
Determine if a list $L$
is a valid depth first-search order. A valid depth first-search
order is one that can be generated by the following pro... | 28,924 |
Mårten's Theorem
Description:
According to Mårten’s
Theorem, everything which rhymes is the same thing. For
example, Sheep is the same thing as Heap, Dictionary Attack is
the same thing as Stack, and Tree is the same thing as the
Mediterranean Sea.
Strangely, some people have objected to Mårten’s Theo... | 28,925 |
Mæting
Description:
As a preschool teacher you are used to kids not coming to
school due to sickness. A part of your job is taking
attendance, so you have a list of which students came to school
on which day. Today is Wednesday and you are look at the
attendance on Monday and Tuesday. You are intereste... | 28,926 |
Mætingarlisti
Description:
An attendance list is passed around a classroom with each
student writing their name below the name of the last student
who had the list (the first person writes their name at the
top). The classroom consists of $r$ rows where each row has
$c$ chairs. The class is
popular... | 28,927 |
Mörk
Description:
## Input
The input consists of two lines. The first line contains an
integer $n$, the number of
goals scored. The second line contains an integer $m$, $0$ if neither team scored,
$1$ if only one team
scored and $2$ if both
teams scored.
## Output
Print Jebb if Siggi should bet ... | 28,928 |
N-Puzzle
Description:
$N$-puzzle is a puzzle
that goes by many names and has many variants. In this problem
we will use the $15$-puzzle. It consists of a
$4$-by-$4$ grid of sliding squares where one
square is missing. The squares are labeled with uppercase
letters ’A’ through ’O’, with the desired ... | 28,929 |
N-sum
Description:
Now one’s goose is cooked and the raw carrots are
smoked!
Per-Magnus’ boss stormed into his office and complained
about the addition program you had written for him previously.
It can only add two numbers, which is of course
completely unusable! How could you even come up with such ... | 28,930 |
NOP
Description:
Mirko purchased a new microprocessor. Unfortunately, he soon
learned that many of his programs that he wrote for his old
processor didn’t work on the new processor.
Deep inside the technical documentation for both processors,
he found an explanation. In order to work faster, the new
p... | 28,931 |
NTNU Orienteering
Description:
After the unification of NTNU and HiNT, the now all-powerful
NTNU has a lot of campuses at its disposal. You, a student of
Computer Science, are facing the problem of having to attend
lectures at several campuses; campuses that are far away from
each other.
You’re given ... | 28,932 |
NVWLS
Description:
NVWLS, or “No Vowels” puzzles are popular among puzzle
enthusiasts. For example, consider the following no-vowels
message:
```
BTWNSBTLSHDNGNDTHBSNCFLGHTLSTHNNCFQLSN
```
which is inscribed on the famous “Kryptos” statue located at
the CIA’s headquarters in Virginia. This message is der... | 28,933 |
Nafnagift
Description:
A string $t$ is a
subsequence of a string $s$ if it is possible to attain
$t$ by removing some (or
none) of the letters in $s$. For example, the string
snati is a subsequence of ísknattleikur.
## Input
The input consists of two lines. Each line contains a string
correspondi... | 28,934 |
Nafnatalning
Description:
The baptism is coming up real soon, only $42$ days! They need to decide what
they are going to name the twins before then. Every day they
can look at $P$ pairs of
names. They have asked you to figure out how many days it will
take to look at all pairs of names.
## Input
The ... | 28,935 |
Najkraci
Description:
A road network in a country consists of $N$ cities and $M$ one-way roads. The cities are
numbered $1$ through
$N$. For each road we know
the origin and destination cities, as well as its length.
We say that the road $F$ is a continuation of road
$E$ if the destination
city of... | 28,936 |
Name Generation
Description:
Ingrid is the founder and CEO of bicycle retailer BIKEA. The
company sells bicycles for customers to assemble
themselves.
BIKEA has $N$ different
bicycles to offer. Ingrid wants to give each of them a
human-readable name, to make it easy to remember. But doing
this by ... | 28,937 |
Name That Permutation
Description:
The concept of permutations comes up frequently in the
analysis of computer algorithms, in probability theory, and in
many other fields. For many algorithmic problems, the easiest
brute-force-type solution is to enumerate all possible
permutations of some list or set,... | 28,938 |
Namnsdag
Description:
Your friend likes money. When your friend has a name day he
or she gets money from their nice aunt, hence your friend
really enjoys when they have a name day.
It happens to be your friend’s name day today, and your
friend is considering how they could avoid having to wait
another... | 28,939 |
Narrow Art Gallery
Description:
A long art gallery has $2N$ rooms. The gallery is laid out as
$N$ rows of 2 rooms
side-by-side. Doors connect all adjacent rooms (north-south and
east-west, but not diagonally). The curator has been told that
she must close off $k$ of
the rooms because of staffing cu... | 28,940 |
Nasty Hacks
Description:
## Input
The input consists of $n$ cases, and the first line consists
of one positive integer giving $n$. The next $n$ lines each contain $3$ integers, $r$, $e$ and $c$. The first, $r$, is the expected revenue if you do
not advertise, the second, $e$, is the expected revenue if you do... | 28,941 |
Natjecanje
Description:
As you know, a kayaking competition is going on as we speak.
Unfortunately strong winds have damaged a few kayaks, and the
race starts in 5 minutes!. Fortunately, some teams have brought
reserve kayaks. Since kayaks are bulky and hard to carry, teams
are willing to lend kayaks t... | 28,942 |
Natrij
Description:
After an unsuccessful attempt at claiming power peacefully,
Borko has decided to tear down Mirko’s village hall, which was
built for him out of cardboard by his loyal servants.
For this he will use Mirko’s microprocessor (which was
stolen from him by Borko’s friend Zvonko), a bucket of... | 28,943 |
Nature Reserve
Description:
In a Nature Reserve and Wildlife Park, there are
$N$ environmental
monitoring stations to monitor temperature, atmospheric
pressure, humidity, fire, water quality, etc. Each station,
labeled from $1$ to
$N$, uses solar panels to
supply energy for its operations. Ther... | 28,944 |
Naïve Convolution
Description:
You are given two polynomials. You should simply print their
product.
## Input
The first line of input contains two positive integers
$n, m$, the number of
coefficients in each polynomial. The next two lines contain one
polynomial each. Each polynomial is given as its c... | 28,945 |
Necklace
Description:
Frank the jeweller has to make an exclusive necklace for The
Queen. The necklace will consist of silver and gold beads whose
layout is exactly specified. All the gold beads are alike and
can be used interchangeably, and so can the silver ones. Frank
has prepared the beads for the ... | 28,946 |
Necklace Decomposition
Description:
The set of cyclic rotations of a string are the strings
obtained by embedding the string clockwise on a ring, with the
first character following on the last, starting at any
character position and moving clockwise on the ring until the
character preceeding the starti... | 28,947 |
Need for Speed
Description:
Sheila made a careful record of a recent journey and wants
to use this to compute $c$. The journey consisted of
$n$ segments. In the
$i^{\text {th}}$ segment
she traveled a distance of $d_
i$ and the speedometer read $s_ i$ for the entire segment. This
whole journey ... | 28,948 |
Negative Graph
Description:
It’s exam week. Once again, Victor spent so much time
studying for exams he fell asleep without setting an alarm. As
he hurriedly brushed his teeth and threw things into his bag,
he checked when the next bus leaves. To his surprise, the app
showed some trips where some legs ... | 28,949 |
Neighborhood Watch
Description:
Jennifer was nominated to be neighborhood watch captain and
is now in charge of managing the watch for her street.
Jennifer’s street consists of houses on only one side of the
road. She has a plan of which houses will be a neighborhood watch house and wants to know how
safe... | 28,950 |
Nekameleoni
Description:
“Hey! I have an awesome task with chameleons, $5$-th task for Saturday’s
competition.”
“Go ahead…”
(…)
“That’s too difficult, I have an easier one, they won’t even
solve that one.”
“You are given an array of $N$ integers from the interval
$[1, K]$. You need to
process $M$ q... | 28,951 |
Neo
Description:
Let us denote $A_{i,j}$
as the element from matrix $A$ located in the $i$-th row and $j$-th column. We say that the matrix
$A$ is cool if
this holds:
* $r, s > 1$
* $A_{1,1} + A_{r,s} \leq
A_{1,s} + A_{r,1}$
$r, s > 1$
$A_{1,1} + A_{r,s} \leq
A_{1,s} + A_{r,1}$
where $... | 28,952 |
Nered
Description:
In the nearby kindergarten they recently made up an
attractive game of strength and agility that kids love.
The surface for the game is a large flat area divided into
$N \times N$ squares.
The children lay large spongy cues onto the surface. The
sides of the cubes are the same length a... | 28,953 |
Nested Dolls
Description:
## Input
On the first line of input is a single positive integer
$1\leq t \leq 5$
specifying the number of test cases to follow. Each test case
begins with a positive integer $1
\leq m \leq 100\, 000$ on a line of itself telling the
number of dolls in the test case. Next ... | 28,954 |
Nested Shapes
Description:
Consider a sequence of $2$-dimensional regions in the plane,
$R_1, R_2, \ldots , R_ n$,
satisfying the following:
* Each $R_ i$ has one
of three shapes: (i) a circle, (ii) a
square (with sides parallel to the $x$-$y$ axes), or (iii) a
diamond (a square rotate... | 28,955 |
Networking
Description:
Gustaf will graduate next year and needs to choose his final
courses to study before starting his thesis project. Each
course provides a certain number of credits, but as a true
academic weapon, he already has more than enough credits to
graduate. His real goal is to study as mu... | 28,956 |
Neutral Ground
Description:
Two kingdoms had been at war for a long time, until the
emperor intervened to bring an end to the conflict. The
territory in question comprises an $M$ by $N$ rectangular grid. At the emperor’s
insistence, the two kings have withdrawn their troops until no
two opposing troops... | 28,957 |
Never Give Up
Description:
Your best friend, after the brutal murder of his entire clan
by none other than his own brother, decided to leave the
village to learn from the dark lord to exert his vengeance.
Unwilling to see him go down this dark path, you decided to
stop him and bring him back by force i... | 28,958 |
Never Jump Down
Description:
You are given a rooted tree of $N$ vertices where each vertex
$v_1$ through $v_ N$ is labeled with a non-negative
integer $u_1$ through
$u_ N$. The vertex
$v_1$ is the root.
Define a “jumping path” within the tree to be a sequence
$a_1, a_2, \ldots , a_ k$
of lengt... | 28,959 |
New Maths
Description:
“Drat!” cursed Charles. “This stupid carry bar is not
working in my Engine! I just tried to calculate the square of a
number, but it’s wrong; all of the carries are lost.”
“Hmm,” mused Ada, “arithmetic without carries! I wonder if I
can figure out what your original input was, based... | 28,960 |
New Salaries
Description:
Oh no! As a result of recent elections the “Random Laws”
party took control of the government. This is going to have bad
consequences for Mr. Bourgeois’ company, which just approved
the way new salaries will be calculated. The company has
$N$ workers and the salary
for wor... | 28,961 |
Nice Numbers
Description:
Either way, we will define our own one-dimensional version
of the game:
You are given a list of numbers containing only powers of
$2$. You can “compress”
this list by “pushing” it to the right. If two identical
numbers are next to each other, push will cause them to merge.
... | 28,962 |
Nice Path
Description:
When I go home, I don’t always choose the shortest path, but
rather a path that
* always takes me closer to my home, and
* is ”nicest”, in the sense that the average ”niceness
factor” of the path segments I pass is as high as
possible.
always takes me closer to my home, an... | 28,963 |
Nice Prefixes
Description:
Consider strings formed from characters from an alphabet of
size $K$. For example, if
$K = 4$, our alphabet
might be ${a,b,c,d}$, and
an example string is $bbcac$.
For a string $S$,
define $\mathrm{count}(S,
k)$ to be the number of occurrences of the symbol
$k$ i... | 28,964 |
Nicknames
Description:
You and your group of friends often use nicknames to refer
to each other. One day, you noticed that some of the nicknames
could refer to more than one person, which causes confusion.
For example, jo could refer to either
john or joseph.
Your task is to determine how many name... | 28,965 |
Nikola
Description:
Against his own will, Nikola has become the main character
in a game. The game is played on a row of $N$ squares, numbered $1$ to $N$. Nikola is initially in square
$1$ and can jump to other
squares. Nikola’s first jump must be to square $2$. Each subsequent jump must satisfy
two co... | 28,966 |
Nim Cheater
Description:
After solving all of the problems in an ACM contest
perfectly, Dai and Long celebrated their victory by a trip to
Stonehenge! At Stonehenge, Dai and
Long not only saw a huge henge but also
discovered $N$ heaps of
stones! Those heaps contain $a_1,
a_2, \ldots , a_ N$ sma... | 28,967 |
Nimionese
Description:
Nimions speak a funny form of language.
Whichever word they are trying to say, from which ever
language, it doesn’t quite come out the same. There are several
rules for converting words, from any language, to
nimionese.
For any word:
* All nimion words start with ‘hard’ consonants... | 28,968 |
Nine Knights
Description:
In the game of chess, knights are unique due to their
“L-shaped” movement. A knight can move, as shown in
Figure 1, by either moving two squares sideways and one
square up or down, or moving one square sideways and two
squares either up or down.
In the Nine Knights puzzle, ex... | 28,969 |
Nine Packs
Description:
This is a quote from the 1986 movie, “True Stories”, and
it’s true; well, almost true. You could buy four packs of
$10$ hotdogs and five
packs of $8$ buns. That
would give you exactly $40$ of each. However, you can make
things even with fewer packs if you buy two packs of
... | 28,970 |
Ninety-nine
Description:
You and your friend are playing a game which you call
Ninety-nine. You start, by saying either the number
$1$ or $2$. You then take turns, starting
with your friend, increasing this number by either $1$ or $2$ in each step. The first player who
gets to say the number $99$ wins!... | 28,971 |
Nizovi
Description:
An array in a certain programming language is defined in the
following way:
* The beginning and the end of an array is denoted by an
open and closed curly bracket, respectively.
* Inside the curly braces, there are $0$ or more values separated by
commas (there is no comma afte... | 28,972 |
No Duplicates
Description:
There is a game in which you try not to repeat a word while
your opponent tries to see if you have repeated one.
"THE RAIN IN SPAIN" has no repeats.
"IN THE RAIN AND THE SNOW" repeats THE.
"THE RAIN IN SPAIN IN THE PLAIN" repeats THE and IN.
Write a program to test a phrase.
## Inpu... | 28,973 |
No Thanks!
Description:
In the card game “No Thanks,” the deck of cards consists of
$36$ cards numbered
$1$–$36$, and players collect cards to
their score pile as the game is played. A player’s final score
is the sum of the numbers on their collected cards, with one
exception: if a player has colle... | 28,974 |
No Trees But Flowers
Description:
Tom and Sarah soon have their second anniversary and he
wants to buy her something special. Even though she’s very keen
on any kind of tree, he thinks that this probably is too big of
a gift. So, he decides to buy her flowers. But not the lame cut
off ones that will di... | 28,975 |
No Way? Many Ways!
Description:
After a long day of studying at school, Jack is eager to get
home. But today, it seems like there are several roadworks in
the area where Jack usually walks. These are not just any
roadworks; they are special modular equation roadworks taking
place between the school and... | 28,976 |
Non-Prime Factors
Description:
In many programming competitions, we are asked to find (or
count the number of) Prime Factors of an integer $i$. This is boring. This time, let’s
count the number of Non-Prime Factors of an integer
$i$, denoted as NPF(i).
For example, integer $100$ has the following nine fac... | 28,977 |
Non-boring sequences
Description:
We were afraid of making this problem statement too
boring, so we decided to keep it short. A sequence is
called non-boring if its every connected subsequence
contains a unique element, i.e. an element such that no other
element of that subsequence has the same value. ... | 28,978 |
Non-negative Partial Sums
Description:
You are given a sequence of $n$ numbers $a_0, \ldots , a_{n-1}$. A cyclic
shift by $k$ positions
($0 \le k \le n-1$)
results in the following sequence: $a_ k, a_{k+1}, \ldots , a_{n-1}, a_0, a_1,
\ldots , a_{k-1}$. How many of the $n$ cyclic shifts satisfy the
... | 28,979 |
Noonerized Spumbers
Description:
Everyone has heard of spoonerisms, named after William
Archibald Spooner, an Oxford professor who had a habit of
swapping prefixes of words, often with comical results. “May I
show you to your seat?” became “May I sew you to your sheet?”
and “a crushing blow” became “a ... | 28,980 |
Nordic Camping
Description:
When camping in the highlands of the Nordic countries,
having a reliable source of water can be a matter of life and
death. Traditionally Nordic campers have always pitched their
tents over a water source such that water can be fetched at any
time without having to go outsid... | 28,981 |
Norma
Description:
Mirko got an array of integers for his birthday from his
grandmother Norma. As any other kid, he was hoping for some
money, but got an array. Luckily, in his town there is a pawn
shop that buys up arrays. The cost of an array of integers is
$\min \cdot \max \cdot L$
kunas, where ... | 28,982 |
Not Amused
Description:
Ordinarily, when you got to an amusement park, you pay for
your ticket, you ride as many rides as you like and then you
leave at the end of the day. If you leave early or get there
late you don’t get a discount. Bob’s Pretty Safe Playland is
ramping up a new plan to help attract... | 28,983 |
Not Another Constructive!
Description:
Sick of solving geometry problems, you decide to solve the
following constructive problem: find a string of length
$n$ that contains exactly
$k$ not necessarily
contiguous subsequences of NAC.
This problem seems too familiar though. Here’s the twist -
your fr... | 28,984 |
Notable Quotables
Description:
Programmers often want to put quotation marks inside
quote-delimited string literals (we’ll just call them
‘strings’) in programs they write. However, since in C/C++ the
double-quote character is used to begin and end strings, you
have to escape the string delimiting char... | 28,985 |
Nullary Computer
Description:
Brian Huck has invented a new power-saving computer. With
the current CMOS-based processors, a certain amount of power is
lost each time a bit is changed from $0$ to $1$ or back. To avoid this problem,
Brian’s new Nullary Core stores only zeros. All numbers are
stored in n... | 28,986 |
Number Anagrams
Description:
Tom is really interested in numbers, so he decided to become
an accountant. To his great pleasure, he gets to see lots of
numbers every day in his new job. Even though it is exciting to
see all these numbers, the actual work happens to be boring. In
order to combat boredom,... | 28,987 |
Number Colosseum
Description:
Welcome to the Number Colosseum, where two teams of integers
are preparing to battle! On the left side of the number line we
have team Negatives while on the right
side we have team Positives. Every
integer fighting in the colosseum is on one of these two
teams.
At th... | 28,988 |
Number Fun
Description:
Ms. Greene is trying to design a game for her third-grade
class to practice their addition, subtraction, multiplication,
and division. She would like for every student in her class to
be able to “think mathematically” and determine if any two
given numbers can be added, subtract... | 28,989 |
Number Magic
Description:
Alice and Bob engage in a strategic duel called Number
Magic, where Alice initially chooses a positive integer
$N$ called the
starting number. The game permits two specific magic
operations to be performed on a positive integer $K$:
* Say $K$ has
$D$ digits. One
... | 28,990 |
Number Plates
Description:
Simon is in charge of a top secret spy network. Often when
you’re a spy, you are yourself spied upon. Simon’s enemies
usually spy on him from their cars, but unfortunately he
doesn’t know what cars they are in.
For every car he sees, he records its number plate on his
cell p... | 28,991 |
Number Sets
Description:
Note that this is an easier version of the problem
numbersetshard.
You start with a sequence of consecutive integers. You want
to group them into sets.
You are given the interval, and an integer $P$. Initially, each number in the
interval is in its own set.
Then you consider eac... | 28,992 |
Number Sets (Hard)
Description:
Note that this is a harder version of the problem
numbersetseasy.
You start with a sequence of consecutive integers. You want
to group them into sets.
You are given the interval, and an integer $P$. Initially, each number in the
interval is in its own set.
Then you consid... | 28,993 |
Number Squistem
Description:
Ponyo, after becoming human, needed to learn math. She
quickly realized that $0$
is the most boring looking number.
So she created the glyph “<]:=” which replaces
$0$, in remembrance of her
friends the squids.
Thus, $10$ is now
$1$<]:=, and
$99 + 1 =
1$<]:=<]:... | 28,994 |
Number Theoretic Transform
Description:
You are given two polynomials. You should simply print their
product. This time you have to do it fast though and modulo
$998\, 244\, 353$.
## Input
The first line of input contains two positive integers
$n, m$, the number of
coefficients in each polynomial. Th... | 28,995 |
Number Trick
Description:
Lukas wants to demonstrate that this last method works for
any $X$. To do this he
will ask his audience for values of $X$ and then show them example
multiplications for which the method works. Lukas has noticed
that he can not just pick arbitrary numbers for his examples,
... | 28,996 |
Numbers
Description:
In this problem, you have to find the last three digits
before the decimal point for the number $(3 + \sqrt {5})^ n$.
For example, when $n =
5$, $(3 + \sqrt {5})^5 =
3935.73982...$. The answer is $935$.
For $n = 2$,
$(3 + \sqrt {5})^2 =
27.4164079...$. The answer is $027$.
#... | 28,997 |
Numbers On a Tree
Description:
Lovisa is at KTH listening to Stefan Nilsson lecturing about
perfect binary trees. “A perfect binary tree has a
distinguished node called the root which is usually
drawn at the top. Each node has two children except the nodes
in the lowest layer, which we call leaves.” Lo... | 28,998 |
Numble
Description:
Numble is a crossword game that is similar to
Scrabble, but with numbers. The player has a hand of tiles with
digits on them ($1$–$9$) and needs to make sequences of
numbers using a subset of the tiles in hand to place on the
board. The rules of a valid number sequence are:
* A val... | 28,999 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.