875 - Monopoly

All about problems in Volume 8. 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
New poster
Posts: 2
Joined: Thu Mar 26, 2009 5:53 pm

875 - Monopoly

Post by groovyfeng » Thu Mar 26, 2009 6:02 pm

Any idea about how to solve this problem? I cannot even figure out why the output for the given example is 8. There are 11 relations: AB>C, C>A, BC>D, ACD>B, D>E, D>G, BE>C, CG>B, CG>D, CE>A, CE>G. I can see that relation CE>A is redundant because C>A, and CE contains C. But which other 2 relations are redundant?

Thanks in advance!

New poster
Posts: 36
Joined: Tue Apr 24, 2012 6:20 pm

Re: 875 - Monopoly

Post by mathgirl » Wed May 16, 2012 1:07 pm

Can anyone who solved this problem explain the sample I/O given ? I was able to figure out that CE > A is redundant. But no clue abt the other 2.

Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

Re: 875 - Monopoly

Post by brianfry713 » Wed May 16, 2012 11:39 pm

This problem can't be judged, it has no real I/O. This code gets AC:

Code: Select all

int main(void) {return 0;}
Check input and AC output for thousands of problems on uDebug!

Experienced poster
Posts: 202
Joined: Wed Jul 04, 2007 6:53 am

Re: 875 - Monopoly

Post by baodog » Thu Jul 03, 2014 5:21 am


I have created a set for this, and hopefully it will be set soon. Here is an illustration of ACD > B is not needed, since
it can be derived from:

ACD > ACG > AB > B

Since D>G, and CG > B

Can you now find the remaining unneeded one now?

Post Reply

Return to “Volume 8 (800-899)”