/* MINESWEEPER This challenge is based on the game Minesweeper. Create a function that takes a list of # and -, where each hash (#) represents a mine and each dash (-) represents a mine-free spot. Return a list where each dash is replaced by a digit indicating the number of mines immediately adjacent to the spot (horizontally, vertically, and diagonally). Examples num_grid([ ["-", "-", "-", "-", "-"], ["-", "-", "-", "-", "-"], ["-", "-", "#", "-", "-"], ["-", "-", "-", "-", "-"], ["-", "-", "-", "-", "-"] ]) ➞ [ ["0", "0", "0", "0", "0"], ["0", "1", "1", "1", "0"], ["0", "1", "#", "1", "0"], ["0", "1", "1", "1", "0"], ["0", "0", "0", "0", "0"], ] num_grid([ ["-", "-", "-", "#", "#"], ["-", "#", "-", "-", "-"], ["-", "-", "#", "-", "-"], ["-", "#", "#", "-", "-"], ["-", "-", "-", "-", "-"] ]) ➞ [ ["1", "1", "2", "#", "#"], ["1", "#", "3", "3", "2"], ["2", "4", "#", "2", "0"], ["1", "#", "#", "2", "0"], ["1", "2", "2", "1", "0"], ] https://www.sololearn.com/post/149770/?ref=app */ #include #include #include #include using namespace std; using vArr = valarray; int main(){ size_t sz{15};cin>>sz;sz++;string P{"-#"};vArr G('0',sz*sz); srand(time(0)); auto print=[&](auto&& m){ for(size_t i{1}; i idx{(i-1)*sz+j-1,(i-1)*sz+j,(i-1)*sz+j+1,i*sz+j-1,i*sz+j,i*sz+j+1,(i+1)*sz+j-1,(i+1)*sz+j,(i+1)*sz+j+1}; vArr sel(G[idx]); G[i*sz+j]=vArr(sel[sel=='#']).size()+48;}}; cout<<'\n',print(G);}

[Challenge] Minesweeper.cpp