There is an equation ax + by + c = 0. Given a,b,c,x1,x2,y1,y2 you must determine, how many integer roots of this equation are satisfy to the following condition...

For given number N you must output amount of N-digit numbers, such, that last digits of their square is equal to 987654321.

First year of new millenium is gone away. In commemoration of it write a program that finds the name of the day of the week for any date in 2001.

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

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

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.

x is guaranteed to be a non-negative integer.

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.