String Is Not That Easy

Let’s consider a string S which is obtained by concatenating the non-negative integers from 0 to 102...

Remember-Remainder

Zarin is a sadist. She loves to give problems to her close people. Today she gives you an array cons...

Passwords

Alice wants to extract some passwords from a random string. A password can have any number of charac...

Problem Setter Crisis

Competitive Programming is very popular in Leading University. There are many great achievements of ...

Buildings

There are n buildings in a row. The height of the i’th building is hi. You have ৳k. It is the amoun...

Flow on Tree

Mr. Kaboom has recently learned about maximum flow. Now his friend Mr. Taboom gave him this problem....

Flyover in Twinland

Rio has become the president of Twinland. Now he wants to develop his country to fulfill his promise...

Darth Vader and 3PO on a Tree!

Did you watch Star Wars yet? No? You should in your free time. Now back to Darth Vader and 3PO. Dar...

Diagonal Sum

Given an N*N size matrix, you have to re-arrange the elements of the matrix in such a way that the d...

Road Minister Techboy

Techboy is appointed as the minister of roads and highway in his country Better-Not-Name-It. Now he ...

Game of Strings

Redoan is very fond of strings. He wants to go on a spree of solving string problems. His own teamma...

Hardest Problem Ever

Prof.Dr.DP is very famous professor. He is expert (actually legendary grandmaster) in Dynamic Progra...

Déjà Vu

Thor, the Thunder God is fighting a horde of monsters in a cave. The cave is so narrow that it c...

Fantastic Food

As we all know that Alice and Bob just landed in Fantastic World and are going to stay for the next ...

Train Hijack

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

Permutations and Divisors

Let P be a permutation of length n where each value from 1 to n occurs exactly once. A subsequence o...

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