OJ Board

Don't give up, it is possible to solve this problem in Java!
This is what I do (n - number given (<=10), slen - length of the string):
- read string into an array (O(n))
- sort pointers to substrings (O(n*slen*log(slen)) <- bad?
- go through list of pointers and find the longest repeating sequence ...

I aways try to optimize my code, but in some problems it is just not enough... :( some examples are problems number 498 (Polly the polynomial) and 583 (Prime Factors)
[java][/java]

I tryed using all the tricks in this post to solve 498, and got AC after 1.2sec.
So you should have a fair chance ...

I code only java, shure it is a pain in the ... sometimes.
but in real competitions it is a good choice.

Java is not that much slower on input and output, but you must take care!!

1. using System.out.print*() will make the stream flush, which takes time, by using System.out.write() you can save ...

I code only java, shure it is a pain in the ... sometimes.
but in real competitions it is a good choice.

Java is not that much slower on input and output, but you must take care!!

1. using System.out.print*() will make the stream flush, which takes time, by using System.out.write() you can save ...

Hi

I really like the new Author Statistics at least the Expanded version.
My big disadvantage is that I am a big Java fan and java suport is not the best part of the online-judge :-(
And also java seems to be slightly slower in general, so I like to compare my solution to other java submissions ...

So what did this mean?
Does every program with multiple answes need a special judge?

Will such a judge come or must we guess how the solution output is generated.

I am quite tiered of getting WA now.