Reference no: EM132217596

C++ MAGIC SQUARE

write a program that generates a magic square for an array of size 3*3.

step1: use a 2d array of 3*3

step2: fill array with unique values 1-9 genrerated at random (ex. (rand()%9)+1)

use a function to check and see if the random numbers generated have been previously generated in the array,(check for unqiueness)

if the number is unique,store it in your 2d array

step3:display the 2d array

step4:check if thr 2d array is a magic square

(sum of each row=sum of each col.=sum of each diagonal)

step5:keep repeating the loop of steps1-4 until a magic square is found.

EX:

1 2 3

4 5 6

7 8 9

Not magic

2 3 1

4 5 6

7 8 9

not Magic

2 7 6

9 5 1

4 3 8

IS Magic

I CAN'T FIGURE OUT HOW TO OLNY HAVE THE NUMBER USED ONCE IN THE SQURE(NEED TO HAVE NONREPEATING NUMBERS)

#include <iostream>

#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <stdio.h>
using namespace std;
void checkSquare(int a[][3]);

int main()
{
int a[3][3];
srand(time(0));

for (int i=0; i<3; i++)

for (int j=0; j<3;j++)
{

a[i][j]=1+(rand()%9);

}
for (int i=0; i<3; i++)
{
for (int j=0; j<3;j++)

cout<<a[i][j]<<" ";
cout<<endl;

}
}