My Weblog

Blog about programming and math

SPOJ 2906. GCD2

SPOJ GCD2 just two lines in Haskell.

import Data.List

solve :: [Integer] -> String
solve (a:b:_) = if a == 0 then show b else if mod b a == 0 then show a else show.gcd a $ ( mod b a ) 

main = interact $ unlines . map  ( solve.map read . words ) . tail . lines 

Beware , Haskell can make you lazy to code problems in any other language :).

Advertisements

May 25, 2011 - Posted by | Programming | ,

No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: