Search found 43 matches

by hujialie
Mon Nov 22, 2004 8:40 am
Forum: Volume 107 (10700-10799)
Topic: 10778 - Mathemagicland
Replies: 28
Views: 11932

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.", oth...
by hujialie
Sat Jul 17, 2004 12:18 pm
Forum: Volume 105 (10500-10599)
Topic: 10511 - Councilling
Replies: 26
Views: 11685

Help needed

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, cont...
by hujialie
Fri May 07, 2004 7:17 am
Forum: Volume 106 (10600-10699)
Topic: 10638 - The Trip II
Replies: 12
Views: 3699

Thank you for your reply!

Accepted after all :D
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.
by hujialie
Thu May 06, 2004 4:53 pm
Forum: Volume 106 (10600-10699)
Topic: 10638 - The Trip II
Replies: 12
Views: 3699

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 correc...
by hujialie
Sat Mar 20, 2004 4:22 am
Forum: Volume 106 (10600-10699)
Topic: 10607 - Siege
Replies: 21
Views: 6596

Thank you very much for your help, accepted now.
by hujialie
Sat Jan 31, 2004 5:29 pm
Forum: Volume 106 (10600-10699)
Topic: 10610 - Gopher and Hawks
Replies: 29
Views: 12784

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 as problem...
by hujialie
Mon Jan 26, 2004 11:08 am
Forum: Volume 106 (10600-10699)
Topic: 10607 - Siege
Replies: 21
Views: 6596

still WA

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[4...
by hujialie
Thu Jan 22, 2004 6:10 pm
Forum: Volume 106 (10600-10699)
Topic: 10607 - Siege
Replies: 21
Views: 6596

10607 - Siege

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 sente...
by hujialie
Mon Jan 19, 2004 3:37 pm
Forum: Volume 102 (10200-10299)
Topic: 10280 - Old Wine Into New Bottles
Replies: 15
Views: 6393

10280---Old Wine into New Bottles TLE

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

Thanks in advance.
by hujialie
Mon Jan 12, 2004 8:39 am
Forum: Volume 105 (10500-10599)
Topic: 10589 - Area
Replies: 48
Views: 18162

Ask again:

Is the problem OK now?
Have the wrong data been fixed
and previous solutions rejudged?
Can we start submitting now?
by hujialie
Sun Dec 28, 2003 4:45 am
Forum: Volume 105 (10500-10599)
Topic: 10599 - Robots(II)
Replies: 27
Views: 10100

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.
by hujialie
Sat Nov 22, 2003 4:32 pm
Forum: Volume 100 (10000-10099)
Topic: 10007 - Count the Trees
Replies: 39
Views: 6572

10007 WA after rejudged.

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?
by hujialie
Sat Nov 08, 2003 5:38 pm
Forum: Volume 100 (10000-10099)
Topic: 10001 - Garden of Eden
Replies: 39
Views: 14932

Can anybody give a help?
I still got stuck with this problem. :(
by hujialie
Wed Oct 29, 2003 3:28 pm
Forum: Algorithms
Topic: Dynamic Programming Problems
Replies: 8
Views: 12274

Thank you all for your reply.
I will try to solve them. :P
by hujialie
Tue Oct 14, 2003 4:37 pm
Forum: Algorithms
Topic: Dynamic Programming Problems
Replies: 8
Views: 12274

Dynamic Programming Problems

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

Go to advanced search