Cash Change You have an unlimited number of cash notes of the following denominations: 1, 5, 10, 50, 100, 500. G... |
Subset AND You are given an array A of n integers and an integer k. You need to find if there is any non-empty ... |
Milad's Lost Tree Milad likes trees so much. He has a rooted tree with $n$ vertices each of which has some non-negativ... |
Passwords Alice wants to extract some passwords from a random string. A password can have any number of charac... |
Game of Palindromes In a popular computer game, Game of Palindromes also known as GOP there is a city called Palindesh. ... |
Disturbing Students N students were gathered in front of CSEmpur gate. They wanted to take a tour of the famous CSEmpur ... |
Burger King Every day, more than 11 million guests visit BURGER KING® restaurants around the world. And they do ... |
Maximum Sum Little Jimmy loves to play with numbers. One day he was playing with a number sequence. In his game,... |
Angels and Demons You are walking at midnight along a road that has N checkpoints numbered from 1 to N from left to ri... |
Buildings There are n buildings in a row. The height of the i-th building is hi. You have ৳k. It is the amoun... |
Penguins of Madagascar One day the penguins of Madagascar found a string S... Wait... Wait. Actually the setter of the prob... |
Gaaner Koli The protagonists of this problem are two great programmers of a certain institution Omanush and Ordi... |
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... |
OCD Returns! This problem author has OCD (obsessive–compulsive disorder). One day his teacher gave him an array o... |
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 ... |
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. ... |
Orchid Division Quido has a square orchard full of various fruit and nut trees. The trees are planted in regular row... |
Third Dimension Mr. J wants to learn about combinatorics. He started reading a book on combinatorics and came across... |
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... |
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... |