Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int fib(int n) {
- if(n <= 2) {
- return 1;
- }
- return fib(n - 1) + fib(n - 2);
- }
- int dali_e_fibonaciev(int N, int i) {
- if(fib(i) == N) {
- return 1;
- }
- if(fib(i) > N) {
- return 0;
- }
- return dali_e_fibonaciev(N, i + 1);
- }
- int rec(int P, int K) {
- if(P > K) {
- return 0;
- }
- int fib = 0;
- if(dali_e_fibonaciev(P, 1)) {
- fib = 1;
- }
- return rec(P + 1, K) + fib;
- }
- int main() {
- int P, K;
- cin >> P >> K;
- cout << rec(P, K) << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement