#include <stdio.h>
#define maxSize 100
typedef struct{
  int date[maxSize]; //类似于数组的创建，为静态分配空间 
  int length;
}sqList;
void initSqList(sqList &L, int length){
  //顺序表的创建 
  int i;
  int x;
  L.length = length;
  printf("请输入有序顺序表A有\n");
  for(i = 0; i < length; i++){
    scanf("%d", &x);
    L.date[i] = x;
  }
}
int insertElem(sqList &L, int x, int n){
  //在线性表L中，n位置插入x
  int i;
  if(n < 0 || n > L.length || L.length == maxSize)
    //线性表条件判断 
    return 0;
  for(i = L.length - 1; i >= n - 1; i--){
    //插入位置后元素的移动 
    L.date[i + 1] = L.date[i]; 
  }
  L.date[n - 1] = x;
  L.length ++;
  return 1;
}
int main(){
  sqList sq;
  int i;
  printf("请输入顺序表A的长度\n"); 
  int length;
  scanf("%d", &length);
  initSqList(sq, length);
  printf("请输入插入元素：");
  int x;
  scanf("%d", &x);
  printf("请输入插入位置：");
  int n;
  scanf("%d", &n);
  int insert;
  insert = insertElem(sq, x, n);
  if(insert == 0)
    printf("插入失败:");
  if(insert == 1)
    printf("插入成功:");
  for(i = 0; i < sq.length; i++){
    printf("%d ",sq.date[i]);
  }
}

#include <stdio.h>
#include <malloc.h>
#define NULL 0
typedef struct LNode{
  int a; //系数 
  int b; //指数 
  struct LNode *next;
}LNode, *node;
void initLNode(node &L){
  //将二项式存入列表，使用&引用型指针，实现对实参的修改 
  int i;
  int length;
  node p, q;
  L = (node)malloc(sizeof(LNode)); //头的结点空间申请 
  p = L;
  printf("请输入多项式的项数：");
  scanf("%d",&length);
  for(i = 1; i <= length; i++){
    //结点的创建 
    q = (node)malloc(sizeof(LNode));
    printf("请输入第%d项的系数",i);
    scanf("%d",&q->a);
    printf("请输入第%d项的指数",i);
    scanf("%d",&q->b);
    p->next = q;
    p = q;
  }
  p->next = NULL;
}
node addLNode(node A, node B){
  //二项式加法实现 
  node C;
  C = (node)malloc(sizeof(LNode));
  node p, q, r, s; //辅助指针 
  p = A->next; 
  q = B->next;
  r = C;
  while(p != NULL && q != NULL){
    //同时遍历A,B链表 
    s = (node)malloc(sizeof(LNode));
    if(p->b == q->b){
      //指数相同
      s->a = p->a + q->a;
      s->b = p->b;
      r->next = s;
      p = p->next;
      q = q->next;
      r = s;
    }
    //指针不同时，指数小的先插入 
    else if(p->b < q->b){
      s->a = p->a;
      s->b = p->b;
      r->next= s;
      p = p->next;
      r = s;
    }
    else{
      s->a = q->a;
      s->b = q->b;
      r->next = s;
      q = q->next;
      r = s;
    }
    //当一个链表为空时，另一个直接将剩余插入 
    if (p != NULL){
      r->next = p;
    }
    if (q != NULL){
      r->next = q;
    }
  }
r->next = NULL; //保证尾结点的后面是空指针
  return C;
}
void showLNode(node L){
  //遍历显示链表 
  node p;
  p = L->next;
  while(p!= NULL){
    printf("系数为%d",p->a);
    printf("指数为%d  ",p->b);
    p = p->next;
  }
  printf("\n");
}
int main(){
  node A;
  initLNode(A);
  node B;
  initLNode(B);
  node C = addLNode(A, B);
  printf("A:");
  showLNode(A);
  printf("B:");
  showLNode(B);
  printf("C:");
  showLNode(C);
}

#include <stdio.h>
#include <malloc.h>
typedef struct LNode{
  int a;
  struct LNode *next;
}LNode, *node;
void initLNode(node &L, int n){
  //创建循环链表 
  L = (node)malloc(sizeof(LNode)); //头结点空间申请 
  int i;
  node p, q;
  p = L;
  p->a = 1;
  for(i = 1; i < n; i ++){
    //结点的插入 
    q = (node)malloc(sizeof(LNode));
    q->a = i + 1;
    p->next = q;
    p = q;
  }
  p->next = L;
}
void showOut(node L, int n, int m, int s){
  //输出游戏结果 
  int i;
  node p, q;
  p = L;
  for(i = 0; i < m + s - 3; i++){
    //第一次出列的位置 
    p = p->next;
  }
  q = p->next;
  printf("%d ", q->a);
  p->next = q->next;
  free(q);
  int count = 1;
  while(1){
    //循环遍历 
    for(i = 0; i < m - 1; i++){
      //满足出列位置的运算 
      p = p->next;
    }
    q = p->next;
    printf("%d ", q->a);
    p->next = q->next;
    free(q);
    count++;
    if(count == n){
      //计数器，结束条件 
      break;
    } 
  }
}
int main(){
  int n;
  int m;
  int s;
  printf("请输入人数：");
  scanf("%d", &n); 
  printf("请输入指定数字：");
  scanf("%d", &m);
  printf("请输入开始位置：");
  scanf("%d", &s);
  node L;
  initLNode(L, n);
  showOut(L, n, m, s);
}