Your Web News in One Place

Help Webnuz

Referal links:

Sign up for GreenGeeks web hosting
February 22, 2022 03:54 pm GMT

263 A.Beautiful Matrix | Codeforces Solution

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;

Original Link: https://dev.to/thivyaamohan/263-abeautiful-matrix-codeforces-solution-477p

Share this article:    Share on Facebook
View Full Article

Dev To

An online community for sharing and discovering great ideas, having debates, and making friends

More About this Source Visit Dev To