OJ Board

I must have read the problem statement at least 20 times, but it never occured to me that you were allowed to leave out some cubes from the arrangement. So either I am a bit stupid or the problem statement is a bit unclear. Looking again at the pictures, with this knowledge, it appears that the ...

I don't get it. From the description The difference between sum of all values in the left subtree and sum of all values in the right subtree is minimum.
In your case 4, your answer is 1(-1(-1,1)): sum of left subtree = -1, sum of right subtree = 0, so difference = -1 - 0 = -1.
But for this BST: -1 ...

ferrizzi: Yes, a piece can be disconnected. There's no restriction that says otherwise.

Yes, and water can be dry and a square can be round.
C'mon, that's stupid. There's no such thing as a 'disconnected piece'.

Lol. I laughed at myself when I read this. Come to think about it, yes, what I said ...

ferrizzi: Yes, a piece can be disconnected. There's no restriction that says otherwise.

Could anyone explain why the answer for the last case in the sample I/O is 31? I fail to construct more than one arrangements.

TIA.

Does anybody know how to solve this within 16 MB? I'm using a trie, but it uses so much memory, so it exceeds the memory limit (although the actual memory limit used in waterloo is 64MB ). Thanks.

Thx misof. But I was more in the line whether the chief contest director monitor the regional contests, rather than appealing the results. Does he believe whatever the regional director reports or does he crosscheck the result to find anything peculiar? Or does he need to be pointed to a problem ...

Hi all,

I participated in Manila and some of my friends participated in Coimbatore ICPC regional. Some (if not all) participants of both regionals suffered from the following things:

1. Poorly written problem set.
2. Lack of experience from the organizers.
3. Strange judging and mysterious ...

little joey wrote:p[95000] has the same address as li[0], so if you set p[95000] to 1, li[0] will be 1 too. Nothing to do with gcc, everything with writing outside the range of an array...

Ah I see..
Thx!

Hi,

I wrote the following code, which basically tries to enlist all primes within a certain range.

[c]
#include <string.h>
#include <math.h>

int p[35000];
int li[5000];
int c;

void precalc()
{
int i, j;

memset(&p, 0, sizeof(p));
memset(&li, 0, sizeof(li));
c = 0;
p[1] = 1; p[2] = 0;
for ...

Hi,

I wrote the following code, which basically tries to enlist all primes within a certain range.

[c]
#include <string.h>
#include <math.h>

int p[35000];
int li[5000];
int c;

void precalc()
{
int i, j;

memset(&p, 0, sizeof(p));
memset(&li, 0, sizeof(li));
c = 0;
p[1] = 1; p[2] = 0;
for ...

http://acm.uva.es/cgi-bin/OnlineJudge?P ... 25:25:1.00

rank 38th.

Is this a bug?

Try to think bitwise. (that is, convert m to base 2 and then play with it). Try finding the link between the binary represenatation of m and the number of disks in each peg.

Best wishes and Merry Christmas to those celebrating.

Ilham

Hi,

I'm wondering is there any algorithm faster than O(N^3) to solve 108??
I've heard rumours that O(N^2) exists, but I can't confirm it.

Cheers,

Ilham

Can anybody tell me how to properly format integers? I get a lot of PEs and sometimes WAs because my code obviously does something wrong.
I don't use gpp on linux, as advised, but always put the ':1' formatter after a number.

In problem 231 I get PE when outputting with:
[pascal] writeln('Test ...