Category: technical

The problem is from codeforces: http://www.codeforces.com/problemset/problem/26/A The input range is small which means even the worst brute-force methods can pass the test. The straightforward implementation is . Defining a …

One of the most selected algorithms in the last century is binary search. It is a general search method which is simple and efficient. It can be used to …

A prime number is a positive natural number that is greater than 1 and no other divisors other than 1 and itself. For example, 2, 3, 5 are primes …

This article will describe a quick and easy implementation of a algorithm that divides two integers with a high precision. Normally, an array is required to hold the results …

GCD (Greatest Common Divisor), in mathematics, is refered to the largest number that divides two or more non-zero integers without a remainder. For example, the GCD of 8 and …