單項(xiàng)選擇題Jose排列問(wèn)題定義如下:n個(gè)人排成環(huán)形,給定整數(shù)m,從第1個(gè)人開(kāi)始數(shù),沿環(huán)計(jì)數(shù),每遇到m個(gè)人就讓其出列,計(jì)數(shù)繼續(xù)進(jìn)行下去,直至剩下最后一個(gè)人為止,最后一個(gè)人為優(yōu)勝者。這個(gè)排列稱(chēng)為一個(gè)(n,m)的Josephus排列。(8,5)的優(yōu)勝者是()
A.6
B.3
C.5
D.8
您可能感興趣的試卷
你可能感興趣的試題
1.單項(xiàng)選擇題用不帶頭結(jié)點(diǎn)的單鏈表存儲(chǔ)隊(duì)列時(shí),其隊(duì)頭指針指向隊(duì)頭結(jié)點(diǎn),其隊(duì)尾指針指向隊(duì)尾結(jié)點(diǎn),則在進(jìn)行刪除操作時(shí)()
A.僅修改隊(duì)尾指針
B.僅修改隊(duì)頭指針
C.隊(duì)頭,隊(duì)尾指針都可能要修改
D.隊(duì)頭、隊(duì)尾指針都要修改
2.單項(xiàng)選擇題設(shè)數(shù)組queue[m]作為循環(huán)隊(duì)列Q的存儲(chǔ)空間,front為隊(duì)頭指針,rear為隊(duì)尾指針,則執(zhí)行出隊(duì)操作后其頭指針front的值為()
A.front=(front-1)%m
B.front=(front+1)%(m-1)
C.front=front+1
D.front=(front+1)%m