Sign in Subscribe

SPOJ 2906. GCD2 with F#

2 min read Algorithm
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#

1 min read Algorithm
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.

Euler Problem 002 with F#

Functional Programming
Problem Statement 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued

Scala Notes: Pattern Matching

1 min read Scala
Pattern matching lets you automatically execute code based on some piece of data. Scala uses pattern matching often, such as when you parse XML or pass messages between threads. Basic syntax of pattern