OJ Board

Ignore it and ignore the 3rd letter when sorting.

Input:
abcde abddef aabaab aaaaaa #
Output:
Set #1:
aaaaa 2
abdde 2

If you want to learn Java there's a very good book, and it's free.

Visit the site http://www.BruceEckel.com and download it.
The book is Thinking in Java.

I'm sure that this is infinitely slower than the pointer approach.
I wrote it only as an alternative to pointers but I don't say that it's a better approach, only a diferent one.
I use pointers too.

There is another way.

[c]

typedef struct {
int data[ 400 ];
}Array;

Array returnArray() {

Array a;
return a;

}

[/c]

This also return a array of 400 int but you have to use a struct.

to Adrian K

Finally I understand this problem.
You have to find de maximun of the minimun paths from one position with a '1' to one position with a '3'.

There is no especial cases.
There is no input problems, I use a array of size 30 to store each word in the input.

There is a statement in the problem that may be confuse.

"The lines are ordered in ascending (ASCII) order of the words. The 'ignored' (i.e. the 3rd) letter in the word should show the ...

I think that there are errors with this problem.
For example, for the sample input I think that the sample output should be
0.827651 and not 0.827648 as stated in the problem.

This is my solution , I think it's correct but I'm getting wrong awnser.

-- code removed ---

I was doing a silly mistake ...

I was wrong.

I found a free book on algorithms.
I still don

I found my mistake, got it accepted.

Can you tell-me if this output is correct ?

INPUT

0 3000
2 3000
3000 2
100 200
200 100
1000 3000
2 1000
1000 2
15 15
14 16
16 14
2 15

OUTPUT

Input1: 0 3000
Output1: 924 168 102 36 46 18 30 27 22 9 13 5 6 12 19 11 3 4 7 8 15
Input2: 2 3000
Output2: 924 168 102 36 46 18 30 27 22 9 13 5 6 12 19 11 ...

http://www.cse.iitk.ac.in/primality.pdf

This is a polynomial time algorithm to test if a number is prime.

Good work.

Thank you very much.
Now I understand this problem.

Maybe I don't understood what is a valid board of bones
for a given board of pips but I think that for any board
of pips, including the ones in the sample output, there are
a lot of boards of bones.

For example, for the for the first board in the sample input,

5 4 3 6 5 3 4 6
0 6 0 1 2 3 1 1
3 2 ...