OJ Board

Can anybody tell me if my answer to the above test with 42 functional dependencies is correct? The output is: ------ Set number 1 FD 11 is redundant using FDs: 12 FD 19 is redundant using FDs: 34 30 17 16 5 15 14 12 FD 31 is redundant using FDs: 33 30 18 16 5 15 7 13 12 FD 38 is redundant using FDs:...

Can anybody supply some test cases for 216?
Please, if someone has AC on C or C++, i'd like to know how he/she copes with rounding errors?

Can anybody tell me what's wrong with my program? It keeps getting WA.. #include <iostream.h> struct funcdep { int left; int right; int ind; }; int n; funcdep funcd[110]; funcdep proof[110]; int np; bool checkredundancy(funcdep fd, funcdep hypo[], int nh) { int coverage = fd.left, i; np = 0; do { fo...

Well it's not OK change it to 2000 and you'll have no problem.
Also a suggestion -- this problem is tricky you should have to check the code sizes as mentioned in the statement..

Good luck.

Well, the problem is not so hard.. you've got to see all the cases.. and determine the answer in each one from elementary geometry it is known that a triangle is fully determined by: 1. three sides 2. two sides and the angle between them. 3. one side and two angles (the third is also known in this c...

I haven't got AC yet... did someone make any progress?..
there is really something wrong with the test data;
I also found that there is something like ...A:BC:D... which is incosistent with the statement
the value of k is never 0 and is not very big (shorter than 9 digits)

Could anybody tell me what was changed in the rejudgement...
i keep getting WA but before that it was AC

are there any hidden tricks, in the input for example

Thank you.

I have solved it but i get WA.
Could someone tell me some tips or tricks in this one?

Thank you.

The task is simple.
All is said in the statement; the input might be very long; for example one separate test, possibly spread in lines, can be more than one thousand characters in all. I think this is the only 'trick' here.

Good luck.

You got wrong answer, because the line that contains the message 'no arbitrage sequence exists' is split in two (somewhere at its middle) when you paste it in the yahoo. To avoid this - split the lines which contain long string constants in two shorter lines.

Good luck.

Try coding the program in C and use
float for the numbers.. if you use double you could get WA.

Good luck.