difference
- Computer difference between 2 integersfactorial
- Computen!
for a givenn
hanoi-moves
- Number of moves it is required for a hanoi tower ofn
disksmin-change
- Given a valuev
, and coins of values $50, $10, $5 and $1, find a way to representv
using those coins in such a way that the number of coins is minimalprimes
- Given a numbern
, print "Yes" ifn
is prime, "No" otherwisesquares
- Compute square of integerssum
- Read from stdin. The first line isn
, the number of following lines. Each of the nextn
lines contain an integer. Output the sum of then
integerstop-n
-n
andm
in the first line, read the nextn
lines each containing an integer and print the topm
, one in each line