Code (cpp):
#include <bits/stdc++.h>
using namespace std;
map<int, int> fib;
fib[0] = 0;
fib[1] = 1;
int getFib(int i) {
if (fib.find(i) != fib.end()) {
return fib[i];
}
fib[i] = getFib(i-1) + getFib(i-2);
return fib[i];
}
int main() {
int i;
cin >> i;
cout << getFib(i);
return 0;
}
#include <bits/stdc++.h>
using namespace std;
map<int, int> fib;
fib[0] = 0;
fib[1] = 1;
int getFib(int i) {
if (fib.find(i) != fib.end()) {
return fib[i];
}
fib[i] = getFib(i-1) + getFib(i-2);
return fib[i];
}
int main() {
int i;
cin >> i;
cout << getFib(i);
return 0;
}
A ovaj hoće?
Code (cpp):
#include <bits/stdc++.h>
using namespace std;
map<int, int> fib;
int getFib(int i) {
if (fib.find(i) != fib.end()) {
return fib[i];
}
fib[i] = getFib(i-1) + getFib(i-2);
return fib[i];
}
int main() {
fib[0] = 0;
fib[1] = 1;
int i;
cin >> i;
cout << getFib(i);
return 0;
}
using namespace std;
map<int, int> fib;
int getFib(int i) {
if (fib.find(i) != fib.end()) {
return fib[i];
}
fib[i] = getFib(i-1) + getFib(i-2);
return fib[i];
}
int main() {
fib[0] = 0;
fib[1] = 1;
int i;
cin >> i;
cout << getFib(i);
return 0;
}