
Lazy Security Guard
Your security guard friend recently got a new job at a new security company. The company requires him to patrol an area of the city […]
Your security guard friend recently got a new job at a new security company. The company requires him to patrol an area of the city […]
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Startup qualification round to compete onsite for the final round. […]
The annual college sports-ball tournament is approaching, which for trademark reasons we’ll refer to as Third Month Insanity. There are a total of 2 N teams participating in […]
n evenly spaced points have been marked around the edge of a circle. There is a number written at each point. You choose a positive real […]
It’s another Startup, and that means there are T-shirts to order. In order to make sure T-shirts are shipped as soon as possible, we’ve decided […]
There are n student groups at the university. During the study day, each group can take no more than 7 classes. Seven time slots numbered from 1 to 7 are allocated for the […]
Vasya came up with his own weather forecasting method. He knows the information about the average air temperature for each of the last n days. Assume that […]
Doubly linked list is one of the fundamental data structures. A doubly linked list is a sequence of elements, each containing information about the previous […]
Ivan has an array consisting of n different integers. He decided to reorder all elements in increasing order. Ivan loves merge sort so he decided to represent […]
Polycarp plans to conduct a load testing of its new project Fakebook. He already agreed with his friends that at certain points in time they […]
Recall that the bracket sequence is considered regular if it is possible to insert symbols ‘+’ and ‘1’ into it so that the result is […]
The Berland’s capital has the form of a rectangle with sizes n × m quarters. All quarters are divided into three types: regular (labeled with the character ‘.’) — […]
The elections to Berland parliament are happening today. Voting is in full swing! Totally there are n candidates, they are numbered from 1 to n. Based on election results k (1 ≤ k ≤ n) top […]
In the computer network of the Berland State University there are n routers numbered from 1 to n. Some pairs of routers are connected by patch cords. Information can be […]
In the evening Polycarp decided to analyze his today’s travel expenses on public transport. The bus system in the capital of Berland is arranged in […]
Soon the first year students will be initiated into students at the University of Berland. The organizers of the initiation come up with a program […]
Harry Potter is on a mission to destroy You-Know-Who’s Horcruxes. The first Horcrux that he encountered in the Chamber of Secrets is Tom Riddle’s diary. […]
Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present there. He saw Marvolo […]