程序代码：

#include  <stdio.h>

#define  N 101

int  main(void)

{
    int  a[N] = { 0 }, i, k = 0, j = 1;

    int m = 0, n;

    printf("Please input n:");   

    scanf("%d", &n);             // 千万别输比N - 1大的数哦， 要不然先改N的宏:)

    printf("\n");

    for (i = 1; i <= n; i++)

        a[i] = i;

    i = 1;

    while (m < n - 1)

    {      
        if (a[i])      
           
               k++;

                if ((k % 7 == 0  || k % 10 == 7 ) && a[i])
      
                {
                   a[i] = 0;

                   printf("%-3d-->  ", i);

                   m++;
                     
                    if (j++ % 6 == 0)

                        printf("\n");
                }
          
                if (i == n)

                    i = 0;

                    ++i;                         
    }

    printf("\n\nThe last one is ");

    for (i = 0; i <= n; i++)

    {
        if (a[i] != 0)

            printf("number %d\n", i);
    }

    printf("\n");

    return  0;
}

程序代码：

#include  <stdio.h>

#include  <malloc.h>

#define   LEN  sizeof(struct  nodelist)

typedef   struct  nodelist

{
    int  num;

    struct  nodelist  *next;

}LIST;

int  main(void)

{
    LIST *head, *end, *p1, *p2;

    int n, i, m = 0, k = 0, j = 1;

    head = NULL;

    printf("Please  input n:");

    scanf("%d", &n);

    printf("\n");

    p1 = p2 = (LIST *)malloc(LEN);

    head = p1;

    for (i = 1; i < n; i++)

    {
        p1 = (LIST *)malloc(LEN);

        p2 -> next = p1;

        p2 = p2 -> next;
    }

    end = p2;

    end -> next = head;

    p1 = head;  i = 1;

    do {
         p1 -> num = i;

         i++;

         p1 = p1 -> next;

          }while (p1  != head);

    p1 = head;

    p2 = end;

    while (m < n -1)

    {
            k++;

        if (k % 7 == 0 || k % 10 == 7) 

        {
             printf("%-3d-->  ", p1 -> num);

             if (j++ % 7 == 0) 
                
             {
                 printf("\n");
             }

             m++;
            
             p2 -> next = p1 -> next;
         
             p1 = p1 -> next;

        }
       
        else
       
        {
            p2 = p1;

            p1 = p1 -> next;
        }
    }

    printf("\n The last number is %d\n\n", p1 -> num); 

    printf("Yell %d times.\n\n", k);
   
     free(p1);

    return  0; 

}