This content originally appeared on DEV Community and was authored by DEV Community
A 5 x 5 matrix is given which contains 24 zeros and 1 ones.
And the matrix is beautiful if the number one is located in the middle.
We need to count the minimum number of moves to make the matrix beautiful.
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int c =0;
for(int i =1;i<=5;i++)
{
for(int j=1;j<=5;j++)
{
cin>>c;
if(c == 1){
cout<< abs(i-3)+abs(j-3)<<endl;
}
}
}
return 0;
This content originally appeared on DEV Community and was authored by DEV Community
DEV Community | Sciencx (2022-02-22T15:54:37+00:00) 263 A.Beautiful Matrix | Codeforces Solution. Retrieved from https://www.scien.cx/2022/02/22/263-a-beautiful-matrix-codeforces-solution/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.