- 斐波那契数列
right
- @ 2026-11-21 10:34:53
#include <bits/stdc++.h>
using namespace std;
int fs(int x)
{
if(x==1) return 0;
if(x==2 || x==3) return 1;
return fs(x-1)+fs(x-2);
}
int main() {
int num;
cin >> num;
cout << fs(num) << endl;
return 0;
}
0 comments
No comments so far...
Information
- ID
- 682
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 2
- Tags
- (None)
- # Submissions
- 111
- Accepted
- 69
- Uploaded By