huanghai
/
python
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'ebe26b08c7'
${ noResults }
python/TangDou/ShuLun/SL_17_剪绳子公式.txt

14 lines
594 B
Raw Normal View History Unescape

'commit'
2 years ago
剪绳问题核心公式
https://haokan.baidu.com/v?vid=18048810765923159607&pd=bjh&fr=bjhauthor&type=video
一根绳连续对折N 次,从中M刀,则被剪成了(2^N×M+1)段。
一、基本题型
【例题1】将一根绳子对折一次，然后每隔一定长度剪一刀，共剪2刀。问这样操作后，
原来的绳子被剪成了几段?
A.3 B.4 C.5 D.6
答案：2^1*2+1=5--->C
【例题2】将一根绳子对折三次，然后每隔一定长度剪一刀，共剪6刀。问这样操作后，原来的绳子被剪成了几段?
A.18 B.49 C.42 D.52
答案：2^3*6+1=49--->B