敢死队
来源:互联网 发布:javascript identifier 编辑:程序博客网 时间:2024/04/28 16:43
#include<stdio.h>
#include<stdlib.h>
#define w 5
struct node {
int data;
struct node *next;
};
struct node *creat(struct node *head, int n){
int i;
struct node *tail, *p, *q;
head = (struct node *)malloc(sizeof(struct node));
head -> next = NULL;
head -> data = 1;
tail = head;
for(i = 2; i <= n; i++){
p = (struct node *)malloc(sizeof(struct node));
p -> data = i;
p -> next = NULL;
tail -> next = p;
tail = p;
}
tail -> next = head;
return head;
}
int del(struct node * head, int n, int m){ // 敢死队 错了我
int num = 0;
int count1 = 0; // 每次就调用一个 del函数 次数初始化
struct node *p, *q;
q = head;
while(q -> next != head){
q = q -> next;
}
while(1){ // 一般 检验初始化, 采用 输入多次相等的值 来看/
p = q -> next;
num++;
if(num % m == 0){ // 找到 相应的值 然后就行 想要的操作;
if(p -> data == 1){
// printf("count2 == %d\n", count);
count1++;
return count1;
}
q -> next = p -> next;
count1++;
}
else q = p;
}
}
int main(){
int i, n;
while(scanf("%d",&n) && n){
struct node * head;
head = creat(head, n);
printf("%d\n", del(head, n, w));
}
return 0;
}
#include<stdlib.h>
#define w 5
struct node {
int data;
struct node *next;
};
struct node *creat(struct node *head, int n){
int i;
struct node *tail, *p, *q;
head = (struct node *)malloc(sizeof(struct node));
head -> next = NULL;
head -> data = 1;
tail = head;
for(i = 2; i <= n; i++){
p = (struct node *)malloc(sizeof(struct node));
p -> data = i;
p -> next = NULL;
tail -> next = p;
tail = p;
}
tail -> next = head;
return head;
}
int del(struct node * head, int n, int m){ // 敢死队 错了我
int num = 0;
int count1 = 0; // 每次就调用一个 del函数 次数初始化
struct node *p, *q;
q = head;
while(q -> next != head){
q = q -> next;
}
while(1){ // 一般 检验初始化, 采用 输入多次相等的值 来看/
p = q -> next;
num++;
if(num % m == 0){ // 找到 相应的值 然后就行 想要的操作;
if(p -> data == 1){
// printf("count2 == %d\n", count);
count1++;
return count1;
}
q -> next = p -> next;
count1++;
}
else q = p;
}
}
int main(){
int i, n;
while(scanf("%d",&n) && n){
struct node * head;
head = creat(head, n);
printf("%d\n", del(head, n, w));
}
return 0;
}
0 0
- 《敢死队》
- 敢死队
- 敢死队
- 螃蟹敢死队
- 敢死队问题
- 《敢死队》观后感
- 敢死队中文翻译
- 派遣敢死队
- 派遣敢死队
- 敢死队问题
- 不敢死队
- 不敢死队
- 派遣敢死队
- 派遣敢死队
- 成立项目突击敢死队
- 敢死队就像看焰火表演
- 电影 敢死队2
- 不敢死队问题
- uva-140
- POJ 1064
- 进程上下文和中断上下文的区别
- Android-UI 手机信息页面相关设计
- JavaScript从数组中删除指定值元素的方法
- 敢死队
- 阶乘与兔子问题
- CodeForces 144CAnagram Search
- Redis Sentinel环境下的Key过期事件消息订阅分析(重点介绍了sentinel.conf的配置参数)
- tensorflow学习笔记十二:没GPU也能玩梵高作画:Ubuntu tensorflow CPU版
- Intent Filters大揭秘
- 设计模式---原型模式(C++实现)
- C++操作注册表实现开机自启动程序
- 1-016. 查验身份证