OJ Board

I think that the judge for this problem has a bug.

A big number of my friends submit the following code which is obviously deserve to get WA but it got AC.

code(in C++):

main(){}

code (in C) (Is this code able to avoid compile error?)

#include<stdio.h>
#include<stdlib.h>
int main()
{
freopen ...

I submitted the code which got AC in the previous system.
But I got wrong answer this time!!
How come it would happen?

Is the problem has been rejudged?

Your code fails the follow inputs:

10
2 84
84 66
66 8
8 410
410 8
8 96
96 10
10 200
200 10
10 2
10
2 64
64 8
8 55
55 333
333 44
44 887
887 554
554 1
1 226
226 33
0

Output should be:

Case 1: (((A1 x A2) x A3) x (A4 x (A5 x (A6 x (A7 x (A8 x (A9 x A10)))))))
Case 2: ((A1 x (A2 x (A3 x (A4 x (A5 ...

I know that this problem is a Maximum-Bipartite-Matching problem.
But can it be implemented by the Edmonds-Karp's algorithm?

I used Edmonds-Karp's algorithm and got a TLE a few hours ago...


Sorry for my poor English grammar.

#include <stdio.h>

struct DATA {
int weight;
int carry;
}box[1000];

int lis[1000][2];//[][0]:amount [][1]: carry

int main() {
int i,j,N,tmp,max;
while (scanf("%d",&N) && N) {
for (i=max=0; i<N; i++)
scanf("%d %d",&box[i].weight,&box[i].carry);
lis[0][1]=box[0].carry;
for (i=0; i<N; i ...

paulmcvn wrote:Sorry, you're right!

Just notice the case when there's one last number in A.

Sorry for my lack of knowledge, but would you explain what is "one last number in A"?

Thanks.

Sorry for my poor English grammar.