Train HijackYou and your friend Daneliya Tuleshova are planning to hijack a train. Your friend will go inside a...

Burger KingEvery day, more than 11 million guests visit BURGER KING® restaurants around the world. And they do ...

Game of TicTacToeAlice and Bob is a playing a game of tictactoe, to be precise a variant of tictactoe called Nota...

Make It Big!You are given a number N (10 ≤ N ≤ 2×109). You have to perform exactly two swap operation. You can c...

Messy TableAkib is a very good student but his reading table is very messy. One Friday afternoon, Akib is sitti...

Fivefold RemovalsAlice and Bob are playing a simple game on marbles. They have a bucket containing N marbles, and the...

LIDSWe all know about LIS ( Longest Increasing Sub sequence). The task to find the length of the longest...

Polygon Construction (Hard)Meera in going to picnic with her friends. They are going to have lots of fun. They will be doing va...

Penguins of MadagaskarYou all heard about the Penguins of Madagaskar. They work for the penguin kind and loves cuteness. O...

Third DimensionMr. J wants to learn about combinatorics. He started reading a book on combinatorics and came across...

mBeautiful NumbersAn mBeautiful Number is a number which is divisible by m and the sum of the digits is also divisibl...

No GCDYou are given N integers. Each integer is square free (i.e. it has no divisor which is a square numb...

A Girl Has No Name“Joffrey… Cersei… Ilyn Payne… the Houn..”  Arya Stark Garden of Bones, Game of Thrones S02E04 Arya ...

OCD Returns!This problem author has OCD (obsessive–compulsive disorder). One day his teacher gave him an array o...

Easy Sequence 1Let’s define an easy sequence F. Where F(1) = 1 F(2X) = F(X)^2 + 1 F(2X+1) = F(X) \times F(X+1) + 2 ...

Easy Sequence 2Let’s define a easy sequence F. Where F(1) = 1 F(2X) = F(X)^2 + 1 F(2X+1) = F(X) \times F(X+1) + 2 H...

The Game of RocksAlice and Bob have come up with a new game. Bob gives Alice a NxM grid that contains N rows and M co...

Gaaner KoliThe protagonists of this problem are two great programmers of a certain institution Omanush and Ordi...

The Perfect CollectionGiven an array A of N integers, if we choose any K of these integers and calculate their bitwise XOR...

Sticking PinsYou are sticking pins on a 2D board at N given coordinates. However, since you are not very good at ...
