void Builder::makeFibonacci()
{
int whitchNumber;
Fibonacci fib;
cout << "podaj który elemen ci¹gu chcesz ";
cin >> whitchNumber;
cout << "--------------proba czasow dla ci¹gu fibonacziego------------- " << endl;
cout << "rekurencyjnie robi to w czasie: ";
CountStart = startTimer();
fib.fibonaciiR(whitchNumber);
CountEnd = endTimer();
timeOperation.QuadPart = CountEnd.QuadPart - CountStart.QuadPart;
QueryPerformanceFrequency(&freq);
tm = ((double)timeOperation.QuadPart) * 1000000000 / freq.QuadPart; //bedzie w nano sekundach
cout << tm << endl << "a wynik to: " << fib.fibonaciiR(whitchNumber);
cout << endl << endl;
cout << "moje robi to w czasie: ";
CountStart = startTimer();
fib.fibonaciiMoj(whitchNumber);
CountEnd = endTimer();
timeOperation.QuadPart = CountEnd.QuadPart - CountStart.QuadPart;
QueryPerformanceFrequency(&freq);
tm = ((double)timeOperation.QuadPart) * 1000000000 / freq.QuadPart; //bedzie w nano sekundach
cout << tm << endl << "a wynik to: " << fib.fibonaciiMoj(whitchNumber);
cout << endl << endl;
}
int _tmain(int argc, _TCHAR* argv[])
{
std::wcout.imbue(locale(locale(), "", LC_CTYPE));
varSize(L"hello", L"world", L"!");
std::cout << "print1:" << endl;
print(L"hello", L"world", L"!");
std::cout << endl;
std::cout << "print2:"<<endl;
print2(L"hello", L"world", L"!");
try
{
veda::Assert<wchar_t> assert;
assert.isTrue(false, L"error²âÊÔ message");
}
catch (veda::Assert<wchar_t>::_AssertException & e)
{
std::wcout << L"´íÎó²âÊÔ£º" << e.getMessage() << std::endl;
std::wcout << std::endl;
}
Fibonacci fi;
std::wcout << L"f(0)=" << fi.fibonacci(0)<<endl;
std::wcout << L"f(1)=" << fi.fibonacci(1) << endl;
std::wcout << L"f(2)=" << fi.fibonacci(2) << endl;
std::wcout << L"f(30)=" << fi.fibonacci(30) << endl;
/*veda::Vector<int> test;
test.add(1);
test.add(2);
test.add(3, 0);
test.add(4, 1);
for (auto i : test)
{
printf("%d ",i);
}
printf("\n");
testSelection();
testInsertion();
testShell();
testShuffle();
testMergeSort();
testStringFind();
testStringFindAll();
cout << "Reverse find testing" << endl;
testStringRFind();
testStringRFindAll();*/
testHeapSort();
system("PAUSE");
return 0;
}
int main()
{
Fibonacci fi;
printf("%d\n", fi.fibonacci(10));
char a;
a = getchar();
return 0;
}
void MailView::setMail(Mail* mail, bool reply) {
if (mail == 0) {
txtAddress->setText("");
txtSubject->setText("");
txtText->setText("");
connect(btnAddress, SIGNAL(clicked()), this, SLOT(openContacts()));
btnAddress->setStyleSheet("text-align:left; text-decoration: underline");
}
else {
txtAddress->setText(mail->getSenderAddress());
if (mail->getSubject().startsWith("-=fib=-")) {
Fibonacci fibonacci;
txtSubject->setText(fibonacci.decrypt(mail->getSubject().mid(7)));
txtText->setText(fibonacci.decrypt(mail->getText().replace("\r\n", "")));
}
else {
txtSubject->setText(mail->getSubject());
txtText->setText(mail->getText());
}
btnAddress->setStyleSheet("text-align:left");
}
bool readOnly = (mail != 0) ? true : false;
if (!reply) {
txtAddress->setReadOnly(readOnly);
txtSubject->setReadOnly(readOnly);
txtText->setReadOnly(readOnly);
btnAddress->setText((readOnly)?("From:"):("&To:"));
}
else {
txtAddress->setReadOnly(!readOnly);
txtSubject->setReadOnly(!readOnly);
txtText->setReadOnly(!readOnly);
btnAddress->setText("&To:");
}
if (btnAddress->text() == "&To:") {
btnAddress->setStyleSheet("text-align:left; text-decoration: underline");
}
btnAddress->setFlat(true);
}
int64_t Problem2::solve()
{
int64_t sum = 0;
Fibonacci<int64_t> fibonacci;
int i = 1;
int64_t current = fibonacci.getNth(i++);
while(current <= MAX)
{
if(!isOdd(current))
sum += current;
current = fibonacci.getNth(i++);
}
return sum;
}
#include <vector>
std::vector<long long> fibonacci(80, 0);
class Solution {
public:
long long solution(int N) {
if (N < 2)
return N;
if (fibonacci[N] != 0)
return fibonacci[N];
return fibonacci[N] = solution(N-1) + solution(N-2);
}
};
TEST_CASE( "Fibonacci are computed", "[Fibonacci]" ) {
Fibonacci object = Fibonacci();
REQUIRE( object.solution(0) == 0 );
REQUIRE( object.solution(1) == 1 );
REQUIRE( object.solution(2) == 1 );
REQUIRE( object.solution(4) == 3 );
REQUIRE( object.solution(5) == 5 );
REQUIRE( object.solution(6) == 8 );
REQUIRE( object.solution(7) == 13 );
REQUIRE( object.solution(8) == 21 );
REQUIRE( object.solution(9) == 34 );
REQUIRE( object.solution(10) == 55 );
}
TEST(FibTest, Nominal) {
Fibonacci f;
EXPECT_EQ(f.get(5), 5);
EXPECT_EQ(f.get(7), 13);
}
