OJ Board

I think this is one of the problems most (if not all) coders should avoid to even try during a running contest. It's either you know it, or you don't (that's where Google comes into picture). Of course, we need to see if we can understand and solve it offline. I even found a PDF containing the a clo...

Can someone please confirm if my statement below is correct: If we have 2 LIS sequence with different starting indices, then we should pick the one with greater starting index. And then starting from there, we look for the next greatest index which can give us (LIS-1) ... and so on ... Thanks, -turu...

Ok, this line shall replace your cin >> n;

gets(chs); n = atoi(chs);

And don't forget to include stdlib.h

-turuthok-

Yes.

-turuthok-

The problem is when you read the first line (n) ... using cin >> n, I guess it won't advance to the next line or something like that ... causing problems on the next cases ... try to use gets(), followed by atoi() to obtain n ... you should get AC after that.

-turuthok-

This is definitely just for intermezzo and not important at all ... sorry if it's wasting your time ...

The name on the problem title definitely rhymes with a rich person's name ... even in one of the paragraphs there is a line saying "... Fill Gates ... "

-turuthok-

Larry, sorry about my typo ... mine failed 20 0 will all zeroes ...

-turuthok-

Larry, what if 20 and 39 ... with all zeroes instead of all ones.

I know I failed this one but passed the all ones (I think).

-turuthok-

I have it.

Looks very similar to Cellular Automata ... never got a chance to finish it, though ...

-turuthok-

Looks like it's also called "tangential quadrilateral", ... http://www.mathworld.com has some interesting properties (and formula) about it.

-turuthok-

Dominik, I got the same result as yours ... (and the same WA, I guess).

-turuthok-

But gosh ... 10^14 ... that's fourteen zeroes ... huge huge input.

-turuthok-

I second that ... I'm using a sorting method as well. But I guess there's probably more than one way to solve this problem. It all depends on your approach ...

-turuthok-

Yep, int is 32-bits signed integer since 64-bit compilers were here years ago ... I noticed that the univ I graduated from still uses old compilers like 16-bits BC ... Even their Intel-Assembly language programming is still stuck with 16-bits programming when the processor has evolved a great deal a...

In your solve() function, don't you think you need to also put +1 in the else part of if (n < PROB_MAX) ???

-turuthok-