We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Forming a Magic Square
  5. Discussions

Forming a Magic Square

Sort by

recency

|

1255 Discussions

|

  • wifivop476
     + 0 comments

    Guys, I am getting an output which doesn't match with the expected outputs of few test cases but the cost that I am getting as output is less than the expected min cost and even the final matrix also contains all distinct elements. Is anyone facing this problem or is the expected output = correct min cost? call center earphones with mic

  • dlesov
     + 0 comments
    def formingMagicSquare(s):
    a_b = [
        [-3,-1],
        [-3,1],
        [-1,-3],
        [-1,3],
        [1,-3],
        [1,3],
        [3,-1],
        [3,1]
    ]
    costs =[]
    for a,b in a_b:
        ms = [
            [5-b, 5+(a+b), 5 -a],
            [5-(a-b), 5, 5+(a-b)],
            [5+a, 5-(a+b), 5+b]
        ]
        cost = 0
        for i in range(3):
            for k in range(3):
                cost+=abs(s[i][k]-ms[i][k])
        
        costs.append(cost)
    return min(costs)

  • wifivop476
     + 0 comments

    I am getting an output which doesn't match with the expected outputs of few test cases but the cost that I am getting as output is less than the expected min cost and even the final matrix also contains all distinct elements. Is anyone facing this problem or is the expected output = correct min cost? ACFT Calculator

  • wifivop476
     + 0 comments

    I am getting an output which doesn't match with the expected outputs of few test cases but the cost that I am getting as output is less than the expected min cost and even the final matrix also contains all distinct elements. Is anyone facing this problem or is the expected output = correct min cost? Convert Units Online

  • stoyan_brayanov
     + 0 comments

    int magic[24][3][3] = {
    { {8, 1, 6}, {3, 5, 7}, {4, 9, 2} }, { {4, 3, 8}, {9, 5, 1}, {2, 7, 6} }, { {2, 9, 4}, {7, 5, 3}, {6, 1, 8} },
    { {6, 7, 2}, {1, 5, 9}, {8, 3, 4} },
    { {6, 1, 8}, {7, 5, 3}, {2, 9, 4} },
    { {8, 3, 4}, {1, 5, 9}, {6, 7, 2} },
    { {4, 9, 2}, {3, 5, 7}, {8, 1, 6} }, { {2, 7, 6}, {9, 5, 1}, {4, 3, 8} }
    };

    int formingMagicSquare(int s_rows, int s_columns, int** s) {

    int cost = 0;
int min_cost = INT_MAX;


for(int z = 0 ; z < 24;z++)
{
    for(int i = 0 ; i < s_rows;i++)
    {
        for(int j = 0 ; j < s_columns;j++)
        {
            cost += abs(s[i][j] - magic[z][i][j]);
        }     
    }
     if (cost < min_cost) 
            min_cost = cost;
        cost = 0;
}

    return min_cost;
    }