Search found 8 matches

by visser
Mon Aug 12, 2002 2:34 pm
Forum: Volume 1 (100-199)
Topic: 191 - Intersection
Replies: 103
Views: 18357

Try your program on

1
0 2 0 3 0 0 1 1

Output should be 'F'!
by visser
Wed Jul 31, 2002 1:37 pm
Forum: Volume 1 (100-199)
Topic: 193 - Graph Coloring
Replies: 93
Views: 21232

Nice heuristic, but nothing more than that...
Can you PROOF your algorithm is correct?
by visser
Wed Jul 31, 2002 1:30 pm
Forum: Volume 1 (100-199)
Topic: 125 - Numbering Paths
Replies: 56
Views: 5723

try for input:

3
2 1
0 2
1 2

output should be:

0 -1 -1
0 -1 -1
0 -1 -1

you get:

0 -1 1
0 -1 -1
0 -1 -1
by visser
Wed Jul 31, 2002 1:10 pm
Forum: Volume 1 (100-199)
Topic: 146 - ID Codes
Replies: 35
Views: 5761

Try the following inputfile

cbbaa
a
a
#

output should be:

No Successor
No Successor
No Successor

but in your case I get a `Segmentation fault'
by visser
Wed Jul 31, 2002 1:03 pm
Forum: Volume 1 (100-199)
Topic: 161 - Traffic Lights
Replies: 28
Views: 4021

1. 300 seconds is not 5 hours, but 5 minutes

2. At the end of your program you never print hours only lots of minutes!!
see: printf("00:%02d:%02d\n",now/60,now%60);
by visser
Wed Jul 10, 2002 10:04 am
Forum: Volume 1 (100-199)
Topic: 113 - Power of Cryptography
Replies: 162
Views: 16102

Do you really need that much precision to get the correct answer?
by visser
Wed Jul 10, 2002 9:58 am
Forum: Volume 1 (100-199)
Topic: 167 - The Sultan's Successors
Replies: 21
Views: 3593

There are a bit more solutions than 4 for the 8-queen problem.
by visser
Mon Jul 01, 2002 3:36 pm
Forum: Volume 1 (100-199)
Topic: 168 - Theseus and the Minotaur
Replies: 64
Views: 7588

I can add that in one testcase a : (colon) is used where perhaps
a ; (semicolon) would be expected. One testcase must contain something like:

A:B:C

Go to advanced search