70,020
社区成员




#include <stdlib.h>
#include <stdio.h>
int queue[7];
int main()
{
int n, front, rear,i, delCnt = 0;
scanf("%d", &n);
for( i = 0; i < n; i++)
queue[i] = i+1; //初始化队列
front = 0; //队首位置
rear = n - 1; //队尾位置
while(1)
{
printf("%d ", queue[front]); //输出并抛弃队首元素
++delCnt;
front = (front + 1) % 7;
rear=(rear+1)%7;
queue[rear] = queue[front]; //队首元素转移到队尾
front = (front + 1) % 7;
if(delCnt >= n)
break;
}
system("pause");
return 0;
}