Saturday, June 4, 2016
C++ Solution to UVA 352 - The Seasonal War using 2D Array Depth First Search
June 04, 2016
2d array traversal
,
352
,
array bound checking with direction arrays
,
beginner
,
connected components count
,
cpp
,
depth first search maze
,
dfs
,
easy
,
explanation
,
graph algorithm
,
solution
,
The Seasonal War
,
uva
Problem Link:
https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=288Problem Explanation & Visalization:
TODOInput & Output Explanation:
TODOInput & Output:
Input:6 100100 001010 000000 110000 111000 010100 8 01100101 01000001 00011000 00000010 11000011 10100010 10000001 01100000
Output:Image number 1 contains 3 war eagles. Image number 2 contains 6 war eagles.
More input and output in udebug:
https://www.udebug.com/UVa/352Code:
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment