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)×F(X+1)+2 Here X is a posit...
Make It Big!
You are given a number N (10 ≤ N ≤ 2×109). You have to perform exactly two swap operation. You can c...
The Perfect Collection
Given an array A of N integers, if we choose any K of these integers and calculate their bitwise XOR...
Maximize Sum
You are given two integer arrays A and B of length n and m respectively. You can do the following op...
LIDS
We all know about LIS (Longest Increasing Sub sequence). The task to find the length of the longest ...
Knapsack
You have a backpack that can carry a maximum weight of C. You will also be given a set of items, the...
DP Very Easy 73/91/225
Video Game
Shefin is playing a game. In this game there are N buildings numbered from 1 to N. Each building has...
Do You Know Tree ?
"Stay at least one metre distance from others.” Corona has affected the World as well as Bangladesh....
Help Chokro
Pias and Chokro are good friends. Pias's birthday is coming soon. So, Chokro wants to gift Pias an a...
Holy Tree
What is a tree? A tree is a bidirectional connected graph with no cycle. In a tree, we can create ...
Hasinur's Mission!
Let me tell you something about Hasinur: He is a religious person. He prays 5 times a day. He loves...
No GCD
You are given N integers. Each integer is square free (i.e. it has no divisor which is a square numb...
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...
Gaaner Koli
The protagonists of this problem are two great programmers of a certain institution Omanush and Ordi...
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...
OCD Returns!
This problem author has OCD (obsessive–compulsive disorder). One day his teacher gave him an array o...
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,...
Sticking Pins
You are sticking pins on a 2D board at N given coordinates. However, since you are not very good at ...
Very Dirty String
Strings are difficult, most of the contest programmers say this and try to avoid string algorithms. ...
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...
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 ...
Toph uses cookies. By continuing you agree to our Cookie Policy.