提出 #71848394

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

const int N = 15;

int a[N][N], b[N << 3];

int main()
{
    int h, w, n;
    cin >> h >> w >> n;
    for (int i = 1; i <= h; ++i)
        for (int j = 1; j <= w; ++j)
            cin >> a[i][j];
    for (int i = 1; i <= n; ++i)
    {
        cin >> b[i];
    }
    int res = 0, t = 0;
    for (int i = 1; i <= h; ++i)
    {
        t = 0;
        for (int j = 1; j <= w; ++j)
        {
            for (int k = 1; k <= n; ++k)
            {
                if (a[i][j] == b[k])
                {
                    t++;
                    break;
                }
            }
        }
        res = max(res, t);
    }
    cout << res;
    return 0;
}

提出情報

ジャッジ結果