void testCase3() {
int sums_[] = {95, 23, 87, 23, 82, 78, 59, 44, 12};
vector<int> sums(sums_, sums_ + (sizeof(sums_) / sizeof(sums_[0])));
int k = 70;
int expected_ = 6;
assertEquals(3, expected_, solution.find(sums, k));
}
void testCase2() {
int sums_[] = {999999999};
vector<int> sums(sums_, sums_ + (sizeof(sums_) / sizeof(sums_[0])));
int k = 1000000000;
int expected_ = 0;
assertEquals(2, expected_, solution.find(sums, k));
}
void testCase0() {
int sums_[] = {4, 7, 0, 5};
vector<int> sums(sums_, sums_ + (sizeof(sums_) / sizeof(sums_[0])));
int k = 0;
int expected_ = 7;
assertEquals(0, expected_, solution.find(sums, k));
}
void testCase1() {
int sums_[] = {4, 7};
vector<int> sums(sums_, sums_ + (sizeof(sums_) / sizeof(sums_[0])));
int k = 2;
int expected_ = 3;
assertEquals(1, expected_, solution.find(sums, k));
}
bool KawigiEdit_RunTest(int testNum, vector <int> p0, int p1, bool hasAnswer, int p2) {
cout << "Test " << testNum << ": [" << "{";
for (int i = 0; int(p0.size()) > i; ++i) {
if (i > 0) {
cout << ",";
}
cout << p0[i];
}
cout << "}" << "," << p1;
cout << "]" << endl;
TheOlympiadInInformatics *obj;
int answer;
obj = new TheOlympiadInInformatics();
clock_t startTime = clock();
answer = obj->find(p0, p1);
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" << p2 << endl;
}
cout << "Your answer:" << endl;
cout << "\t" << answer << endl;
if (hasAnswer) {
res = answer == p2;
}
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;
}
