question_id stringlengths 6 10 | question stringlengths 29 13.1k | starter_code stringlengths 0 1.47k |
|---|---|---|
seed_0 | Chef has a cubic die with 6 faces kept on an infinite plane. Each face has a distinct integer in the range [1,6] written on it, but the exact arrangement of the numbers on the faces of the die is unknown to Chef. Curiosity gets the better of Chef and he wants to find out o(1), o(2), ..., o(6), where o(i) is the number ... | |
seed_1 | Input
The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of points on a plane.
Each of the next n lines contains two real coordinates xi and yi of the <image> point, specified with exactly 2 fractional digits. All coordinates are between - 1000 and 1000, inclusive.
Output
Output a single real n... | |
seed_2 | Input
The first line of the input contains a single integer N (1 ≤ N ≤ 24). The next N lines contain 5 space-separated integers each. The first three integers will be between 0 and 2, inclusive. The last two integers will be between 0 and 3, inclusive. The sum of the first three integers will be equal to the sum of th... | |
seed_3 | Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
GENIUS
Output
YES
Input
DOCTOR
Output
NO
Input
IRENE
Output
YES
Input
MARY
Output
NO
Input
SMARTPHO... | |
seed_4 | Input
The input consists of a single string of uppercase letters A-Z. The length of the string is between 1 and 10 characters, inclusive.
Output
Output "YES" or "NO".
Examples
Input
NEAT
Output
YES
Input
WORD
Output
NO
Input
CODER
Output
NO
Input
APRILFOOL
Output
NO
Input
AI
Out... | |
seed_5 | Input
The input contains a single integer a (0 ≤ a ≤ 35).
Output
Output a single integer.
Examples
Input
3
Output
8
Input
10
Output
1024 | |
seed_6 | Input
The input contains a single integer a (0 ≤ a ≤ 63).
Output
Output a single number.
Examples
Input
2
Output
2
Input
5
Output
24
Input
35
Output
50 | |
seed_7 | Input
The input contains a single integer a (1 ≤ a ≤ 30).
Output
Output a single integer.
Example
Input
3
Output
27 | |
seed_8 | Input
The input contains a single integer a (1 ≤ a ≤ 40).
Output
Output a single string.
Examples
Input
2
Output
Adams
Input
8
Output
Van Buren
Input
29
Output
Harding | |
seed_9 | Input
The input contains a single integer a (1 ≤ a ≤ 64).
Output
Output a single integer.
Examples
Input
2
Output
1
Input
4
Output
2
Input
27
Output
5
Input
42
Output
6 | |
seed_10 | Input
The input contains a single integer a (1 ≤ a ≤ 99).
Output
Output "YES" or "NO".
Examples
Input
5
Output
YES
Input
13
Output
NO
Input
24
Output
NO
Input
46
Output
YES | |
seed_11 | Input
The input contains a single integer a (10 ≤ a ≤ 999).
Output
Output 0 or 1.
Examples
Input
13
Output
1
Input
927
Output
1
Input
48
Output
0 | |
seed_12 | Input
The input contains two integers N, M (1 ≤ N ≤ 1024, 2 ≤ M ≤ 16), separated by a single space.
Output
Output "YES" or "NO".
Examples
Input
2 3
Output
YES
Input
3 2
Output
NO
Input
33 16
Output
YES
Input
26 5
Output
NO | |
seed_13 | Input
The input contains two integers a1, a2 (0 ≤ ai ≤ 109), separated by a single space.
Output
Output a single integer.
Examples
Input
3 14
Output
44
Input
27 12
Output
48
Input
100 200
Output
102 | |
seed_14 | Input
The only line of input contains three integers a1, a2, a3 (1 ≤ a1, a2, a3 ≤ 20), separated by spaces.
Output
Output a single integer.
Examples
Input
2 3 2
Output
5
Input
13 14 1
Output
14
Input
14 5 9
Output
464
Input
17 18 3
Output
53 | |
seed_15 | Input
The only line of the input contains a 7-digit hexadecimal number. The first "digit" of the number is letter A, the rest of the "digits" are decimal digits 0-9.
Output
Output a single integer.
Examples
Input
A278832
Output
0
Input
A089956
Output
0
Input
A089957
Output
1
Input
A144045... | |
seed_16 | Input
The only line of the input contains a string of digits. The length of the string is between 1 and 10, inclusive.
Output
Output "Yes" or "No".
Examples
Input
373
Output
Yes
Input
121
Output
No
Input
436
Output
Yes | |
seed_17 | Input
The only line of the input is a string of 7 characters. The first character is letter A, followed by 6 digits. The input is guaranteed to be valid (for certain definition of "valid").
Output
Output a single integer.
Examples
Input
A221033
Output
21
Input
A223635
Output
22
Input
A232726
Output
... | |
seed_18 | Interaction
This is an interactive problem. You need to read participants' queries from standard input and print your responses to standard output. You don't know the number of queries upfront, so you'll need to process them as you get them; you'll know you're done once you reach the end of the file.
In each query, y... | |
seed_19 | Nephren is playing a game with little leprechauns.
She gives them an infinite array of strings, *f*0... ∞.
*f*0 is "What are you doing at the end of the world? Are you busy? Will you save us?".
She wants to let more people know about it, so she defines *f**i*<==<= "What are you doing while sending "*f**i*<=-<=1"? Ar... | |
seed_20 | # robots
Marita’s little brother has left toys all over the living room floor! Fortunately, Marita has developed special robots to clean up the toys. She needs your help to determine which robots should pick up which toys.
There are **T** toys, each with an integer weight `W[i]` and an integer size `S[i]`. Robots co... | |
seed_21 | # robots
Marita’s little brother has left toys all over the living room floor! Fortunately, Marita has developed special robots to clean up the toys. She needs your help to determine which robots should pick up which toys.
There are **T** toys, each with an integer weight `W[i]` and an integer size `S[i]`. Robots co... | |
seed_22 | # robots
Marita’s little brother has left toys all over the living room floor! Fortunately, Marita has developed special robots to clean up the toys. She needs your help to determine which robots should pick up which toys.
There are **T** toys, each with an integer weight `W[i]` and an integer size `S[i]`. Robots co... | |
seed_23 | # robots
Marita’s little brother has left toys all over the living room floor! Fortunately, Marita has developed special robots to clean up the toys. She needs your help to determine which robots should pick up which toys.
There are **T** toys, each with an integer weight `W[i]` and an integer size `S[i]`. Robots co... | |
seed_24 | # robots
Marita’s little brother has left toys all over the living room floor! Fortunately, Marita has developed special robots to clean up the toys. She needs your help to determine which robots should pick up which toys.
There are **T** toys, each with an integer weight `W[i]` and an integer size `S[i]`. Robots co... | |
seed_25 | **Note: The memory limit for this problem is 512MB, twice the default.**
Farmer John created $N$ ($1\le N\le 10^5$) problems. He then recruited $M$
($1\le M\le 20$) test-solvers, each of which rated every problem as "easy" or
"hard."
His goal is now to create a problemset arranged in increasing order of
difficulty, c... | |
seed_26 | **Note: The time limit for this problem in Python is 15s. Other languages have the default time limit of 2s.**
Each of Farmer John's $N$ barns ($2\le N\le 10^5$) has selected a team of $C$
cows ($1\le C\le 18$) to participate in field day. The breed of every cow is
either a Guernsey or a Holstein.
The difference b... | |
seed_27 | **Note: The time limit for this problem is 3s, 1.5x the default.**
Bessie likes to watch shows on Cowflix, and she watches them in different
places. Farmer John's farm can be represented as a tree with $N$
($2 \leq N \leq 2\cdot 10^5$) nodes, and for each node, either Bessie watches
Cowflix there or she doesn't. It is ... | |
seed_28 | **Note: The time limit for this problem is 3s, 1.5x the default.**
FJ gave Bessie an array $a$ of length $N$
($2\le N\le 500, -10^{15}\le a_i\le 10^{15}$) with all $\frac{N(N+1)}{2}$
contiguous subarray sums distinct. For each index $i\in [1,N]$, help Bessie
compute the minimum amount it suffices to change $a_i$ by so ... | |
seed_29 | **Note: The time limit for this problem is 4s, 2x the default.**
Farmer John's $N$ cows ($1\le N\le 1.5\cdot 10^5$) have integer milk production
values $a_1,\dots,a_N$. That is, the $i$th cow produces $a_i$ units of milk per
minute, with $0 \leq a_i \leq 10^8$.
Each morning, Farmer John starts with all $N$ cows hoo... | |
seed_30 | **Note: The time limit for this problem is 4s, 2x the default.**
Pareidolia is the phenomenon where your eyes tend to see familiar patterns in
images where none really exist -- for example seeing a face in a cloud. As you
might imagine, with Farmer John's constant proximity to cows, he often sees
cow-related patterns ... | |
seed_31 | **Note: The time limit for this problem is 4s, 2x the default.**
To celebrate the start of spring, Farmer John's $N$ cows ($1 \leq N \leq 2 \cdot 10^5$) have invented an intriguing new dance, where they stand in a circle and re-order themselves in a predictable way.
Specifically, there are $N$ positions around the cir... | |
seed_32 | **Note: The time limit for this problem is 4s, twice the default. The memory
limit for this problem is 512MB, twice the default.**
Farmer John has $N$ ($2\le N\le 2\cdot 10^5$) tractors, where the $i$th tractor
can only be used within the inclusive interval $[\ell_i,r_i]$. The tractor intervals
have left endpoints $\e... | |
seed_33 | **Note: The time limit for this problem is 4s, twice the default. The memory
limit for this problem is 512MB, twice the default.**
Pareidolia is the phenomenon where your eyes tend to see familiar patterns in
images where none really exist -- for example seeing a face in a cloud. As you
might imagine, with Farmer John... | |
seed_34 | **Note: The time limit for this problem is 4s, twice the default.**
Bessie wants to go to sleep, but the farm's lights are keeping her awake. How
can she turn them off?
Bessie has two bit strings of length $N$ ($2\le N\le 20$), representing a
sequence of lights and a sequence of switches, respectively. Each light is
... | |
seed_35 | **Note: The time limit for this problem is 4s, twice the default.**
Bessie is on vacation! Due to some recent technological advances, Bessie will
travel via technologically sophisticated flights, which can even time travel.
Furthermore, there are no issues if two "parallel" versions of Bessie ever meet.
In the count... | |
seed_36 | **Note: The time limit for this problem is 4s, two times the default.**
Somebody has been grazing in Farmer John's $(1 \le G \le 10^5)$
private gardens! Using his expert forensic knowledge, FJ has been able to
determine the precise time each garden was grazed. He has also determined that
there was a single cow that w... | |
seed_37 | **Note: The time limit for this problem is 5s, 2.5 times the default. The memory limit for this problem is 512MB, twice the default.**
Bessie has recently taken an interest in magic and needs to collect mana for a
very important spell. Bessie has $N$ ($1\le N\le 18$) mana pools, the $i$th of
which accumulates $m_i$ ma... | |
seed_38 | **Note: The time limit for this problem is 6s, three times the default. The
memory limit for this problem is 512MB, twice the default.**
Bessie is a hungry cow. Each day, for dinner, if there is a haybale in the barn,
she will eat one haybale. Farmer John does not want Bessie to starve, so some
days he sends a delivery... | |
seed_39 | **Note: The time limit for this problem is 8s, four times the default.**
Farmer John has a big square field split up into an $(N+1)\times (N+1)$
($1\le N\le 1500$) grid of cells. Let cell $(i, j)$ denote the cell in the $i$th
row from the top and $j$th column from the left. There is one cow living in
every cell $(i, j... | |
seed_40 | A stamp painting is a black and white painting on an $N \times N$ canvas,
where certain cells are inked while others are blank. It can be described by an
$N\times N$ array of characters ($1\le N\le 20$). The $i$th entry of the $j$th
column of the array is equal to * if the canvas contains ink at that square and
. othe... | |
seed_41 | Because Bessie is bored of playing with her usual text string where the only
characters are 'C,' 'O,' and 'W,' Farmer John gave her $Q$ new strings
($1 \leq Q \leq 100$), where the only characters are 'M' and 'O.' Bessie's
favorite word out of the characters 'M' and 'O' is obviously "MOO," so she wants
to turn each of ... | |
seed_42 | Bessie and Elsie are plotting to overthrow Farmer John at last! They plan it out
over $N$ ($1\le N\le 2\cdot 10^5$) text messages. Their conversation can be
represented by a string $S$ of length $N$ where $S_i$ is either $B$ or $E$,
meaning the $i$th message was sent by Bessie or Elsie, respectively.
However, Farmer ... | |
seed_43 | Bessie has opened a bakery!
In her bakery, Bessie has an oven that can produce a cookie in $t_C$ units of
time or a muffin in $t_M$ units of time ($1\le t_C,t_M\le 10^9$). Due to space
constraints, Bessie can only produce one pastry at a time, so to produce $A$
cookies and $B$ muffins, it takes $A \cdot t_C + B \cdot ... | |
seed_44 | Bessie is a hungry cow. Each day, for dinner, if there is a haybale in the barn,
she will eat one haybale. Farmer John does not want Bessie to starve, so some
days he sends a delivery of haybales, which arrive in the morning (before
dinner). In particular, on day $d_i$, Farmer John sends a delivery of $b_i$
haybales ($... | |
seed_45 | Bessie is using the latest and greatest innovation in text-editing software,
miV! Its powerful find-and-replace feature allows her to find all occurrences of
a lowercase English letter $c$ and replace each with a nonempty string of
lowercase letters $s$. For example, given the string "$\texttt{ball}$", if
Bessie select... | |
seed_46 | Bessie is using the latest and greatest innovation in text-editing software,
miV! She starts with an input string consisting solely of upper and lowercase
English letters and wishes to transform it into some output string. With just
one keystroke, miV allows her to replace all occurrences of one English letter
$c_1$ in... | |
seed_47 | Bessie likes to watch shows on Mooloo. Because Bessie is a busy cow, she has
planned a schedule for the next $N$ ($1 \leq N \leq 10^5$) days that she will
watch Mooloo. Because Mooloo is a paid subscription service, she now needs to
decide how to minimize the amount of money she needs to pay.
Mooloo has an interesting... | |
seed_48 | Due to the disorganized structure of his mootels (much like motels but with
bovine rather than human guests), Farmer John has decided to take up the role of
the mootel custodian to restore order to the stalls.
Each mootel has $N$ stalls labeled $1$ through $N$ ($1 \le N \le 10^5$) and $M$
($0 \le M \le 10^5$) corridor... | |
seed_49 | Farmer John has $N$ cows ($2 \leq N \leq 10^5$). Each cow has a breed that is
either Guernsey or Holstein. As is often the case, the cows are standing in a
line, numbered $1 \ldots N$ in this order.
Over the course of the day, each cow writes down a list of cows. Specifically,
cow $i$'s list contains the range of ... | |
seed_50 | Farmer John is interested in better interacting with his fellow cows, so he
decided he will learn the moo language!
Moo language is actually quite similar to English, but more minimalistic. There
are only four types of words: nouns, transitive verbs, intransitive verbs, and
conjunctions. Every two consecutive words mu... | |
seed_51 | Farmer John wrote down $N$ ($1\le N\le 300$) digits on pieces of paper. For
each $i\in [1,N]$, the $i$th piece of paper contains digit $a_i$
($1 \leq a_i \leq 9$).
The cows have two favorite integers $A$ and $B$ ($1\le A\le B< 10^{18}$), and
would like you to answer $Q$ ($1\le Q\le 5\cdot 10^4$) queries. For the $i$... | |
seed_52 | Farmer Nhoj dropped Bessie in the middle of nowhere! At time $t=0$, Bessie is
located at $x=0$ on an infinite number line. She frantically searches for an
exit by moving left or right by $1$ unit each second. However, there actually is
no exit and after $T$ seconds, Bessie is back at $x=0$, tired and resigned.
Farmer... | |
seed_53 | Farmer Nhoj dropped Bessie in the middle of nowhere! At time $t=0$, Bessie is
located at $x=0$ on an infinite number line. She frantically searches for an
exit by moving left or right by $1$ unit each second. However, there actually is
no exit and after $T$ seconds, Bessie is back at $x=0$, tired and resigned.
Farmer... | |
seed_54 | For any two positive integers $a$ and $b$, define the function
$\texttt{gen_string}(a,b)$ by the following Python code:
def gen_string(a: int, b: int):
res = ""
ia, ib = 0, 0
while ia + ib < a + b:
if ia * b <= ib * a:
res += '0'
ia += 1
else:
res += '1'
ib += 1
return res
Equivalent C++ code:
... | |
seed_55 | For the New Year celebration, Bessie and her friends have constructed a giant
tree with many glowing ornaments. Bessie has the ability to turn the ornaments
on and off through remote control. Before the sun rises, she wants to toggle
some of the ornaments in some order (possibly toggling an ornament more than
once) suc... | |
seed_56 | Having just completed a course in graph algorithms, Bessie the cow has begun
coding her very own graph visualizer! Currently, her graph visualizer is only
capable of visualizing rooted trees with nodes of distinct values, and it can
only perform one kind of operation: merging.
In particular, a merging operation takes ... | |
seed_57 | Pareidolia is the phenomenon where your eyes tend to see familiar patterns in
images where none really exist -- for example seeing a face in a cloud. As you
might imagine, with Farmer John's constant proximity to cows, he often sees
cow-related patterns in everyday objects. For example, if he looks at the
string "bqe... | |
seed_58 | There are $N$ pastures ($2 \le N \le 2\cdot 10^5$), connected by $N-1$ roads,
such that they form a tree. Every road takes 1 second to cross. Each pasture
starts out with 0 grass, and the $i$th pasture's grass grows at a rate of $a_i$
($1\le a_i\le 10^8$) units per second. Farmer John is in pasture 1 at the
start, a... | |
seed_59 | There are initially $N-1$ pairs of friends among FJ's $N$
($2\le N\le 2\cdot 10^5$) cows labeled $1\dots N$, forming a tree. The cows are
leaving the farm for vacation one by one. On day $i$, the $i$th cow leaves the
farm, and then all pairs of the $i$th cow's friends still present on the farm
become friends.
For eac... | |
seed_60 | With the hottest recorded summer ever at Farmer John's farm, he needs a way to
cool down his cows. Thus, he decides to invest in some air conditioners.
Farmer John's $N$ cows ($1 \leq N \leq 20$) live in a barn that contains a
sequence of stalls in a row, numbered $1 \ldots 100$. Cow $i$ occupies a range
of these ... | |
seed_61 | ++++++++[>+>++>+++>++++>+++++>++++++>+++++++>++++++++>+++++++++>++++++++++>+
++++++++++>++++++++++++>+++++++++++++>++++++++++++++>+++++++++++++++>+++++++
+++++++++<<<<<<<<<<<<<<<<-]>>>>>>>>>>.<<<<<<<<<<>>>>>>>>>>>>>>++.--<<<<<<<<<
<<<<<>>>>>>>>>>>>>+.-<<<<<<<<<<<<<>>>>>>>>>>>>>>--.++<<<<<<<<<<<<<<>>>>>>>>>
... | |
seed_62 | HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R S... | |
seed_63 | There was once young lass called Mary,
Whose jokes were occasionally scary.
On this April's Fool
Fixed limerick rules
Allowed her to trip the unwary.
Can she fill all the lines
To work at all times?
On juggling the words
Right around two-thirds
She ne... | |
seed_64 | per nextum in unam tum XI conscribementis fac sic
vestibulo perlegementum da varo.
morde varo.
seqis cumula varum.
cis
per nextum in unam tum XI conscribementis fac sic
seqis decumulamenta da varo.
varum privamentum fodementum da aresulto.
v... | |
seed_65 | !
Input
!
Output
!
Examples
Input
?
Output
?
Note
Scoring:
!
! | |
seed_66 | 
The other day I saw an amazing video where a guy hacked some wifi controlled lightbulbs by flying a drone past them. Brilliant.
In this kata we will recreate that stunt... sort of.
You will be given two strings: `lamps` and `drone`. `lamps` represents ... | def fly_by(lamps, drone):
|
seed_67 | 
Create a class called `Warrior` which calculates and keeps track of their level and skills, and ranks them as the warrior they've proven to be.
Business Rules:
- A warrior starts at level 1 and can progress all the ... | def __init__(self):
|
seed_68 | "ACM48" is one of the most popular dance vocal units in Japan. In this winter, ACM48 is planning a world concert tour. You joined the tour as a camera engineer.
Your role is to develop software which controls the camera on a stage. For simplicity you can regard the stage as 2-dimensional space. You can rotate the came... | |
seed_69 | "Balloons should be captured efficiently", the game designer says. He is designing an oldfashioned game with two dimensional graphics. In the game, balloons fall onto the ground one after another, and the player manipulates a robot vehicle on the ground to capture the balloons. The player can control the vehicle to mov... | |
seed_70 | "Bless us and splash us , precious . Thats a meaty mouthful . " said Gollum on seeing
Bilbo Baggins . Poor Bilbo Baggins is lost in the Misty Mountains and worst of all now he is
stuck with Gollum who wants to finish him off. As Mr. Bilbo Baggins is clever , he convinced
Gollum to play a game of riddles where if Bil... | |
seed_71 | "Contestant who earns a score equal to or greater than the *k*-th place finisher's score will advance to the next round, as long as the contestant earns a positive score..." — an excerpt from contest rules.
A total of *n* participants took part in the contest (*n*<=≥<=*k*), and you already know their scores. Calculate... | |
seed_72 | "Contestant who earns a score equal to or greater than the k-th place finisher's score will advance to the next round, as long as the contestant earns a positive score..." — an excerpt from contest rules.
A total of n participants took part in the contest (n ≥ k), and you already know their scores. Calculate how many ... | |
seed_73 | "Don't Drink and Drive, but when you do, Better Call Saul."
Once Jesse and Walter were fighting over extra cash, and Saul decided to settle it with a game of stone piles whose winner gets the extra money. The game is described as follows :
There are N$N$ piles of stones with A$A$1$1$,$,$ A$A$2$2$,$,$ ...$...$ A$A$N$N$ ... | |
seed_74 | "Duel!"
Betting on the lovely princess Claris, the duel between Tokitsukaze and Quailty has started.
There are $$$n$$$ cards in a row. Each card has two sides, one of which has color. At first, some of these cards are with color sides facing up and others are with color sides facing down. Then they take turns flippin... | |
seed_75 | "Duel!"
Betting on the lovely princess Claris, the duel between Tokitsukaze and Quailty has started.
There are $n$ cards in a row. Each card has two sides, one of which has color. At first, some of these cards are with color sides facing up and others are with color sides facing down. Then they take turns flipping ca... | |
seed_76 | "Duel!"
Betting on the lovely princess Claris, the duel between Tokitsukaze and Quailty has started.
There are n cards in a row. Each card has two sides, one of which has color. At first, some of these cards are with color sides facing up and others are with color sides facing down. Then they take turns flipping card... | |
seed_77 | "Eat a beaver, save a tree!" — That will be the motto of ecologists' urgent meeting in Beaverley Hills.
And the whole point is that the population of beavers on the Earth has reached incredible sizes! Each day their number increases in several times and they don't even realize how much their unhealthy obsession with t... | |
seed_78 | "Everybody! Doremy's Perfect Math Class is about to start! Come and do your best if you want to have as much IQ as me!" In today's math class, Doremy is teaching everyone subtraction. Now she gives you a quiz to prove that you are paying attention in class.
You are given a set $$$S$$$ containing positive integers. You... | |
seed_79 | "Everybody! Doremy's Perfect Math Class is about to start! Come and do your best if you want to have as much IQ as me!" In today's math class, Doremy is teaching everyone subtraction. Now she gives you a quiz to prove that you are paying attention in class.
You are given a set $S$ containing positive integers. You may... | |
seed_80 | "Everything has been planned out. No more hidden concerns. The condition of Cytus is also perfect.
The time right now...... 00:01:12......
It's time."
The emotion samples are now sufficient. After almost 3 years, it's time for Ivy to awake her bonded sister, Vanessa.
The system inside A.R.C.'s Library core can be c... | |
seed_81 | "Everything in the universe is balanced. Every disappointment you face in life will be balanced by something good for you! Keep going, never give up."
Let's call a string balanced if all characters that occur in this string occur in it the same number of times.
You are given a string $S$; this string may only contain u... | |
seed_82 | "Fukusekiken" is a popular ramen shop where you can line up. But recently, I've heard some customers say, "I can't afford to have vacant seats when I enter the store, even though I have a long waiting time." I'd like to find out why such dissatisfaction occurs, but I'm too busy to check the actual procession while the ... | |
seed_83 | "Hey, it's homework time" — thought Polycarpus and of course he started with his favourite subject, IT. Polycarpus managed to solve all tasks but for the last one in 20 minutes. However, as he failed to solve the last task after some considerable time, the boy asked you to help him.
The sequence of *n* integers is cal... | |
seed_84 | "Hey, it's homework time" — thought Polycarpus and of course he started with his favourite subject, IT. Polycarpus managed to solve all tasks but for the last one in 20 minutes. However, as he failed to solve the last task after some considerable time, the boy asked you to help him.
The sequence of n integers is calle... | |
seed_85 | "How did you get the deal,how did he agree?"
"Its's simple Tom I just made him an offer he couldn't refuse"
Ayush is the owner of a big construction company and a close aide of Don Vito The Godfather, recently with the help of the Godfather his company has been assigned a big contract according to the contract he has ... | |
seed_86 | "Humankind cannot gain anything without first giving something in return. To obtain, something of equal value must be lost. That is alchemy's first law of Equivalent Exchange. In those days, we really believed that to be the world's one, and only truth."
-- Alphonse Elric
Now, here we have an equivalent exchange law fo... | |
seed_87 | "I don't have any fancy quotes." - vijju123
Chef was reading some quotes by great people. Now, he is interested in classifying all the fancy quotes he knows. He thinks that all fancy quotes which contain the word "not" are Real Fancy; quotes that do not contain it are regularly fancy.
You are given some quotes. For eac... | |
seed_88 | "I have only one rule, never submit partially correct code" -Barney Stinson
The religious act which Barney and his friends hold most sacred, XORING the natural numbers in the given range. This time Barney is a bit busy with picking up some girls, so he asked you to help him. He gave you two numbers $L$ and $R$, you ha... | |
seed_89 | "I heard that you're settled down
That you found a girl and you're married now.
I heard that your dreams came true.
Guess she gave you things I didn't give to you."
Adele just got news about her old lover. She is in her study, reminiscing all the memories they shared and feeling lonely.
After some initi... | |
seed_90 | "I'm a fan of anything that tries to replace actual human contact." - Sheldon.
After years of hard work, Sheldon was finally able to develop a formula which would diminish the real human contact.
He found k$k$ integers n1,n2...nk$n_1,n_2...n_k$ . Also he found that if he could minimize the value of m$m$ such that ∑k... | |
seed_91 | "I've been here once," Mino exclaims with delight, "it's breathtakingly amazing."
"What is it like?"
"Look, Kanno, you've got your paintbrush, and I've got my words. Have a try, shall we?"
There are four kinds of flowers in the wood, Amaranths, Begonias, Centaureas and Dianthuses.
The wood can be represented by a ... | |
seed_92 | "IT can do almost everything using codes", a Arjun(a CS Student) says to his mathematics' teacher. Mathematics teacher gives a very simple problem to solve using codes but Arjun got stuck. The problem was find out all those pairs of two numbers whose multiplication is divisible by their sum, i.e.
You are given a numb... | |
seed_93 | "If you didn't copy assignments during your engineering course, did you even do engineering?"
There are $Q$ students in Chef's class. Chef's teacher has given the students a simple assignment:
Write a function that takes as arguments an array $A$ containing only unique elements and a number $X$ guaranteed to be present... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 18