| Task: | Rabbits |
| Sender: | ariadna.roga |
| Submission time: | 2025-11-26 17:45:31 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | TIME LIMIT EXCEEDED |
| test | verdict | time | |
|---|---|---|---|
| #1 | TIME LIMIT EXCEEDED | -- | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | TIME LIMIT EXCEEDED | -- | details |
| #4 | TIME LIMIT EXCEEDED | -- | details |
| #5 | TIME LIMIT EXCEEDED | -- | details |
| #6 | TIME LIMIT EXCEEDED | -- | details |
| #7 | TIME LIMIT EXCEEDED | -- | details |
| #8 | TIME LIMIT EXCEEDED | -- | details |
| #9 | TIME LIMIT EXCEEDED | -- | details |
| #10 | TIME LIMIT EXCEEDED | -- | details |
| #11 | TIME LIMIT EXCEEDED | -- | details |
| #12 | TIME LIMIT EXCEEDED | -- | details |
| #13 | TIME LIMIT EXCEEDED | -- | details |
| #14 | TIME LIMIT EXCEEDED | -- | details |
| #15 | TIME LIMIT EXCEEDED | -- | details |
| #16 | TIME LIMIT EXCEEDED | -- | details |
| #17 | TIME LIMIT EXCEEDED | -- | details |
| #18 | TIME LIMIT EXCEEDED | -- | details |
| #19 | TIME LIMIT EXCEEDED | -- | details |
| #20 | TIME LIMIT EXCEEDED | -- | details |
| #21 | TIME LIMIT EXCEEDED | -- | details |
| #22 | TIME LIMIT EXCEEDED | -- | details |
| #23 | TIME LIMIT EXCEEDED | -- | details |
Code
#include <bits/stdc++.h>
using namespace std;
/*
Far far away in the future, humanity has sent 1 frozen newborn rabbit pair to populate an alien planet. Each pair of rabbits reaches maturity at the age of 1 month and they immediately mate. One month after mating the pair reproduces one pair of rabbits, after which the older pair mates again immediately. The rabbits never die and continue breeding forever.
How many months will the rabbit population be in an interval between a and b?
Input:
The first line contains 2 integers a,\,b: the interval boundaries.
Output:
Print a single integer d: the duration (in months) when the number of rabbit pairs is in the interval [a,\,b] inclusive.
Constraints:
1 \leq a \leq b \leq 10^{100}*/
long long fibonacci (long long i) {
if (i == 0)
return 0;
if (i == 1)
return 1;
return fibonacci (i - 1) + fibonacci (i - 2);
}
int main()
{
// ios_base::sync_with_stdio(0);
// cin.tie(0);
int a, b;
cin >> a >> b;
int x = 0;
while (fibonacci(x) < a)
++x;
long long count = 0;
while (fibonacci(x) <= b) {
++x;
++count;
}
cout << count << endl;
}Test details
Test 1
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 1000000000000000000000000000... |
| correct output |
|---|
| 480 |
| user output |
|---|
| (empty) |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 1 1 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000000000000000000000000000... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 4
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 708610693340620844512521044951... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 786632967217302919379405189471... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 636957196297222930779072940972... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 7
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 114612974378925787282507968062... |
| correct output |
|---|
| 3 |
| user output |
|---|
| (empty) |
Test 8
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 702530369037899946705172780410... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 9
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 274453166590443997807512962944... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 10
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 855307457139726034048493902602... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 11
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 639748223313530085297872188565... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 12
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 432993801671766821076571962007... |
| correct output |
|---|
| 1 |
| user output |
|---|
| (empty) |
Test 13
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 879671727283213079665539196480... |
| correct output |
|---|
| 1 |
| user output |
|---|
| (empty) |
Test 14
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 667785392416865594397610159182... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 15
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 781364162388340525444583784264... |
| correct output |
|---|
| 1 |
| user output |
|---|
| (empty) |
Test 16
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 655747298541157143247235560738... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 17
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 403413620814634912261621439265... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 18
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 447646307232291168178477866864... |
| correct output |
|---|
| 1 |
| user output |
|---|
| (empty) |
Test 19
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 295276605018840332007572176705... |
| correct output |
|---|
| 5 |
| user output |
|---|
| (empty) |
Test 20
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 443559664146440701189824727251... |
| correct output |
|---|
| 2 |
| user output |
|---|
| (empty) |
Test 21
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 734298173292503577661407215818... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 22
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 864568133527920094870111453259... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 23
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 352783378945989078522092015452... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
