OJ Board

mf wrote:

For unsigned long long it's "%I64u" in Windows

That depends on your compiler. I use cygwin and it's %llu for me
Visual Studio 2005 also supports %llu.

if i am not mistaken Dev-C++ uses MinGW compiler, and there long long is printed differently than "%lld"

Then connections of Commercial-Xpress are special edges, first endpoint is node of first group, and second endpoint is node of second group. These edges are bi-directional too. i do not think so that you should make special edges bidirectional. just make them directed from the first set to the seco...

jah wrote:Could you post some test case, I don't know what's wrong with my code.

are you sure you are finding lexicographically smallest solution?

S.M.ferdous wrote:for 12300 my output is:

32100 - 123 = 31977 = 9 * 3553

is it wrong?

yes, it is.
all digits must occur in both a and b

this might help you:

http://en.wikipedia.org/wiki/Knapsack_problem
http://en.wikipedia.org/wiki/Subset_sum_problem

also it would be great to have virtual contest system

shanto86 wrote:well there is a problem with the union of rectangle procedure. note that some rectangle may get out of board. and in that case what to do? coz then only making union does not work!

that is my problem as well

hello,

can anyone please post some hints for the first part of the problem?
if one knows how to solve the first part, second is more or less trivial

Filip

can someone please give a hint or an idea for this problem?

my idea was to rotate the plane for 45 degrees but it didn't handle the boundary constraint ( it counted fields outside the chessboard as well )

Filip

can someone please give a hint on this problem?

Thank you

can you share those tricks?

well, i still cant get it accepted so if anybody can check out my code:

There is a solution with O(n) too. For the previous posted test, my code outputs 21341254742 6326026258 93611494 92130101 can you please tell me what do you get before you round your solutions i get: 21341254742.435440063476562 6326026258.263971328735352 93611493.600922271609306 92130100.9769803583...

can somebody please tell me outputs for following test cases and if it is not a problem, can one tell me his result BEFORE rounding too, i suspect i am having precision issue http://fpavetic.googlepages.com/11186.big1 http://fpavetic.googlepages.com/11186.big2 http://fpavetic.googlepages.com/11186.b...

Well..I tried that problem during the contest..I guessed there was a solution when (n-4)%3 == 0, you can make the sample for 4, 7, 11 and you will find that the solution follows a pattern. Though I didn't get AC :p, so, perhaps I was missing something else? well, i don't think that is quite correct...