数据结构 选票

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/a973893384/article/details/7927642
#include "stdafx.h"

struct person
{
	char name[21];
	int count;
}L[3]={"Li",0,"Zhang",0,"Wang",0};

int main(int argc, char* argv[])
{
	int i=0,t,e;
	int k;
	puts("1:Li   2:Zhang   3:Wang");
	while(i<20)
	{
		scanf("%d",&k);
		switch (k)
		{
			case 1:L[0].count++;
			case 2:L[1].count++;
			case 3:L[2].count++;
		}
		i++;
	}
	t=L[0].count;
	for(int j=0;j<3;j++)
		if(t<L[j].count)
		{
			t=L[j].count;
			e=j;
		}
	printf("%s is zhouzhang\n",L[e].name);
	return 0;
}


猜你喜欢

转载自blog.csdn.net/a973893384/article/details/7927642