python实现pat 1054. The Dominant Color (20)

冷不防 2022-06-04 04:24 227阅读 0赞

1054. The Dominant Color (20)

题目

Behind the scenes in the computer’s memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color with the largest proportional area is called the dominant color. A strictly dominant color takes more than half of the total area. Now given an image of resolution M by N (for example, 800x600), you are supposed to point out the strictly dominant color.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: M (<=800) and N (<=600) which are the resolutions of the image. Then N lines follow, each contains M digital colors in the range [0, 224). It is guaranteed that the strictly dominant color exists for each input image. All the numbers in a line are separated by a space.

Output Specification:

For each test case, simply print the dominant color in a line.

Sample Input:
5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24
Sample Output:
24

解答

用了字典来统计各个数字出现的次数。

  1. li=[int(x) for x in input().split(' ')]
  2. M=li[0]
  3. N=li[1]
  4. dic={}
  5. max=0
  6. maxc=None
  7. for i in range(N):
  8. li = input().split(' ')
  9. for c in li:
  10. if c in dic:
  11. dic[c]+=1
  12. if max< dic[c]:
  13. max=dic[c]
  14. maxc=c
  15. else:
  16. dic[c]=1
  17. if max< dic[c]:
  18. max=dic[c]
  19. maxc=c
  20. print (maxc)

结果

发表评论

表情:
评论列表 (有 0 条评论,227人围观)

还没有评论,来说两句吧...

相关阅读

    相关 1054. 求平均值 (20)

    本题的基本要求非常简单:给定N个实数,计算它们的平均值。但复杂的是有些输入数据可能是非法的。一个“合法”的输入是\[-1000,1000\]区间内的实数,并且最多精确到小数点后