|
发表于 2018-12-20 10:22:27
|
显示全部楼层
#include<stdio.h>
#include<string.h>
void main()
{
struct
{
char name[20];
int score;
}condidant[3]={{"小甲鱼",0},{"路人甲",0},{"路人乙",0}};
printf("参与投票的有:\n");
int i,n;
for(i=0;i<3;i++)
{
printf("%s",condidant[i].name);
printf("\t");
}
printf("\n");
int j;
char name[20];
for(j=1;j<7;j++)
{
printf("第%d位投给:",j);
gets(name);
if(strcmp(condidant[0].name,name)==0)
{
condidant[0].score++;
}
if(strcmp(condidant[1].name,name)==0)
{
condidant[1].score++;
}
if(strcmp(condidant[2].name,name)==0)
{
condidant[2].score++;
}
printf("\n");
}
printf("小甲鱼的票数为:%d",condidant[0].score);
printf("路人甲的票数为:%d",condidant[1].score);
printf("路人乙的票数为:%d",condidant[2].score);
printf("\n");
char * max=condidant[0].name;
if(condidant[0].score<condidant[1].score)
{
max=condidant[1].name;
}
if("condidant[1].score<condidant[2].score")
{
max=condidant[2].name;
}
if(condidant[0].score<condidant[2].score)
{
max=condidant[2].name;
}
printf("获得票数最多的是%s\n",*max);
}
最后那个求获票数最多的不会,怎么破? |
|