Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: VggT
Problemset: ความหลากหลาย
Language: cpp
Time: 0.003 second
Submitted On: 2025-10-17 11:13:40
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, count = 0;
cin >> n >> m;
vector<vector<int>> board(n,vector<int>(m));
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
cin >> board[i][j];
}
}
for(int i = 0; i <= n-5; i++)
{
for(int j = 0; j <= m-5; j++)
{
set<int> s;
for(int k = i; k < i+5; k++)
{
for(int l = j; l < j+5; l++)
{
s.insert(board[k][l]);
}
}
if(s.size() >= 5) count+=1;
}
}
cout << count;
return 0;
}