This repository was archived by the owner on Jul 4, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathforming a magic square.cpp
More file actions
112 lines (80 loc) ยท 2.22 KB
/
forming a magic square.cpp
File metadata and controls
112 lines (80 loc) ยท 2.22 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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
/*
* Complete the 'formingMagicSquare' function below.
*
* The function is expected to return an INTEGER.
* The function accepts 2D_INTEGER_ARRAY s as parameter.
*/
const int SQUARES[8][3][3] = {
{{8,1,6}, {3,5,7}, {4,9,2}},
{{6,1,8}, {7,5,3}, {2,9,4}},
{{4,9,2}, {3,5,7}, {8,1,6}},
{{2,9,4}, {7,5,3}, {6,1,8}},
{{8,3,4}, {1,5,9}, {6,7,2}},
{{4,3,8}, {9,5,1}, {2,7,6}},
{{6,7,2}, {1,5,9}, {8,3,4}},
{{2,7,6}, {9,5,1}, {4,3,8}}
};
int formingMagicSquare(vector<vector<int>>& s) {
int global_cost = INT_MAX, local_cost = 0;
for (int i = 0; i < 8; i++) {
local_cost = 0;
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
local_cost += abs(s[j][k] - SQUARES[i][j][k]);
}
}
global_cost = min(local_cost, global_cost);
}
return global_cost;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
vector<vector<int>> s(3);
for (int i = 0; i < 3; i++) {
s[i].resize(3);
string s_row_temp_temp;
getline(cin, s_row_temp_temp);
vector<string> s_row_temp = split(rtrim(s_row_temp_temp));
for (int j = 0; j < 3; j++) {
int s_row_item = stoi(s_row_temp[j]);
s[i][j] = s_row_item;
}
}
int result = formingMagicSquare(s);
fout << result << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
vector<string> split(const string &str) {
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos) {
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}