77 lines
1.6 KiB
C
77 lines
1.6 KiB
C
#include <stdio.h>
|
|
#include <stdbool.h>
|
|
// Bonus Question
|
|
// All rows, columns, and diagonals are equal
|
|
|
|
|
|
// Sum of each row, in arr
|
|
int find_row_sum(const int arr[], int len) {
|
|
int sum = 0;
|
|
for(int i = 0; i < len; i++) {
|
|
sum+=arr[i];
|
|
}
|
|
return sum;
|
|
}
|
|
// Sum Of each column, in arr
|
|
int find_column_sum(const int arr[3][3],int row, int len) {
|
|
int sum = 0;
|
|
for(int i = 0; i < len; i++) {
|
|
sum+=arr[row][i];
|
|
}
|
|
return sum;
|
|
}
|
|
// Sum of diagonals, in arr
|
|
int find_diagonal_sum(const int arr[3][3], int len) {
|
|
int sum = 0;
|
|
int j = 0;
|
|
for(int i = 0; i < len; i++) {
|
|
sum+= arr[i][j];
|
|
j++;
|
|
}
|
|
return sum;
|
|
}
|
|
int find_diagonal_sum_the_other_way(const int arr[3][3], int len) {
|
|
int sum = 0;
|
|
int j = len - 1;
|
|
for(int i = 0; i < len; i++) {
|
|
sum += arr[i][j];
|
|
j--;
|
|
}
|
|
return sum;
|
|
}
|
|
|
|
bool is_perfect_square(const int arr[], int len) {
|
|
bool is_perfect = true;
|
|
for(int i = 0; i < len - 1 && is_perfect; i++) {
|
|
if(arr[i] != arr[i+1])
|
|
is_perfect = false;
|
|
}
|
|
return is_perfect;
|
|
}
|
|
|
|
int main() {
|
|
// Input will be a set matrix for now
|
|
int M = 3;
|
|
int square[3][3] = {{8, 1, 6}, {3, 5, 7}, {4,9,2}};
|
|
|
|
int sums[2*M + 2];
|
|
// MAKE THIS SINGLY LINKED LIST LATER
|
|
for(int i = 0; i < M; i++) {
|
|
sums[i] = find_row_sum(square[i], M);
|
|
}
|
|
for(int i = 0; i < M; i++) {
|
|
for (int j = M; j < 2 * M; j++) {
|
|
sums[j] = find_column_sum(square, i, M);
|
|
}
|
|
}
|
|
|
|
sums[2*M] = find_diagonal_sum(square, M);
|
|
sums[2*M+1] = find_diagonal_sum_the_other_way(square, M);
|
|
for(int i = 0; i < sizeof(sums)/sizeof(sums[0]); i++) {
|
|
printf("%d ", sums[i]);
|
|
}
|
|
|
|
printf("\n%d", is_perfect_square(sums, M));
|
|
|
|
return 0;
|
|
} |