double test1() {
int t0[] = {1,1};
vector <int> p0(t0, t0+sizeof(t0)/sizeof(int));
int t1[] = {0,1};
vector <int> p1(t1, t1+sizeof(t1)/sizeof(int));
int p2 = 9;
RecurrenceRelation * obj = new RecurrenceRelation();
clock_t start = clock();
int my_answer = obj->moduloTen(p0, p1, p2);
clock_t end = clock();
delete obj;
cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
int p3 = 4;
cout <<"Desired answer: " <<endl;
cout <<"\t" << p3 <<endl;
cout <<"Your answer: " <<endl;
cout <<"\t" << my_answer <<endl;
if (p3 != my_answer) {
cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
return -1;
}
else {
cout <<"Match :-)" <<endl <<endl;
return (double)(end-start)/CLOCKS_PER_SEC;
}
}
void testCase6() {
int coefficients_[] = {901, 492, 100};
vector<int> coefficients(coefficients_, coefficients_ + (sizeof(coefficients_) / sizeof(coefficients_[0])));
int initial_[] = {-6, -15, -39};
vector<int> initial(initial_, initial_ + (sizeof(initial_) / sizeof(initial_[0])));
int N = 0;
int expected_ = 4;
assertEquals(6, expected_, solution.moduloTen(coefficients, initial, N));
}
void testCase5() {
int coefficients_[] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
vector<int> coefficients(coefficients_, coefficients_ + (sizeof(coefficients_) / sizeof(coefficients_[0])));
int initial_[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
vector<int> initial(initial_, initial_ + (sizeof(initial_) / sizeof(initial_[0])));
int N = 654;
int expected_ = 5;
assertEquals(5, expected_, solution.moduloTen(coefficients, initial, N));
}
void testCase4() {
int coefficients_[] = {25, 143};
vector<int> coefficients(coefficients_, coefficients_ + (sizeof(coefficients_) / sizeof(coefficients_[0])));
int initial_[] = {0, 0};
vector<int> initial(initial_, initial_ + (sizeof(initial_) / sizeof(initial_[0])));
int N = 100000;
int expected_ = 0;
assertEquals(4, expected_, solution.moduloTen(coefficients, initial, N));
}
void testCase3() {
int coefficients_[] = {2};
vector<int> coefficients(coefficients_, coefficients_ + (sizeof(coefficients_) / sizeof(coefficients_[0])));
int initial_[] = {1};
vector<int> initial(initial_, initial_ + (sizeof(initial_) / sizeof(initial_[0])));
int N = 64;
int expected_ = 6;
assertEquals(3, expected_, solution.moduloTen(coefficients, initial, N));
}
