Online MIPT programming contest | РУССКИЙ |
<PREV Problem: | NEXT> |
< |
---|
Time limit: 2 seconds
Pete has coins of any positive integer value in unrestricted quantity. He wants to buy his girl a cake that costs n roubles. Find the number of different ways he can pay for the cake.
Input consists of an integer n < 100.
Output the number of different ways p(n).
INPUT #11 |
OTPUT #11 |
INPUT #22 |
OTPUT #22 |
INPUT #37 |
OTPUT #315 |
Autors:
Voroztsov Artem
© acm.mipt DevGroup The page was generated in 210ms |