// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit 2.1.4 (beta) modified by pivanof
bool KawigiEdit_RunTest(int testNum, int p0, bool hasAnswer, int p1) {
cout << "Test " << testNum << ": [" << p0;
cout << "]" << endl;
FibonacciDiv2 *obj;
int answer;
obj = new FibonacciDiv2();
clock_t startTime = clock();
answer = obj->find(p0);
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" << p1 << endl;
}
cout << "Your answer:" << endl;
cout << "\t" << answer << endl;
if (hasAnswer) {
res = answer == p1;
}
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;
}
int main() {
{
FibonacciDiv2 theObject;
eq(0, theObject.find(1),0);
}
{
FibonacciDiv2 theObject;
eq(1, theObject.find(13),0);
}
{
FibonacciDiv2 theObject;
eq(2, theObject.find(15),2);
}
{
FibonacciDiv2 theObject;
eq(3, theObject.find(19),2);
}
{
FibonacciDiv2 theObject;
eq(4, theObject.find(1000000),167960);
}
}
// BEGIN CUT HERE
int main(){
FibonacciDiv2 test;
cout << test.find(13) << endl;
}
