题解 | 牛牛的考试

牛牛的考试

https://www.nowcoder.com/practice/1a7a7c8d721547a29107cf02330ffe72

#include <stdio.h>
#include <string.h>

int main()
{
	int T = 0;

	scanf("%d", &T);

	for (int i = 0; i < T; i++)
	{
		int arr1[4] = { 0 };

		for (int j = 0; j < 4; j++)
		{
			char arr2[601] = { 0 };

			scanf("%s", arr2);
			arr1[j] = strlen(arr2);
		}
		
		int max = arr1[0];
		int max_count = 0;
		int min = arr1[0];
		int min_count = 0;

		for (int x = 1; x < 4; x++)
		{
			if (arr1[x] > max)
			{
				max = arr1[x];
			}

			if (arr1[x] < min)
			{
				min = arr1[x];
			}
		}

		for (int y = 0; y < 4; y++)
		{
			if (arr1[y] == max)
			{
				max_count++;
			}

			if (arr1[y] == min)
			{
				min_count++;
			}
		}

		if (min_count == 1 && max_count != 1)
		{
			for (int j = 0; j < 4; j++)
			{
				if (arr1[j] == min)
				{
					printf("%c", 'A' + j);
					printf("\n");
				}
			}
		}

	else if (min_count != 1 && max_count == 1)
		{
			for (int j = 0; j < 4; j++)
			{
				if (arr1[j] == max)
				{
					printf("%c", 'A' + j);
					printf("\n");
				}
			}
		}

		else
		{
			printf("C");
			printf("\n");
		}
	}
	return 0;
}

全部评论

相关推荐

评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务