DEV Community

Thivyaa Mohan
Thivyaa Mohan

Posted on


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.

using namespace std;

int main(){
    int c =0;
    for(int i =1;i<=5;i++)
        for(int j=1;j<=5;j++)
            if(c == 1){
                cout<< abs(i-3)+abs(j-3)<<endl;
    return 0;
Enter fullscreen mode Exit fullscreen mode

Top comments (0)

Hi!I'm Noah!

Hey, my name is Noah and I’m the one who set up this ad!

My job is to get you to join DEV, so if you fancy doing me a favor, I’d love for you to create an account.
If you found DEV from searching around, here are a couple of our most popular articles on DEV: