My Weblog

Blog about programming and math

SPOJ Uncle Jack

Uncle Jack problem is related to combinatorics . Lets say we have N CDs and K nephew . Now each CD can be assigned to one of the K nephew so first CD can be assigned in K way , second in a K way ,…… Nth is also in K way . Total number of ways in K^N .

import Data.List

solve :: [Integer] -> String 
solve ( a : b: _ ) = show $ a^b

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

May 17, 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: