29 lines
452 B
Markdown
29 lines
452 B
Markdown
|
# 蜜蜂路线
|
|||
|
|
|||
|
## Tags
|
|||
|
|
|||
|
- C++一本通
|
|||
|
- 递推
|
|||
|
|
|||
|
## Description
|
|||
|
|
|||
|
一只蜜蜂在下图所示的数字蜂房上爬动,已知它只能从标号小的蜂房爬到标号大的相邻蜂房,现在问你:蜜蜂从蜂房$M$开始爬到蜂房$N$,$M\le N$,有多少种爬行路线?
|
|||
|
|
|||
|
![image-20231231195207593](https://r2.0x7f.app/images/2023/12/31/95a7OUnQFlgmT67b.png)
|
|||
|
|
|||
|
## Example Cases
|
|||
|
|
|||
|
### Case 1
|
|||
|
|
|||
|
#### Input
|
|||
|
|
|||
|
```
|
|||
|
1 14
|
|||
|
```
|
|||
|
|
|||
|
#### Output
|
|||
|
|
|||
|
```
|
|||
|
377
|
|||
|
```
|