10288 - Coupons

All about problems in Volume 102. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

Post Reply
oker
New poster
Posts: 16
Joined: Tue Apr 09, 2002 1:23 pm

10288 - Coupons

Post by oker »

I have no idea what formular to use to solve this math problem. Please give me a hint. Thank you!

Rivaldo
New poster
Posts: 19
Joined: Sun Jul 07, 2002 3:59 pm

Post by Rivaldo »

DP is OK.
Consider that F is the result when n = i, F[i + 1] = F * (i + 1) / i + 1.

abishek
Experienced poster
Posts: 131
Joined: Mon Dec 15, 2003 5:41 am

i would like to know the question.

Post by abishek »

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

Sedefcho
A great helper
Posts: 374
Joined: Sun Jan 16, 2005 10:18 pm
Location: Bulgaria

Post by Sedefcho »

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.
Last edited by Sedefcho on Fri May 06, 2005 2:15 am, edited 1 time in total.

Antonio Ocampo
Experienced poster
Posts: 131
Joined: Sat Jul 17, 2004 4:09 am
Location: Lima, Per

Post by Antonio Ocampo »

Hi for all

Could someone confirm this I/O ??

Input

Code: Select all

1
2
9
19
26
33
Output

Code: Select all

1
3
   129
25 ---
   280
   1662439
67 -------
   4084080
    73762267
100 ---------
    343219800
    7072262918053
134 -------------
    8759774348325


Sedefcho
A great helper
Posts: 374
Joined: Sun Jan 16, 2005 10:18 pm
Location: Bulgaria

Post by Sedefcho »

My ACC program gives
the following output:

Code: Select all

1
3
   129
25 ---
   280
   1662439
67 -------
   4084080
    73762267
100 ---------
    343219800
    4071048809039
134 -------------
    4375865239200
Seems you have some problem with
the last test case.

Antonio Ocampo
Experienced poster
Posts: 131
Joined: Sat Jul 17, 2004 4:09 am
Location: Lima, Per

Post by Antonio Ocampo »

Thx a lot Sedefcho!!! :D I finally got AC. It was a silly mistake in my program :oops:

Keep posting

Jan
Guru
Posts: 1334
Joined: Wed Jun 22, 2005 10:58 pm
Location: Dhaka, Bangladesh
Contact:

Post by Jan »

Can anyone describe the problem. Thanks in advance.
Ami ekhono shopno dekhi...
HomePage

A1
Experienced poster
Posts: 173
Joined: Wed Jan 28, 2004 3:34 pm
Location: Bangladesh

Post by A1 »

If i understand the question(! :evil: )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)
"

Post Reply

Return to “Volume 102 (10200-10299)”