Joseph Ring

JosephRing.h

#define _CRT_SECURE_NO_WARNINGS
#pragma once
#include<stdio.h>
#include<stdlib.h>
typedef struct Jew{
	int num;	
	struct Jew* next;}Jew;
Jew* initlink(int n);
void findpity(Jew* head, int ks, int m);

JosephRing.cpp

	#define _CRT_SECURE_NO_WARNINGS
#include "JosephR.h"
Jew* initlink(int n){	
Jew* head = new Jew;	
head->num = 1;	
head->next = NULL;	
Jew* circul = head;	
for (int i = 2; i < n + 1; i++) {		Jew* nextone = new Jew;		
nextone->num = i;		
nextone->next = NULL;		
circul->next = nextone;		}
	circul->next =head;to 
	return head;}
void findpity(Jew* head, int ks, int m){	Jew* tail = head;	
printf("tail now:%d", tail->num);	    while (tail->next != head) {		tail = tail->next;		
printf("tail is:%d\n", tail->num);
	}	
	Jew* pityone = head;	
	while (pityone->num != ks) {		tail = pityone;
pityone = pityone->next;	}	
while (pityone->next!=pityone)	{		for (int i = 1; i < m; i++) {			tail = pityone;			pityone = pityone->next;		}		printf("pityone is No.%d\n", pityone->num);		tail->next = pityone->next;//pityone died 		
pityone = tail->next;	}	free(pityone);}

main.cpp

	#define _CRT_SECURE_NO_WARNINGS
#include"JosephR.h"
int main() {	
printf("input all num n:,dead num m:,start from ks: \n");
	int n, m, ks;	
scanf("%d%d%d", &n, &m, &ks);	
Jew* head = initlink(n);	findpity(head, ks, m);	
return 0;}
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值