Search found 1 match

by mostafakhattab
Tue Aug 16, 2011 6:10 pm
Forum: Volume 103 (10300-10399)
Topic: 10377 - Maze Traversal
Replies: 26
Views: 9781

Re: 10377 - Maze Traversal

I got WA, #include <iostream> using namespace std; int main() { int n = 0, row = 0, col = 0, sR = 0, sC = 0; char direct = 'N', c; cin >> n; while (1) { if (n == 0) break; n--; cin >> row >> col; char maze[row][col]; for (int i = 0; i < row; ++i) { for (int j = 0; j < col; ++j) { cin >> maze[i][j]; ...

Go to advanced search