Inspired by a “Little Bishops” problem, Petya now wants to solve problem for rooks.

Famous Berland ACM-ICPC team Anisovka consists of three programmers: Andrew, Michael and Ilya. A long time ago, during the first few months the team was founded...

You are given natural number X. Find such maximum integer number that it square is not greater than X.

Along the border between states A and B there are N defence outposts. For every outpost k, the interval [Ak,Bk] which is guarded by it is known. Because of fina...

Find amount of numbers for given sequence of integer numbers such that after raising them to the M-th power they will be divided by K.

You are given an n x n 2D matrix representing an image.

Given an integer, convert it to a roman numeral.

Given a roman numeral, convert it to an integer.

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may a...

Given an array of integers, return indices of the two numbers such that they add up to a specific target.