LIDS

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

Burger King

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

Train Hijack

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

A Journey Towards One

Given N. You can perform 3 types of operations: Increase N by 1. Decrease N by 1. Divide N by 2 (O...

Ekupai

Hacker robot Ekupai is trying to hack a supercomputer. He needs a cheat code X to hack this computer...

Third Dimension

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

Counting Murgis

Ever since that wicked thief took away some of her murgis (hens, that is), Meena was ever anxious th...

I Hate Combinatorics!

Rick and Morty are being hunted by the galactic government. They ran away to the cell dimension. The...

Pathetic Interview II

You all know about the story of Pathetic Interview-I. Today, I am sharing a story of my close friend...

Convert String Into Palindrome

A palindrome is a word, number, phrase, or other sequence of characters which reads the same backwar...

Is This a Give-Away?

Once there lived an ancient mage named Farabi. He could always give perfect weather forecast. He nev...

Easy

This problem is very easy. As my mood is not so good, I will not elaborate the statement unnecessari...

Naming Convention

Tony works in a multinational technology company named Voogle LLC. The employees of Voogle follow ce...

Polygon Construction (Hard)

Meera in going to picnic with her friends. They are going to have lots of fun. They will be doing va...

No GCD

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

OCD Returns!

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

Easy Sequence 1

Let’s define an easy sequence F. Where $ F(1) = 1 $ $ F(2X) = F(X)^2 + 1 $ $ F(2X+1) = F(X) \time...

Easy Sequence 2

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

The Game of Rocks

Alice and Bob have come up with a new game. Bob gives Alice a NxM grid that contains N rows and M c...

Gaaner Koli

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

The Perfect Collection

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

Sticking Pins

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

Smart Feature Phone 2

Alice worked in CIA. Right now he need to send an encrypted message to the headquarter(HQ) of CIA....

Perseus and The New Challenge

The life of princess Andromeda, the daughter of King Cepheus and Queen Cassiopeia of Ados, is in dan...

Dominoes Forever

Once when I was little, my father took me to a tobacco shop! It is surprising, but true. He asked th...

Harry Potter and the Vault of Gringotts

“There was a break-in of Gringotts Wizarding Bank on 1 May, 1998, during the height of the Second Wi...

Alice in Candyland

Alice came up with a new game. In this game called “Candy Quest”, there is a NxN size 2D grid. In ea...

Subarray Sum

You are given an array having N integers. You have to select at most K positions in the array and re...

Maximum Sum

Little Jimmy loves to play with numbers. One day he was playing with a number sequence. In his game,...

Very Dirty String

Strings are difficult, most of the contest programmers say this and try to avoid string algorithms. ...

Orchid Division

Quido has a square orchard full of various fruit and nut trees. The trees are planted in regular row...

Game of Tic-Tac-Toe

Alice and Bob is a playing a game of tic-tac-toe, to be precise a variant of tic-tac-toe called Nota...