Help Chokro

Pias and Chokro are good friends. Pias's birthday is coming soon. So, Chokro wants to gift Pias an a...

Subarray Sum

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

Cutting Bamboos

There are nnn bamboos in a row. Khan the bamboo cutter is going to cut them all one by one. He can d...

Alternative Subsequence: The Extension

Recall that the sequence b is a subsequence of the sequence a, if b can be derived from a by removin...

Happy Sub-Sequence

Recently Alex has participated in a programming contest. He became 1st runner up. He couldn't solve ...

T5 Racing

It is high time for the annual T5 racing and your team is planning to win the race. In T5 racing the...

Unique Relief

Thanos has now figured out how to visit all the houses in the flood-affected area. However, now he h...

Is It Perfect

Bob has an initial array D of length n . Alice is a good friend of Bob. So Bob challenges Alice to f...

Alice in Candyland

Alice came up with a new game. In this game called "Candy Quest", there is a NxN size 2D g...

The Perfect Collection

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

LIDS

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

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 Seco...

Gaaner Koli

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

Very Dirty String

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

OCD Returns!

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

Maximum Sum

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

Sticking Pins

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

Third Dimension

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

Orchid Division

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

Easy Sequence 1

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

Smart Feature Phone 2

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

Counting Murgis

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

Happiness

If you have a Tk 100 in your wallet, what would you do? You might have couple of ways to spend that ...

Paying Bills

Mued is finally home for summer vacation after surviving yet another semester of the mighty CS Under...

Easy Sequence 2

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

Toph uses cookies. By continuing you agree to our Cookie Policy.