ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

Forum || Register || Login || Problem set || Users rating || Online status || FAQ || acm.mipt.ru

<PREV Problem:

Solved by 1153 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
xtender	`20 apr 2010`	Perl	18	00.10	3
V.A.KeRneL	`13 nov 2006`	Ruby	3	00.01	12
karthiekc	`22 mar 2010`	Ruby	11	00.02	47
karthiekc	`22 mar 2010`	Ruby	10	00.02	51
iezahel	`21 jul 2006`	Ruby	1	00.02	58
shyrik	`04 dec 2007`	FPC	2	00.01	63
shyrik	`04 dec 2007`	FPC	3	00.01	63
gorlum0	`16 mar 2011`	Ruby	2	00.03	63
zhuojie	`26 oct 2009`	Python	1	00.07	63
gchebanov	`21 nov 2010`	Python	1	00.11	63
0901040132	`11 apr 2013`	Lua	1	00.02	64
shyrik	`04 dec 2007`	Kylix	1	00.01	65
toshiba2	`07 nov 2006`	FPC	6	00.01	65

Languages
C++	521
FPC	310
C	215
Java	50
Kylix	50
Ruby	11
Python	7
Lua	3
Scheme	3
Perl	3

 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 <

Pete in love

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 #1 1	OTPUT #1 1
INPUT #2 2	OTPUT #2 2
INPUT #3 7	OTPUT #3 15

Autors:
Voroztsov Artem