Given an integer X, you have to find the smallest number that is divisible by 3 and greater than X.....Read More

There is no statement for this problem. Just copy the code and submit it.   #include <stdio.h> int main() {             printf("Welcome to BUBT IUPC\n");             return 0; }....Read More

You are given an integer input N and you have to find whether it is Emu’s favorite or not. If it is Emu’s favorite then print “YES” else print “NO”. A number is Emu’s favorite if the summation of one or more 7 or -7 equal to N.Example: n = 14 so, 14 = 7+7       ....Read More

Mr. Samir likes to play with blocks. A block has 6 sides. Left, Right, Front, Back, Top, and Bottom. The size of a block is (1*1*1). He makes building on a (H*W) square unit area. But in every coordinate, the number of blocks can be different.Now he wants to recolor only one side of the building. Color....Read More

Emu is a student of Deptartment of CSE, BUBT. Her course teacher gave her homework. Her teacher told her to write a program that takes two integer number inputs X and Y. Then her teacher told her to apply a condition, that is, if Y is less than X print “Hello,BUBTian!” (Without Quotes) otherwise, ....Read More

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

Do you like chocolates? Maybe, or not, but my younger sister likes chocolates so much and she wants to buy more chocolates. Every day she comes to me with a list of chocolates of N types from 1 to N, where the price is given of every type of chocolates. Finally, she askes me what amount of m....Read More

Given a binary array that means each element of that array is either 0 or 1. Your task is to sort the array using minimum swaps. You are allowed to swap only adjacent elements.....Read More

Given a number N. You have to find out three integers X, Y, and Z where, 1.      X = Y – 1,2.      Z = Y + 1,  and 3.      X + Y + Z = N.....Read More

Let you have N (0 < N < 101) integers, a1, a2, a3, ..., aN. Your objective is to have N equal integers by transforming some of them.You may transform each integer at most once. Transforming an integer x into another integer y costs you (x-y)2 taka.Find the minimum total cost t....Read More