PAT 1054. The Dominant Color (20)
2018-03-22 23:32
411 查看
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:
Sample Output:
24
用scanf!用scanf!用scanf!
#include <iostream>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
map<int,int> Map;
int max = -1;
int val;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
int s;
scanf("%d",&s);
Map[s]++;
if(Map[s] > max)
{
max = Map[s];
val = s;
}
}
}
cout<<val<<endl;
return 0;
}
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
用scanf!用scanf!用scanf!
#include <iostream>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
map<int,int> Map;
int max = -1;
int val;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
int s;
scanf("%d",&s);
Map[s]++;
if(Map[s] > max)
{
max = Map[s];
val = s;
}
}
}
cout<<val<<endl;
return 0;
}
相关文章推荐
- PAT (Advanced Level) 1054. The Dominant Color (20)
- PAT_A 1054. The Dominant Color (20)
- PAT (Advanced) 1054. The Dominant Color (20)
- PAT1054. The Dominant Color (20)
- PAT (Advanced Level) 1054. The Dominant Color (20) 找过半的数,一次遍历
- PAT 甲级 1054. The Dominant Color (20)
- 1054. The Dominant Color (20)【水题】——PAT (Advanced Level) Practise
- PAT 1054. The Dominant Color (20)(简单排序题(`vector<int>`利用`map<int,int>`来排序))
- PAT-A 1054. The Dominant Color (20)
- PAT 1054. The Dominant Color (20)
- PAT 1054. The Dominant Color (20)
- 【C++】PAT(advanced level)1054. The Dominant Color (20)
- PAT 1054. The Dominant Color (20)
- python实现pat 1054. The Dominant Color (20)
- PAT (Advanced) 1054. The Dominant Color (20)
- 【PAT甲级】1054. The Dominant Color (20)
- ZJU-PAT 1054. The Dominant Color (20) 浙大2013年上机复试第一题
- 【PAT】【Advanced Level】1054. The Dominant Color (20)
- PAT 1054. The Dominant Color (20)
- 浙江大学PAT_甲级_1054. The Dominant Color (20)