OJ Board

What algorithm is recommended?
Bellman-Ford or Floyd Warshall?

Hey... you are from Korea right?

From what I know... Korea's IT sector should be quite strong.
And from the IOI '05 website, I think Korea got a few gold medalists.

They won't give you 'A' and 'a' because all the team names are unique.

#include <stdio.h> int main(){ int dat[5000][4] = {0}; int c = 0; int pos[20010] = {0}; int i; while(scanf("%d %d %d",&dat[c][0],&dat[c][1],&dat[c][2])==3){ for (i=dat[c][0];i<=dat[c][2];i++){ if (dat[c][1]>pos[i]) pos[i] = dat[c][1]; } c++; } int last = 0; for (i=dat[0][0];i<...

I finally realise why I (and other ppl too) keep getting OLE...
input of aaaaaaaaaa
gives output of aaaaaaaaaa only.
Arg...

10921, 10929, 10931 are also easy.

I think you are correct, i.e. the biggest number is 9682415.
I generated 448 runaround numbers in total.

and this reminds me....
IOI 2005 was held in Poland
http://www.ioi2005.pl

Am I winning?

http://mathworld.wolfram.com/PascalsTriangle.html

Quite a good site to understand more....

Also.. read this: http://acm.uva.es/problemset/readmefirst.php

It seems that it may be due to the system upgrade.

NOTE: The system upgrade is almost finished. Everything should work now. Thank you.

See http://acm.uva.es/

I suggest:
http://online-judge.uva.es/board/viewto ... hlight=530
http://online-judge.uva.es/board/viewto ... hlight=530

How about Durians?

I have submitted my code through the PHP script many times..
and the judge does not receive my code sometimes.
What is happening to the OJ?