OJ Board

Larry wrote:It's been half a day, so I figure I'll bring it to someone's attention...

Yesterday nigth the judge's disks were full. Now it is working for me.

Saludos,
HoraPe

C doesn't define it. You can use limits.h to check the values available on your platform.

On the judge, int goes from -2^31 to 2^31-1, unsigned int from 0 to 2^32-1, long long -2^63 to 2^63-1 and unsigned long long 0 to 2^64-1.

Saludos,
HoraPe

Desde la Argentina vaya un saludo para todo el pueblo de la madre patria. Viva Espa

The code is invalid, but the output is correct! (correct means that it behaves like it is expected to)
The reason for this is that postincrementation is made after the whole instruction it is a part of. So in case 1, variable a is incremented before printf, but in case 1 after it.

There is no ...

what mean not standard?? is that the two codes are the same?? then why it gives diff output? according to NASI, i think the ouput should be 13, but after printf() fucntion, it changes... strange~! it is bcos of printf()??

Your code is invalid C.See http://www.eskimo.com/~scs/C-faq/q3.2.html

More ...

hey there.. anyone know why this strange thing happens? c programming.
i wonder why....


int a = 9, b = 3;
a = a++ + b++;
printf("%d", a);

output: 13

but,

int a =9, b = 3;
printf("%d", a = a++ + b++);

output: 12

why.??

Your code is undefined by the standard. It can give any result, just ...

Larry wrote:What can be optimized about the Edmond-Karp? I've gotten TLE on Gopher II and it's running really slowly..

Change algorithm Lift to front is lots faster.

Saludos,

I haven got AC yet, and have some discrepances with your data. As your datasets are so big I haven't given the effort needed to check the data. If you check it, please let me know what are the results.


413.12 <- 410.59
(0,0) (-10.4,37.2) (-29.6,46.22) (-35.91,37.27)
(-40.11,13.37) (-46.58,-40.1 ...

kiha wrote:* Of course, for every n > 4 , I check if any prime i from 2 to sqrt (n) divides n , until I have found one that does or i have reached sqrt (n) -- can you think of any better algorithm ?

That's a really slow algorithm. Read on sieve.

Saludos,
HoraPe

But there is something wrong in the Archive Judge System .

People who registered after " Thu Jan 01 2004 " can't submit at all.


IDs over 1664 were not working. The last few days the archive was down for maintenance because VOJ people was working on that problem. Carlos told me it is solved ...

My question is do they intentionally shut it down or do they face problems.


A router the judge relies on had a
power problem.

Problems seem more frequent on weekends
because the time taken to solve them
is longer (if the system goes down on
a weekend, it maybe isn't noticed
until monday ...

i tried what u said. submitted and wait. nothing happened. first i went to icpc archieve link. then choose region -- then 2003 (asia/dhaka)-- then click on submit (2889) and submitted. then submit successfull come but i found that my no. of submission is still 0 :o what is my fault here. it's not ...

can you provide me outputs for this following inputs :

...

thanks :) :)

-titid-


Jury #1
Best jury has value 14 for prosecution and value 4 for defence:
1

Jury #2
Best jury has value 195 for prosecution and value 192 for defence:
1 2 3 6 7 8 10 11 12 13 14 15 16 17 18 20 21 22 23 24

Jury ...

Is finding cactus related to finding articulation points in a directed graph anyway? i think in a cactus, the simple cycles are connected to each other only through articulation vertices. i tried in this way, but still WA :cry:
Can anybody tell me the correct approach to solving this problem ...

Sounds like binary search.
So where do you get the R value? And why dont you go both directions from middle of AB?

It isn't binary search, nor something like that, as far as i understand. I test each pair of vertices, and then test it again every vertex.


The last line of the input case will be ...