The Perfect Collection

Given an array A of N integers, if we choose any K of these inte...

Easy Sequence 1

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

No GCD

You are given N integers. Each integer is square free (i.e. it h...

Subarray Sum

You are given an array having N integers. You have to select at ...

Dominoes Forever

Once when I was little, my father took me to a tobacco shop! It ...

Pathetic Interview II

You all know about the story of Pathetic Interview-I. Today, I a...

Maximum Sum

Little Jimmy loves to play with numbers. One day he was playing ...

Gaaner Koli

The protagonists of this problem are two great programmers of a ...

Burger King

Every day, more than 11 million guests visit BURGER KING® restau...

Polygon Construction (Hard)

Meera in going to picnic with her friends. They are going to hav...

Third Dimension

Mr. J wants to learn about combinatorics. He started reading a b...

OCD Returns!

This problem author has OCD (obsessive–compulsive disorder). One...

Easy Sequence 2

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

The Game of Rocks

Alice and Bob have come up with a new game. Bob gives Alice a N...

Sticking Pins

You are sticking pins on a 2D board at N given coordinates. Howe...

Smart Feature Phone 2

Alice worked in CIA. Right now he need to send an encrypted me...

Perseus and The New Challenge

The life of princess Andromeda, the daughter of King Cepheus and...

Harry Potter and the Vault of Gringotts

“There was a break-in of Gringotts Wizarding Bank on 1 May, 1998...

Alice in Candyland

Alice came up with a new game. In this game called “Candy Quest”...

LIDS

We all know about LIS ( Longest Increasing Sub sequence). The ta...

Very Dirty String

Strings are difficult, most of the contest programmers say this ...

Orchid Division

Quido has a square orchard full of various fruit and nut trees. ...

Counting Murgis

Ever since that wicked thief took away some of her murgis (hens,...