You saved me, Cotta, thanks!rcotta wrote:I found what I was doing wrong. When I read the tree could have at most 256 nodes, I assumed its depth would be at most 8, but it is not true.
Fixed this and know my code works.
-- Martinelli.
Search found 3 matches
- Sun Jul 25, 2004 6:13 am
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 12940
- Wed Jul 14, 2004 8:14 am
- Forum: Volume 106 (10600-10699)
- Topic: 10660 - Citizen attention offices
- Replies: 20
- Views: 7673
- Mon Jun 28, 2004 2:56 am
- Forum: Volume 106 (10600-10699)
- Topic: 10660 - Citizen attention offices
- Replies: 20
- Views: 7673
I am receiving WA too. I test my code with the inputs and its OK. Here's my code: [c]#include <stdio.h> #include <stdlib.h> #include <string.h> int n, z, i, j, x, y, v; int level; int mat[25]; int pos[5], resp[5]; int min_total, min_cada, min_temp; void Testa() { min_temp = 0; for (i = 0; i < 25; i+...