![[codeforces] A. Beautiful Matrix](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FbG0oWH%2FbtqxJT9icA9%2FAAAAAAAAAAAAAAAAAAAAAD0ZfGT5wHIaZz8NePdbvKmo2350lE2sBcIVaSUaGk8H%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DFafuP4wv2uiisUB7W46ZpJYsbfE%253D)
알고리즘(Python,Java)2019. 8. 26. 09:33[codeforces] A. Beautiful Matrix
problem You've got a 5 × 5 matrix, consisting of 24 zeroes and a single number one. Let's index the matrix rows by numbers from 1 to 5 from top to bottom, let's index the matrix columns by numbers from 1 to 5 from left to right. In one move, you are allowed to apply one of the two following transformations to the matrix: Swap two neighboring matrix rows, that is, rows with indexes i and i + 1 fo..