Divide the Array into Group of Integers with Size using GCD Algorithm
X of a Kind in a Deck of Cards In a deck of cards, each card has an integer written on it. Return true if and only if you …
Tag: gcd
GCD, Greatest Common Divisor
December 17, 2012
algorithms, beginner, implementation, math, programming languages, recursive
No Comments
In , the GCD (Greatest Common Divisor) is given in brief details. The algorithm can be implemented in both recursive and iterative forms. The recursive formula is , and …
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: B. Limit
The problem is from codeforces: http://codeforces.com/problemset/problem/197/B It has been a while since last time I submitted Python solutions to codeforces. This time, I pick a math problem that can …