Problems

Eat Banana For Good Health

Minion Chef has a craving for bananas. She has a collection of N piles of bananas in front of her. Each pile i (1 ≤ i ≤ N) contains Ai bananas.Chef's mother, concerned about her health, wants her to finish eating all the bananas. She is currently out of the house and will return in H hours. Chef wants....Read More

Solve
Success: 40.00% | Time: 1s | Memory: 512MB
Mark Range

Asad studies B.Sc. in CSE program at BUBT. Today their programming teacher returns their mid term examination scripts. There are varieties types of numbers that students got in the examination. The teacher wants to find the mark range of numbers (Maximum and Minimum) that students got in the examination. Bu....Read More

Solve
Success: 50.00% | Time: 1s | Memory: 512MB
Selecting Guard (I)

BUBT is a famous university. It’s CSE department is very advanced and they produce good programmers nowadays. They arrange a programming contest every semester. But this time the programmers don’t want to participate in the contest by risking their lives. That’s why Dipu sir set some students to gu....Read More

Solve
Success: 17.65% | Time: 1s | Memory: 512MB
Minimum time to make Pizzas.

Mr. Griffin, the proprietor of a thriving pizza shop in Bangladesh, has enlisted the services of several skilled workers. He's assembled a team of N dedicated workers, each possessing their own unique pizza-making speed denoted by "Ai" the time it takes for them to complete a pizza.As Mr. Griffin's ....Read More

Solve
Success: 50.00% | Time: 1s | Memory: 32MB
Lucky Tickets!

One day, Jack was going home by tram. When he got his ticket, he noticed that number on the ticket was not lucky. A lucky ticket is a six-digit number on the ticket in which sum of the first three digits is equal to the sum of the last three digits. For example, number 165912 is lucky beca....Read More

Solve
Success: 50.00% | Time: 1s | Memory: 512MB
Find The Path

Problem setter: Raihat Zaman Neloy, ACM ICPC World Finalist, 2016-17Jahangirnagar University (JU) You are given a positive integer N. You can perform any of the following operations in each step: 1. If it is divisible by 2 then, divide it by 2. 2. If it is divisible by 3 then, divide it by 3. 3. Subtract 1 from that number. Now you have to calculate the minimum num....Read More

Solve
Success: 5.56% | Time: 2s | Memory: 1024MB
Brick Game

Rayhan & Imran are best friends and love to play games. Today they decided to play brick games. The game is very simple. They need to move all the bricks from spot A to spot C under few conditions- ·         Always pick a brick from top and move it ....Read More

Solve
Success: 33.33% | Time: 1s | Memory: 512MB
Century!

Hey! Do you know?What century are we now? The answer is the 21st century!Do you know how to calculate it? If you don’t, then that’s not a problem at all! Okay, let’s explain it. The 1st century was 1-100 years.The 2nd century was 101-200 years.The 21st century is 2001-2100 years and so on. Your task ....Read More

Solve
Success: 25.00% | Time: 1s | Memory: 512MB
Little Hackers

Little hackers Andrew and Beth are trying to find some secret information in a long log of the chat conversation of their friend Chris. They know that the secret part of the conversation is related to the message to his friend Dan they intercepted before. But the log is too long to search by hand. Th....Read More

Solve
Success: 40.00% | Time: 1s | Memory: 512MB
Rectangle Counting

In the initial version or v1.0.0, you are given an N*M grid. Then count the number of rectangles in this grid by using the simple equation . In the next version v1.1.0, you are given N points then calculate how many rectangles are formed by....Read More

Solve
Success: 50.00% | Time: 1s | Memory: 512MB