OJ Board

"To further simplify the problem each cell state will depend only on its previous state and that of its immediate neighbors (the one to the left and the one to the right). " the paragraph above means that each of the node/cell will change its state to a new state according to its own state...

okay I have no idea about NP-complete problems nor any algo to solve them. Can anyone share something to help me especially on this problem?

Is there any way besides backtracking? thx!!

I am also having trouble with this problem. Is the inputs and output really won't exceed 2^31? I thought that maybe the intermediate results can be larger than 2^31 or maybe even much more...so I used BigInt anyway, but got runtime error!! Can somebody post some sample input? I need to know how like...

Thanks Whinii, for your input. Now I figured that no one would be able to solve the problem 10029 with LIS, so it must be some other way (but I haven't got it yet). I have not understand hashing or I have forgotten about it, but I can't recall anything involved with hashing. If someone could spill o...

hi, I too have been working on 10029 and got TLE using standard LIS O(N^2) Have yours got accepted?? I think there might be another approach on 10029 without LIS...or is it not? junjieliang, your explaination is not quite clear could you give us some details? if a > b and b > c, then a > c. As for c...

4
4
0 1
1 2
2 3
3 0
5
5
0 1
1 2
2 3
3 4
4 0
3
3
0 1
1 2
2 0
9
8
0 1
0 2
0 3
0 4
0 5
0 6
0 7
0 8
0

output :
BICOLORABLE.
NOT BICOLORABLE.
NOT BICOLORABLE.
BICOLORABLE.

[/quote]

dear admins, I noticed that my statistics had some number of problems solved missing and its really hard to see what were missing. Is there any way one can search for the rejudged problems? I had not received any notice in my email...I've checked the http://online-judge.uva.es/problemset/rejudge.php...

read about the previous post by hujialie...
I was getting WA when i use ASCII comparison...and when I consider the alphabetic order i got AC

input
Ca
Ca

the output should

aC

There are blank characters in the input and also maybe uppercase letters, which to be sorted alphabetically

Read previous post about this

input

prettywoman
walkingdown
inging
singing

the output should be

anow
ggiinn

Thank you, Dominik!!

Now I know how to solve this problem. My solution still slow, there are many other that is better. But I believe that will be enough for this problem

thx turuthok!!

I really was making a fool out of myself.
[/url]

hi..just now i tried to compute sinus 30 with my Borland C++ 3.1 can anybody explain to me why sin(30) doesn't return 0.5, instead it returned something like -0.98.... is there a bug in C's math library or am I making a fool out of my self. I've tried using float, double, long double, <math.h>, <com...

to Dominik, maybe u assume that if a cell had been visited the knight won't have to go to that cell anymore...and u place a sign saying that the cell had been visited to prevent the knight from visiting it again(maybe to optimize the BFS) If so...that's where I think is wrong...since a dynamic knigh...

yes the output is correct.

if you draw the upside down pyramid, you'll know that the 4 triangle holes will not combine into one large triangle..so the largest would be only 1

any two triangle connected stands in opposite positions

Hi, I wonder if anyone really has an algorithm that can find all the numbers in less than 10 seconds or so....or is everyone just pre-calculate the answers first than make look-up table!! This problem really brought up my curiosity. Please tell me if you can solve it without using precalculated table.