Toggle navigation
linghang
F.A.Qs
Web Board
ProblemSet
Source/Category
Status
Ranklist
Contest
[
ProblemSet
Status
Ranklist
OI Ranklist
Statistics
]
Login
Problem E: 蜜蜂路线(bee)
Problem E: 蜜蜂路线(bee)
Time Limit:
1
Sec
Memory Limit:
128 MB
Submit:
32
Solved:
27
[
Submit
] [
Status
] [
Web Board
] [Creator:
]
Description
一只蜜蜂在下图所示的数字蜂房上爬动,已知它只能从标号小的蜂房爬到标号大的相邻蜂房,现在问你:蜜蜂从蜂房 M 开始爬到蜂房 N,M<N,有多少种爬行路线?
Input
输入 M,N 的值。
Output
爬行有多少种路线。
Sample Input
Copy
1 14
Sample Output
Copy
377
HINT
输出答案超过long long范围