OJ Board

To author bugzpodder:

I tried a lot of times to solve this problem, but all got WA.
i think what this problem ask us to do is this:

1.Buid up a n-polynomial equation of x ;
2.find all rational solutions from small to large, say x[1]<=x[2]<=......<=x[m];
3.if m equals zero, print "No soltution ...

Hi, I'm trying to solve this problem, but always got wrong answer.

I build a graph and run maximum flow.
If maxflow==number of club, then we can build
the solution, otherwise it's impossible.

The graph is as this:

souce--->every party, content ==(number of club -1)/2;
every man's party---->man ...

Thank you for your reply!

Accepted after all
I made such mistake, that I thought as long as one group are available,
after choosing this group, the remaining group is also available, that's
wrong since 1 cent's rounding in this problem.

Hi,I am facing difficulity while solving this problem, could anyone give
some hints?

I try to devide students into maximal number of groups such that each
group's average cost is the same as the total average cost(diff<0.01),
then the answer is n-m(m is the maximal group number), is this idea ...

Thank you very much for your help, accepted now.

Bad problem statement!!! :x

In the problem, there is

There are not more than 1000 gopher holes ...


Who knows 1000 doesn't include starting and ending ones!

After receiving wrong answer judge, I only cared about
presion errors, but fogot array size...

Get one lesson: don't open arrays just ...

I have improved my code, considered cases memtioned above,
and I think my programme can handle them, but still received
wrong answer :( , can anyone give some tests or point my error?
Thanks.
here is my code in C++:
#include "stdio.h"

int m,n,p,c[210][210],p2,neigh[101];
char map[210][210];
int cy ...

Hello.Is there any trick in this problem?
I try to solve it, but always got wrong answer.
Maybe I haven't understood the problem clearly.

In the problem, there is

the king should do one of these statements: either it is a frontier province or it is an already conquered province.

What does this ...

Hi.
I am in difficulty solving this problem, keep
receiving Time Limet Exceeded.Can anyone
give a hint?

Thanks in advance.

Ask again:

Is the problem OK now?
Have the wrong data been fixed
and previous solutions rejudged?
Can we start submitting now?

I have met the same problem, accepted codes during the
contest now got wrong answer, and I noticed that no one
has passed. Administrator, plz have a look.

I originally solved this problem by using
following recursive formula:

f(0)=0;
f(1)=1;
f(n)=sigma(f(i)*f(n-i)) 0<=i<n
and ans(n)=f(n)*n!

but after the limit of n had been changed, this method
is too slow and troublesome to code, could anyone
recommend a better one?

Can anybody give a help?
I still got stuck with this problem.

Thank you all for your reply.
I will try to solve them.

Who can recommend some good Dynamic Programming Problems
on this site?Thanks.