// Craftsman: Babak Sheykhan // Done for : https://www.sololearn.com/Discuss/1279219/?ref=app // Begin @ May 15, 2018 9:40 am // Ended_@ May 15, 2018 7:00 pm #include #include #include #include using namespace std; void unknownSquare(const int &n) { vector v(n, 0); vector > sq(n, v); int total_levels = ceil(n / 2.0); int current_level = 0; int current_dimension = n; int stop_at = 0; int nextRange_start = 0; while (current_level < total_levels) { int i, j; i = j = current_level; // These variables hold numerical ranges for each side of the square. int top_range = nextRange_start + 1; int right_range = nextRange_start + 2; int bottom_range = nextRange_start + 3; int left_range = nextRange_start + 4; stop_at = (current_dimension - 1) * 4; int step = 0; // for odd dimension (like 5, 7, etc.) we must fill in the central cell of the square, as well. if (stop_at == 0) sq[n/2][n/2] = n * n; while (step < stop_at) { int index2side = step / (current_dimension - 1); switch (index2side) { case 0: // Top side of the square sq[i][j] = top_range; top_range += 4; ++j; break; case 1: // Right side of the square sq[i][j] = right_range; right_range += 4; ++i; break; case 2:// Bottom side of the square sq[i][j] = bottom_range; bottom_range += 4; --j; break; case 3: // Left side of the square sq[i][j] = left_range; left_range += 4; --i; break; } ++step; } nextRange_start = left_range - 4; current_dimension -= 2; ++current_level; } for (int x = 0; x < n; ++x) { for (int y = 0; y < n; ++y) cout << setw(5) << sq[x][y]; cout << endl; } cout << endl; } int main() { const int dim1 = 1; const int dim2 = 2; const int dim3 = 3; const int dim4 = 4; const int dim5 = 5; const int dim6 = 6; const int dim7 = 10; unknownSquare(dim1); unknownSquare(dim2); unknownSquare(dim3); unknownSquare(dim4); unknownSquare(dim5); unknownSquare(dim6); unknownSquare(dim7); }

@Regi_Unknown Square