程序代码：

#include<stdio.h>
#include<stdlib.h>
#define Status int
#define OK 1

struct Node
{
    int data;
    struct Node *next;
};

typedef struct Node ListNode;
typedef struct Node *LinkList;

LinkList CreatCyclelist(int n)//创建一个不带头节点的循环单链表
{
    LinkList head = NULL;
    int e;
    int i;
    ListNode *p, *q;
    q = NULL;
    for (i = 1; i <= n; i++)
    {
        printf("请输入元素：\n");
        scanf_s("%d",&e);
        
        if (i == 1)
        {
            head = (LinkList)malloc(sizeof(ListNode));
            head->data = e;
            head->next = NULL;
            q = head;
        }
        else
        {
            p = (LinkList)malloc(sizeof(ListNode));
            p->data = e;
            p->next = NULL;
            q->next = p;
            q=q->next;
        }
    }
    if (q != NULL)
        q->next = head;

    int m,counter=2;
    ListNode *s;
    ListNode *Q;
    s = Q = NULL;
    
    s = head;
    printf("请输入一个正整数作为报数上限值");
    scanf_s("%d",&m);
    if (m == 1)
    {
        q->next = head;
        free(head);
    }
    else
    {
        m=0;
        while(true)
        {
            
            s=s->next;
            if(m%counter==0)
            {
                Q=s->next;
                s->next=Q->next; 
                free(Q);
            }
            m++;
            if(s->next==s)
            break;
        }
    }
    return s; 
}

void DisplayCycleList(LinkList head)
{
    ListNode *p;
    p = head;
    if (p == NULL)
    {
        printf("该链表是空表");
        return;
    }
    while (p->next != head) {
        printf("%d", p->data);
        p = p->next;
    }
    printf("%4d", p->data);
}

main()
{
    int n;
    LinkList h;
//    printf("请输入顺序链表的表尾值：");
    printf("请输入顺序链表的的长度：");
    scanf_s("%d",&n);
    h = CreatCyclelist(n);
    DisplayCycleList(h);
    return 0;
}

程序代码：

#include<stdio.h>
#include<stdlib.h>

struct Node
{
    int data;
    struct Node *next;
};

typedef struct Node ListNode;
typedef struct Node *LinkList;

LinkList CreatCyclelist(int n)//创建一个不带头节点的循环单链表
{
    LinkList head = NULL;
    int e;
    int i;
    ListNode *p, *q;
    q = NULL;
    for (i = 1; i <= n; i++)
    {
        printf("请输入元素：\n");
        scanf_s("%d",&e);
        
        if (i == 1)
        {
            head = (LinkList)malloc(sizeof(ListNode));
            head->data = e;
            head->next = NULL;
            q = head;
        }
        else
        {
            p = (LinkList)malloc(sizeof(ListNode));
            p->data = e;
            p->next = NULL;
            q = p;
        }
    }
    if (q != NULL)
        q->next = head;

    int m,counter=2;
    ListNode *s;
    ListNode *Q;
    s = Q = NULL;
    
    s = head->next;
    printf("请输入一个正整数作为报数上限值");
    scanf_s("%d",&m);
    if (m == 1)
    {
        q->next = head->next;
        free(head);
    }
    else
    {
        do
        {
            while (counter < m)
            {
                s = (LinkList)malloc(sizeof(ListNode));
                s = s->next;
                counter++;
            }
            if (counter == m)
            {
                Q = (LinkList)malloc(sizeof(ListNode));
                Q = s;
                s = head;
                while (s->next != Q)  s = s->next;
                s->next = Q->next;
                free(Q);
            }
        } while (s->next = NULL);
    }
    return s;
}

void DisplayCycleList(LinkList head)
{
    ListNode *p;
    p = head;
    if (p == NULL)
    {
        printf("该链表是空表");
        return;
    }
    while (p->next != head) {
        printf("%d", p->data);
        p = p->next;
    }
    printf("%4d", p->data);
}

main()
{
    int n;
    LinkList h;
    printf("请输入顺序链表的表尾值：");
    scanf_s("%d",&n);
    h = CreatCyclelist(n);
    DisplayCycleList(h);
    return 0;
}

程序代码：

 int m,counter=2;
    ListNode *s;
    ListNode *Q;
    s = Q = NULL;
    
    s = head->next;
    printf("请输入一个正整数作为报数上限值");
    scanf_s("%d",&m);
    if (m == 1)
    {
        q->next = head->next;
        free(head);
    }
    else
    {
        do
        {
            while (counter < m)
            {
                s = (LinkList)malloc(sizeof(ListNode));
                s = s->next;
                counter++;
            }
            if (counter == m)//我觉得吧，counter等于m只会有一次相当于y=x和y=n交点只能有一个
            {
                Q = (LinkList)malloc(sizeof(ListNode));
                Q = s;
                s = head;
                while (s->next != Q)  s = s->next;
                s->next = Q->next;
                free(Q);
            }
        } while (s->next = NULL);//循环链表下一结点怎么会空？
    }
    return s;

程序代码：

int m,counter=2;
    ListNode *s;
    ListNode *Q;
    s = Q = NULL;
    
    s = head->next;
    printf("请输入一个正整数作为报数上限值");
    scanf_s("%d",&m);
    if (m == 1)
    {
        q->next = head->next;
        free(head);
    }
    else
    {
        do
        {
            while (counter < m)
            {
                s = (LinkList)malloc(sizeof(ListNode));
                s = s->next;
                counter++;
            }
            if (counter == m)//我觉得吧，counter等于m只会有一次相当于y=x和y=n交点只能有一个
            {
                Q = (LinkList)malloc(sizeof(ListNode));
                Q = s;
                s = head;
                while (s->next != Q)  s = s->next;
                s->next = Q->next;
                free(Q);
            }
          counter=0;//这里将counter重新清零，能不能改正它们只有一次相等的错误？
        } while (s->next = NULL);//循环链表下一结点怎么会空？（我想的是最后删除的只剩下一个节点了，此时这个节点的指针域一定是空啊。其实这里我是想表达就剩下一个节点了）
    }
    return s;