10288  Coupons
Moderator: Board moderators
10288  Coupons
I have no idea what formular to use to solve this math problem. Please give me a hint. Thank you!
i would like to know the question.
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
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.
Last edited by Sedefcho on Fri May 06, 2005 2:15 am, edited 1 time in total.

 Experienced poster
 Posts: 131
 Joined: Sat Jul 17, 2004 4:09 am
 Location: Lima, Per
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
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 
4375865239200
the last test case.

 Experienced poster
 Posts: 131
 Joined: Sat Jul 17, 2004 4:09 am
 Location: Lima, Per
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)
"
"
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)
"