// Refactored by Babak Sheykhan // Begin : May 28, 2018 20:45 // End : May 31, 2018 18:05 // Done for : Modi // Original version @ https://code.sololearn.com/cr15pyY8DCux/?ref=app /* Changelog: 1. Compatibility features with C++98/03 added. 2. Incorporating OOD/P as part of complexity reduction and ease of maintenance. 3. Additional method of data representation (bar chart) added. */ #include #include #include #include #include using namespace std; /*-----------------------------*/ /* */ /* Conditional Compilation */ /* Block */ /* */ /*-----------------------------*/ // Is C++11 compliant? #if __cplusplus >= 201103L #define TO_STR(N) to_string(N) #define INIT_V(P) begin(P), end(P) #elif __cplusplus <= 199711L #include inline string _ssConv(int _n) { stringstream ss; ss << _n; return ss.str(); } #define TO_STR(N) _ssConv(N) // Don't work for pure c++98 complient //#define TO_STR(N) to_string( static_cast(N) ) // Initialize vector using pointer arithmetic #define INIT_V(P) P, P + sizeof(P) / sizeof(unsigned) #endif #define C(N) char(N) #define AXIS_TAGS C(32), C(32), C(32), C(32), C(32), C(32), C(32), C(32), C(32), C(32), '5', '0', 'K', C(32), C(32), C(32), C(32), C(32), C(32), C(32), '1', '0', '0', 'k', C(32), C(32), C(32), C(32), C(32), C(32), '2', '0', '0', 'k', C(32) #define XP_AXIS C(32), C(218), C(196), C(194), C(196), C(194), C(196), C(194), C(196), C(194), C(196), C(203), C(196), C(194), C(196), C(194), C(196), C(194), C(196), C(194), C(196), C(203), C(196), C(194), C(196), C(194), C(196), C(194), C(196), C(194), C(196), C(183), ' ', 'X', 'p' /* .................................... ... ____________________________ ... ...| Compound_t (UML) |... ...+----------------------------+... ...| [+] _graphData : Vector |... ...| [+] dailyStreakBonus : U |... ...| [+] totalBonus : U |... ...|____________________________|... ...| [+] storeAnnualBonus() |... ...|____________________________|... .................................... */ /*-----------------------------*/ /* */ /* Compound_t.h */ /* */ /*-----------------------------*/ struct Compound_t { vector _graphData; unsigned dailyStreakBonus; unsigned totalBonus; void storeAnnualBonus() { _graphData.push_back(totalBonus); } }; /* .................................... ... ____________________________ ... ...| Bonus (UML) |... ...+----------------------------+... ...| [-] daysBaseline : |... ...| U[0..*] <> |... ...| [-] bonusBaseline : |... ...| U[0..*] <> |... ...| [-] daysLookup : Vector |... ...| [-] bonusLookup : Vector|... ...| [-] NO_OF_YEARS : U = 1 |... ...| <> |... ...| [-] ct : Compound_t |... ...|____________________________|... ...| [+] Bonus(U = NO_OF_YEARS) |... ...| [-] formatBonusTable(U) |... ...| [-] getBonus(U) |... ...| [-] dotify() : String |... ...| [-] genGraph() |... ...|____________________________|... .................................... */ /*-----------------------------*/ /* */ /* Bonus.h */ /* */ /*-----------------------------*/ class Bonus { public: // A simple interface is exposed to the client without revealing any underlying complexity. Bonus(unsigned years = NO_OF_YEARS); private: // Responsible for formatting the bonus table. void formatBonusTable(unsigned totalDays); // Core logic of bonus calculation based on dynamic lookup tables and storing the grand total on a custom data type for further manipulation. void getBonus(unsigned streakDay); // Produce decorative dots as a sign of skipped days. string dotify(unsigned skippedDays); // Generate a horizontal bar graph as visual report. void genGraph(); /*** >>> Proposals for further improvement <<< 1- Another bonus mechanism as super bonus (or fanatic bonus etc.) can be added. getSuperBonus(unsigned dayX); 2- Sending the result summary to a file/database as an archive/backup utility. void sendToFile(); ***/ // These lookup tables make it possible to expand the range of calculation to 10 years or more (limited to 10 years, here). // Limitation: User can't enter the # of days like 224 or so. Just # of years. So, it is less flexible. vector daysLookup; vector bonusLookup; // Baseline tables // The reason for using seperate lists as Lookup tables intializers instead of c++11 list-initialization method, is for the sake of backward compatibility with c++98/03 static unsigned daysBaseline[]; static unsigned bonusBaseline[]; // Default # of years. Can be overridden by passing a value between 1 - 10 while object construction. static const unsigned NO_OF_YEARS = 1; // Central micro-database Compound_t ct; }; /*-----------------------------*/ /* */ /* Bonus.cpp */ /* */ /*-----------------------------*/ unsigned Bonus::daysBaseline[] = {7, 100, 180, 365}; unsigned Bonus::bonusBaseline[] = {30, 500, 750, 1000}; Bonus::Bonus(unsigned years) : daysLookup(INIT_V(daysBaseline)), bonusLookup(INIT_V(bonusBaseline)) { if (years > 10 || years == 0) { cout << "Invalid number of years.\n"; } else { unsigned no_of_days = 365 * years; // Reserve memory for 10 years worth of storage (31 is needed. I made it 32 to be a power of 2). daysLookup.reserve(32); bonusLookup.reserve(32); // Preparing lookup tables for (unsigned idx = 1; idx < years; ++idx) { unsigned days_last_elem = daysLookup.back(); unsigned bonus_last_elem = bonusLookup.back(); daysLookup.push_back(days_last_elem + daysLookup[1]); daysLookup.push_back(days_last_elem + daysLookup[2]); daysLookup.push_back(days_last_elem + daysLookup[3]); bonusLookup.push_back(bonus_last_elem + bonusLookup[1]); bonusLookup.push_back(bonus_last_elem + bonusLookup[2]); bonusLookup.push_back(bonus_last_elem + bonusLookup[3]); } // Initialize custom data type ct._graphData.reserve(16); ct.dailyStreakBonus = 0; ct.totalBonus = 0; formatBonusTable(no_of_days); genGraph(); } } void Bonus::formatBonusTable(unsigned totalDays) { // bonus for the previous day unsigned iLastBonus = 0; // remember if the bonus was the same as last day bool bSameSame = false; cout << " Day | Bonus | Total \n"; cout << "======================\n"; for ( unsigned iStreakDay = 1; iStreakDay <= totalDays; iStreakDay++ ) { getBonus( iStreakDay ); if ( iLastBonus != ct.dailyStreakBonus ) { // show also the line before the change if ( bSameSame ) { //printf( " %4d | %4d | %5d\n", iStreakDay-1, 5, ct.totalBonus - ct.dailyStreakBonus ); cout << setw(5) << (iStreakDay - 1) << " | " << setw(4) << 5 << " | " << setw(5) << ct.totalBonus - ct.dailyStreakBonus << endl; } // not confimed yet if ( ct.dailyStreakBonus > 1000 ) { cout << " _____Not Sure!______\n"; } //printf( " %4d +-%4d -+ %5d\n", iStreakDay, ct.dailyStreakBonus, ct.totalBonus ); cout << setw(5) << iStreakDay << " +-" << setw(4) << ct.dailyStreakBonus << " -+ " << setw(5) << ct.totalBonus << endl; bSameSame = false; } // put in a (one) placeholder for repeating lines else if ( !bSameSame ) { //printf( " %4s | . | %5s\n", dotify( iStreakDay ).c_str(), dotify( ct.totalBonus ).c_str() ); cout << setw(5) << dotify(iStreakDay) << " | " << setw(4) << "." << " | " << setw(5) << dotify(ct.totalBonus) << endl; bSameSame = true; } // remember the bonus for the next day iLastBonus = ct.dailyStreakBonus; } } void Bonus::getBonus(unsigned streakDay) { // Check whether the current streak day is a bonus day, at all. if ( find(daysLookup.begin(), daysLookup.end(), streakDay) != daysLookup.end() ) { // If so, locate and store the position of the matched bonus day in the days table. unsigned pos = distance( daysLookup.begin(), find(daysLookup.begin(), daysLookup.end(), streakDay)); // Then, retrieve its bonus counterpart value from bonus table by using the stored position in the last line. ct.dailyStreakBonus = bonusLookup[pos]; ct.totalBonus += ct.dailyStreakBonus; // Finally, check streakDay to see if it reached to an annual. if (streakDay % 365u == 0) ct.storeAnnualBonus(); return; } // Every 30 days. if ( streakDay % 30u == 0 ) { ct.dailyStreakBonus = 100u; ct.totalBonus += ct.dailyStreakBonus; return; } // Default for each day. ct.dailyStreakBonus = 5u; ct.totalBonus += ct.dailyStreakBonus; return; } string Bonus::dotify(unsigned skippedDays) { string sDotifiedNumber ( TO_STR(skippedDays).length(), '.' ); return sDotifiedNumber; } void Bonus::genGraph() { const unsigned axisLength = 35u; const unsigned row = 2u; char xpAxis[row][axisLength] = { {AXIS_TAGS}, {XP_AXIS} }; cout << endl << " ..........................\n" << " ....... Statistics .......\n" << " ..........................\n\n"; for (unsigned i = 0; i < row; ++i) { for (unsigned j = 0; j < axisLength; ++j) cout << xpAxis[i][j]; cout << endl; } const unsigned _100k = 100000u; const double _10k = 10000.0; const double _5k = 5000.0; const double half = 0.5; unsigned grossScale; unsigned netScale; unsigned netXp; for (unsigned vCell = 0; vCell < ct._graphData.size(); ++vCell) { // Annual gross and net xp grapher if (ct._graphData[vCell] <= _100k) grossScale = static_cast( ct._graphData[vCell] / _5k + half ); else { unsigned above_100k_portion = ct._graphData[vCell] - _100k; grossScale = static_cast( above_100k_portion / _10k + half ); grossScale += static_cast( _100k / _5k + half); } if (vCell != 0) { netXp = ct._graphData[vCell] - ct._graphData[vCell - 1]; netScale = static_cast( netXp / _5k + half ); } else { netXp = ct._graphData[vCell]; netScale = static_cast( netXp / _5k + half ); } cout << " " << C(195); for (unsigned filler = 0; filler < grossScale; ++filler) cout << C(219); cout << " " << ct._graphData[vCell] /*<< " @ Y" << vCell + 1*/ << endl; cout << " " << C(195); for (unsigned filler = 0; filler < netScale; ++filler) cout << C(177); cout << " " << netXp << " Net" << endl; cout << " " << C(179) << endl; } } /*-----------------------------*/ /* */ /* Client */ /* */ /*-----------------------------*/ int main() { //Bonus B1; Bonus B2(2); //Bonus B3(5); // Has limitation on SL //Bonus B4(10); // " " " " }

@Modi_Bonus System