提交时间:2024-01-22 21:40:50
运行 ID: 123371
#include <bits/stdc++.h> using namespace std; int a [11] [11] ; int n , sum = 0 ; void dfs ( int x , int y ) { if ( x > 10 || x < 0 || y > 10 || y < 0 || a [x] [y] == 1 ) { return ; } a [x] [y] = 1 ; dfs ( x + 1 , y ) ; dfs ( x - 1 , y ) ; dfs ( x , y + 1 ) ; dfs ( x , y - 1 ) ; return ; } int main ( ) { for ( int i = 1 ; i <= 10 ; i ++ ) { for ( int j = 1 ; j <= 10 ; j ++ ) { cin >> a [i] [j] ; } } dfs ( 0 , 0 ) ; for ( int i = 1 ; i <= 10 ; i ++ ) { for ( int j = 1 ; j <= 10 ; j ++ ) { if ( ! a [i] [j] ) { sum ++ ; } } } cout << sum << endl ; return 0 ; }