double test2() { int p0 = 1; int p1 = 2; int p2 = 3; int p3 = 2; TheBoredomDivTwo * obj = new TheBoredomDivTwo(); clock_t start = clock(); int my_answer = obj->find(p0, p1, p2, p3); clock_t end = clock(); delete obj; cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl; int p4 = 3; cout <<"Desired answer: " <<endl; cout <<"\t" << p4 <<endl; cout <<"Your answer: " <<endl; cout <<"\t" << my_answer <<endl; if (p4 != my_answer) { cout <<"DOESN'T MATCH!!!!" <<endl <<endl; return -1; } else { cout <<"Match :-)" <<endl <<endl; return (double)(end-start)/CLOCKS_PER_SEC; } }
// BEGIN KAWIGIEDIT TESTING // Generated by KawigiEdit 2.1.4 (beta) modified by pivanof bool KawigiEdit_RunTest(int testNum, int p0, int p1, int p2, int p3, bool hasAnswer, int p4) { cout << "Test " << testNum << ": [" << p0 << "," << p1 << "," << p2 << "," << p3; cout << "]" << endl; TheBoredomDivTwo *obj; int answer; obj = new TheBoredomDivTwo(); clock_t startTime = clock(); answer = obj->find(p0, p1, p2, p3); clock_t endTime = clock(); delete obj; bool res; res = true; cout << "Time: " << double(endTime - startTime) / CLOCKS_PER_SEC << " seconds" << endl; if (hasAnswer) { cout << "Desired answer:" << endl; cout << "\t" << p4 << endl; } cout << "Your answer:" << endl; cout << "\t" << answer << endl; if (hasAnswer) { res = answer == p4; } if (!res) { cout << "DOESN'T MATCH!!!!" << endl; } else if (double(endTime - startTime) / CLOCKS_PER_SEC >= 2) { cout << "FAIL the timeout" << endl; res = false; } else if (hasAnswer) { cout << "Match :-)" << endl; } else { cout << "OK, but is it right?" << endl; } cout << "" << endl; return res; }
void testCase3() { int n = 4; int m = 7; int j = 7; int b = 4; int expected_ = 5; assertEquals(3, expected_, solution.find(n, m, j, b)); }
void testCase2() { int n = 1; int m = 2; int j = 3; int b = 2; int expected_ = 3; assertEquals(2, expected_, solution.find(n, m, j, b)); }
void testCase1() { int n = 2; int m = 1; int j = 1; int b = 2; int expected_ = 2; assertEquals(1, expected_, solution.find(n, m, j, b)); }