Finding Primes
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 …
O(n) High-precision Division Between Two Integers
July 2, 2012
algorithms, beginner, brute force, code, implementation, math, programming languages, python, technical, tricks
No Comments
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 and LCM
July 1, 2012
algorithms, beginner, code, code library, implementation, interview questions, math, programming languages, python, technical
No Comments
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 …
Codeforces: C. Letter
The problem is from codeforces: http://codeforces.com/problemset/problem/180/C Let n be the number of lower-cases that have encountered so far from left to right; So everytime there is an uppercase letter, …
Codeforces: A. Winner
The problem is from codeforces http://codeforces.com/problemset/problem/2/A To solve this problem, you will probably need to know the dictionary. In Python, the dictionary structure can be declared using notation {}. …
How to Display Your Email Address As Image?
The search engines are crawling the web every second. Some are good but some mis-use the information e.g. your email addresses and sell them to third party. You then …