## Search found 27 matches

Tue Sep 03, 2002 5:36 pm
Forum: Volume 103 (10300-10399)
Topic: 10352 - Count the eWords
Replies: 30
Views: 11879
Ignore it and ignore the 3rd letter when sorting.

Input:
abcde abddef aabaab aaaaaa #
Output:
Set #1:
aaaaa 2
abdde 2
Sat Aug 31, 2002 6:19 pm
Forum: Java
Topic: A very good FREE Java Book
Replies: 2
Views: 2806

### A very good FREE Java Book

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

The book is Thinking in Java.
Fri Aug 30, 2002 9:42 pm
Forum: C
Topic: array functions
Replies: 4
Views: 2558
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.
Fri Aug 30, 2002 3:46 am
Forum: C
Topic: array functions
Replies: 4
Views: 2558
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.
Thu Aug 29, 2002 5:14 pm
Forum: Volume 103 (10300-10399)
Topic: 10347 - Medians
Replies: 32
Views: 13991
Thu Aug 29, 2002 1:29 pm
Forum: Volume 101 (10100-10199)
Topic: 10102 - The path in the colored field
Replies: 34
Views: 12955
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'.
Thu Aug 29, 2002 1:18 pm
Forum: Volume 103 (10300-10399)
Topic: 10352 - Count the eWords
Replies: 30
Views: 11879
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 l...
Tue Aug 27, 2002 7:30 pm
Forum: Volume 3 (300-399)
Topic: 375 - Inscribed Circles and Isosceles Triangles
Replies: 19
Views: 2621

### Problem 375 - What's the problem?

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, no...
Mon Aug 26, 2002 9:39 pm
Forum: Volume 101 (10100-10199)
Topic: 10102 - The path in the colored field
Replies: 34
Views: 12955
I was wrong.
Mon Aug 26, 2002 5:48 pm
Forum: Other words
Topic: Free book of Algorithms
Replies: 6
Views: 2767

### Free book of Algorithms

I found a free book on algorithms.
I still don
Thu Aug 22, 2002 9:51 pm
Forum: Volume 5 (500-599)
Topic: 547 - DDF
Replies: 9
Views: 4534
I found my mistake, got it accepted.
Thu Aug 22, 2002 9:19 pm
Forum: Volume 5 (500-599)
Topic: 547 - DDF
Replies: 9
Views: 4534

### 547 - DDF

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 3 4 ...
Wed Aug 21, 2002 2:31 pm
Forum: Other words
Topic: New primality test algorithm found.
Replies: 3
Views: 2194

### New primality test algorithm found.

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

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

Good work.
Wed Aug 07, 2002 2:07 pm
Forum: Volume 2 (200-299)
Topic: 211 - The Domino Effect
Replies: 7
Views: 3519
Thank you very much.
Now I understand this problem.
Tue Aug 06, 2002 7:25 pm
Forum: Volume 2 (200-299)
Topic: 211 - The Domino Effect
Replies: 7
Views: 3519

### 211 - The Domino Effect

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 6 5...