-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSuribachsMagicSquare.cpp
More file actions
66 lines (58 loc) · 1.94 KB
/
SuribachsMagicSquare.cpp
File metadata and controls
66 lines (58 loc) · 1.94 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
//============================================================================
// Name : SuribachsMagicSquare.cpp
// Author : Imogen Cleaver-Stigum & Jyalu Wu
// Version : 11/8/19
// Copyright : ©2019 IMOLU
// Description : Suribachs Magic Square in C++
//============================================================================
#include <iostream>
#include "SuribachsMagicSquare.h"
using namespace std;
int MAX_TARGET_SUM = 132;
int **sizes = new int*[MAX_TARGET_SUM+1];
void sumCombos(int currentSum, int numsInCombo, int *combo, int startIndex, int targetSum) {
if (targetSum == 0) {
sizes[targetSum][0] = 1;
}
for (int i = startIndex; i < SQUARE_SIZE; i++) {
if (MAGIC_SQUARE[i] < (targetSum - currentSum)) {
combo[numsInCombo - 1] = MAGIC_SQUARE[i];
sumCombos(currentSum+MAGIC_SQUARE[i], numsInCombo+1, combo, i+1, targetSum);
}
else if (MAGIC_SQUARE[i] == (targetSum - currentSum)) {
combo[numsInCombo - 1] = MAGIC_SQUARE[i];
sizes[targetSum][numsInCombo]++;
}
}
}
void combosForEachSum() {
int *combo = new int[SQUARE_SIZE];
for (int i = 0; i <= MAX_TARGET_SUM; i++) {
sumCombos(0, 1, combo, 0, i);
}
}
int main () {
for (int i = 0; i <= MAX_TARGET_SUM; i++) {
sizes[i] = new int[SQUARE_SIZE];
for (int j = 0; j < SQUARE_SIZE; j++) {
sizes[i][j] = 0;
}
}
combosForEachSum();
int maxCombos = 0;
int sumWithMaxCombos = 0;
cout << "Sums of 0 for 0 elements: \t" << sizes[0][0] << endl;
for (int targetSum = 0; targetSum <= MAX_TARGET_SUM; targetSum++) {
for (int i = 1; i <= SQUARE_SIZE; i++) {
cout << "Sums of " << targetSum << " for " << i << " elements:\t";
cout << sizes[targetSum][i] << endl;
if (sizes[targetSum][i] > maxCombos) {
maxCombos = sizes[targetSum][i];
sumWithMaxCombos = targetSum;
}
}
}
cout << "The sum with the most combinations was " << sumWithMaxCombos;
cout << ", which can be created with " << maxCombos << " combinations. " << endl;
return 1;
}