| Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Cleaned-up version of the maze program. |
| 3 | * Doesn't look as nice, but should work with all C compilers. |
| 4 | * Sascha Wilde, October 2003 |
| 5 | */ |
| 6 | #include <stdio.h> |
| 7 | #include <stdlib.h> |
| 8 | |
| 9 | char *M, A, Z, E = 40, line[80], T[3]; |
| 10 | int |
| Mohamed Akram | 3ce2746 | 2024-07-15 20:23:36 +0200 | [diff] [blame] | 11 | main (int C) |
| Bram Moolenaar | 071d427 | 2004-06-13 20:20:40 +0000 | [diff] [blame] | 12 | { |
| 13 | for (M = line + E, *line = A = scanf ("%d", &C); --E; line[E] = M[E] = E) |
| 14 | printf ("._"); |
| 15 | for (; (A -= Z = !Z) || (printf ("\n|"), A = 39, C--); Z || printf (T)) |
| 16 | T[Z] = Z[A - (E = A[line - Z]) && !C |
| 17 | & A == M[A] |
| 18 | | RAND_MAX/3 < rand () |
| 19 | || !C & !Z ? line[M[E] = M[A]] = E, line[M[A] = A - Z] = |
| 20 | A, "_." : " |"]; |
| 21 | return 0; |
| 22 | } |