spoj

SPOJ 2906. GCD2 with F#

Problem Definition Frank explained its friend Felman the algorithm of Euclides to calculate the GCD of two numbers. Then Felman implements it algorithm int gcd(int a, int b) { if (b==0) return

SPOJ 42. Adding Reversed Numbers (ADDREV) with F#

Problem Definition The Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM has decided to transfigure some tragedies into comedies.