UVA - 133 The Dole Queue

最新推荐文章于 2023-11-29 23:20:39 发布

MrFox_

最新推荐文章于 2023-11-29 23:20:39 发布

阅读量251

点赞数

分类专栏：算法入门经典第二版第四章函数与递归

本文链接：https://blog.youkuaiyun.com/MrFox_/article/details/46623705

版权

算法入门经典第二版第四章函数与递归专栏收录该内容

6 篇文章

订阅专栏

模拟题以前blog上的

#include<stdio.h>  
#include<string.h>  
#include<stdlib.h>  
#include<math.h>  
int main()  
{  
    int person_num,step1,step2;  
    int choose_1,choose_2;  
    int person[100];  
    while(scanf("%d%d%d",&person_num,&step1,&step2))  
    {  
        if(person_num==0&&step1==0&&step2==0)  
            return 0;  
        int i,j;  
        int x,y;  
  
        for(i=1;i<=person_num;i++)  
        {  
            person[i]=i;  
        }  
  
        i=1,j=person_num;  
        int count=0,Count=0;  
        int Need_1,Need_2;  
  
        while(count<person_num)  
        {  
            x=0;  
            while(x<step1)  
            {  
                if(person[i]!=0)  
                {  
                    x++;  
                }  
                i++;  
                Need_1=i;  
                if(i>person_num)  
                {  
                   i=1;  
                }  
            }  
            choose_1=person[Need_1-1];  
            count++;  
  
            y=0;  
            while(y<step2)  
            {  
                if(person[j]!=0)  
                {  
                    y++;  
                }  
                j--;  
                Need_2=j;  
                if(j<1)  
               {  
                 j=person_num;  
               }  
            }  
            choose_2=person[Need_2+1];  
            count++;  
  
            if(choose_1!=choose_2)  
            {  
                if(Count==0)  
                    printf("%3d%3d",choose_1,choose_2);  
                else  
                    printf(",%3d%3d",choose_1,choose_2);  
                Count++;  
            }  
            else  
            {  
                if(Count==0)  
                    printf("%3d",choose_1);  
                else  
                    printf(",%3d",choose_1);  
                Count++;  
                count-=1;  
            }  
            person[Need_1-1]=0;  
            person[Need_2+1]=0;  
        }  
        printf("\n");  
        memset(person,0,sizeof(person));  
    }  
}