資源簡(jiǎn)介
描述:
設(shè)有N名同學(xué)手拉手圍成一圈,自1、2、3、......開(kāi)始編號(hào),現(xiàn)從1號(hào)開(kāi)始連續(xù)數(shù)數(shù),
每數(shù)到M將此同學(xué)從圈中拉走, 求最后被拉走的同學(xué)的編號(hào)
輸入:
兩個(gè)正整數(shù),分別為N和M。0<N<=100 ;0<M<65535
輸出:
一個(gè)正整數(shù),為最后被拉走的同學(xué)的編號(hào),最后輸出回車
輸入樣例:
100 10
輸出樣例:
26
代碼片段和文件信息
#include?
void?main()
{
int?icountstu_numMj;
struct?student
{
int?flag;
int?next;
};
struct?student?stu[65535];
printf(“input?the?number?of?the?students:\n“);
scanf(“%d“&stu_num);
printf(“input?the?number?M:\n“);
scanf(“%d“&M);
for(i=1;i<=stu_num;i++)
{
if(i==stu_num)
stu[i].next=1;
else
stu
評(píng)論
共有 條評(píng)論