模拟选票过程06-3

最新推荐文章于 2024-10-02 22:45:05 发布

阿芙乐尔qq

最新推荐文章于 2024-10-02 22:45:05 发布

阅读量85

点赞数

文章标签：开发语言算法

本文链接：https://blog.csdn.net/CKROL/article/details/133578184

版权

4位候选人zhang,wang,li,zhao，代号分别为1，2，3，4.选举人直接键入候选人代号，1-4之外的视为弃权票，-1位终止，

#include <stdio.h>

int main() {
    enum candidate{zhang,wang,li,zhao}cand;
    int vote[4]={0};
    int n;
    int count=0;
    printf("please input your vote:\n");
    while(1){
        scanf("%d",&n);
        if(n<1 || n>4){
            if(n==-1)
                break;
            else
                printf("yi qiquan!");
        }
        if(1<=n && n<=4){
            count++;     //总票数
            vote[n-1]++;
        }
    }
    for (int k = 1; k < 5; ++k) {
        cand=(enum candidate)k;
        printf("candidate %d de depiaoshi: ",cand);
        switch (cand) {
            case zhang:
                if(vote[cand-1]>count/2)
                    printf("dangxuan");
                printf("zhang :%d\n",vote[0]);
                break;
            case wang:
                if(vote[cand-1]>count/2)
                    printf("dangxuan");
                printf("wang :%d\n",vote[1]);break;
            case li:
                if(vote[cand-1]>count/2)
                    printf("dangxuan");
                printf("li :%d\n",vote[2]);break;
            case zhao:
                if(vote[cand-1]>count/2)
                    printf("dangxuan");
                printf("zhao :%d\n",vote[3]);break;
            default:break;
        }
    }

    return 0;
}
//            switch (n) {
//                case 1:vote[0]++;break;
//                case 2:vote[1]++;break;
//                case 3:vote[2]++;break;
//                case 4:vote[3]++;break;
//                default:break;
//            }