/* Author - ~swim~ Date - 28-Apr-2018 Description: [ASSIGNMENT] Magic Square Magic Square A matrix is called Magic Square if sum of each row equals sum of each columns equals sum of each diagonal without getting any elements repeated, elements should be first n*n positive Integers Tasks :- Easy : Check if input matrix is magic square or not Hard : Take user input n and create n*n magic matrix. Example:- 3×3 magic matrix is [8 1 6] [3 5 7] [4 9 2] Where sum of each row=sum of each column=sum of each diagonal=15. P.S. :- Already submitted in assignment section . */ #include #include #include #include #include using namespace std; using VA = valarray; // 0(N) complexity bool is_msm(auto const& va, int SZ, int Sum) { for(int rcd{0}; rcd dbr2tl = fbyf[slice(DIM*DIM-1,DIM, -(DIM+1))]; VA tmp(dbr2tl); // top-left to right-bottom slice_array dtl2rb = fbyf[slice(0,DIM,DIM+1)]; dtl2rb = tmp; // reverse // top-right to left-bottom slice_array dtr2lb = fbyf[slice(DIM-1, DIM, DIM-1)]; tmp = VA(dtr2lb); // left-bottom to top-right slice_array dlb2tr = fbyf[slice((DIM-1)*DIM, DIM, -(DIM-1))]; dlb2tr = tmp; // reverse cout << "displaying 4 x 4 doubly" " even magic\n" "square " "matrix\n"; Print(fbyf,DIM); cout << boolalpha << "is magic square matrix? " << is_msm(fbyf,DIM,MSum4) << "\n"; }

[Assignment] Magic_square_matrix.cpp