/* Challenge to find out diagonal value Date: 27/07/2018 Author: Timbo */ #include #include #include #include using namespace std; class Cell { private: const short _value; const bool _ledge; const bool _redge; public: Cell(short value, bool ledge, bool redge) : _value(value), _ledge(ledge), _redge(redge) { } short getValue() const { return _value; } bool getLEdge() const { return _ledge; } bool getREdge() const { return _redge; } }; bool isLeftEdge(Cell& c) { return c.getLEdge(); } bool isRightEdge(Cell& c) { return c.getREdge(); } short getSum(vector &cells, const bool leftToRight){ short sum = 0; int shifter = 0; auto f = find_if(cells.begin(), cells.end(), ( leftToRight ? isLeftEdge : isRightEdge )); while (f != cells.end()) { Cell &c = *f; sum += leftToRight ? (c.getValue() + shifter) : (c.getValue() - shifter); shifter++; f = find_if(++f, cells.end(), ( leftToRight ? isLeftEdge : isRightEdge )); } return sum; } int main() { // number of cells in each row + total rows (change this for bigger grid ) short size = 0; if (size < 1){ cout << "Size must be >= 1" << endl; return -1; } // total number of cells short cellCount = size * size; vector cells; for (int i = 1; i <= cellCount; i++) { short temp = cellCount - i; // what row is this short row = size - (temp / size); // what col is this short col = size - (temp % size ); // are we on a left or right edge bool ledge = (col == 1) ? true : false; bool redge = (col == size) ? true : false; cells.push_back(Cell(i, ledge, redge)); // display grid cout << setfill('0') << setw(3) << i << " "; if (redge) { cout << endl; } } const short sumL = getSum(cells, true); cout << endl << "Left Diagonal Sum: " << sumL << endl; const short sumR = getSum(cells, false); cout << endl << "Right Diagonal Sum: " << sumR << endl; return 0; }

Challenge to find diagonal value