10288 - Coupons
Posted: Mon Jul 29, 2002 6:27 am
I have no idea what formular to use to solve this math problem. Please give me a hint. Thank you!
DP is OK.
Consider that F is the result when n = i, F[i + 1] = F * (i + 1) / i + 1.
Page 1 of 1
Posted: Mon Jul 29, 2002 2:21 pm
i would like to know the question.
Posted: Thu Jul 15, 2004 3:27 am
i am not able to under stand the question . could some one explain it more clearly.
i think the wording is very bad. does any body else also think that way.
bye
abi
i think the wording is very bad. does any body else also think that way.
bye
abi
Posted: Sun Apr 24, 2005 3:18 pm
Yes, Abishek,
I also think so. I don't understand the
question at all. Apparently it's something simple
but the question is posed quite badly, at least
this is my opinion.
I also think so. I don't understand the
question at all. Apparently it's something simple
but the question is posed quite badly, at least
this is my opinion.
Posted: Fri May 06, 2005 1:03 am
Hi for all
Could someone confirm this I/O ??
Input
Output
Could someone confirm this I/O ??
Input
Code: Select all
1
2
9
19
26
33
Code: Select all
1
3
129
25 ---
280
1662439
67 -------
4084080
73762267
100 ---------
343219800
7072262918053
134 -------------
8759774348325
Posted: Fri May 06, 2005 2:12 am
My ACC program gives
the following output:
Seems you have some problem with
the last test case.
the following output:
Code: Select all
1
3
129
25 ---
280
1662439
67 -------
4084080
73762267
100 ---------
343219800
4071048809039
134 -------------
4375865239200the last test case.
Posted: Fri May 06, 2005 2:42 am
Thx a lot Sedefcho!!! 
I finally got AC. It was a silly mistake in my program 
Keep posting
I finally got AC. It was a silly mistake in my program Keep posting
Posted: Tue Sep 05, 2006 8:20 pm
Can anyone describe the problem. Thanks in advance.
Posted: Wed Sep 06, 2006 4:43 am
If i understand the question(! 
)then I think the problem statement should be some thing like this:
"
You will get a coupon with every cereal box. the coupons are numbered 1 to n.
You will win a prize if you can collect a complete set of coupons, that is at least one coupon of each number(1 to n).
How many boxes on average are required to make a complete set of coupons? In other way: how many boxes are required to win a prize?
(Obviously you will collect boxes in a random order)
"
)then I think the problem statement should be some thing like this:"
You will get a coupon with every cereal box. the coupons are numbered 1 to n.
You will win a prize if you can collect a complete set of coupons, that is at least one coupon of each number(1 to n).
How many boxes on average are required to make a complete set of coupons? In other way: how many boxes are required to win a prize?
(Obviously you will collect boxes in a random order)
"