Search found 18 matches

by ayaw
Mon May 26, 2003 9:28 am
Forum: Volume 2 (200-299)
Topic: 227 - Puzzle
Replies: 56
Views: 10464

i got the same result... some of my friends try to solve this problem also got WA anyone knows how to get the input just for info, i use: for(i=0;i<5;i++) { for(j=0;j<5;j++) PUZZLE[i][j]=getchar(); scanf("\n"); } to gather the puzzle and... do { move = getchar(); if(move!='0'&&flag==1) flag = puzzle...
by ayaw
Sat May 24, 2003 8:31 am
Forum: Volume 1 (100-199)
Topic: 122 - Trees on the level
Replies: 103
Views: 12059

okay... here is my code!! #include <stdio.h> #include <string.h> #include <malloc.h> #include <stdlib.h> #define MAX 300 int arr[MAX][MAX]; struct tree { int n; struct tree *left,*right; } *root=0; int BROKEN; void make(struct tree **parent,char child) { int lock=0; struct tree *temp = (struct tree ...
by ayaw
Fri May 23, 2003 3:57 pm
Forum: Volume 1 (100-199)
Topic: 122 - Trees on the level
Replies: 103
Views: 12059

122 - Tree on level ( WA )

why i got WA??

i've checked for the empty node and double node case!!

anyone can help me??
what else case i've forgot??

Go to advanced search