题解 | 小红的矩阵

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int a, b;
    int n, m;
    cin >>n >> m ;
    int sum = 0;
    vector<vector<int> > A(n, vector<int>(m,0));

    int aij;
    for (int i=0; i<n; i++) {
        for (int j =0; j<m; j++) {
            cin >> aij ;
            A[i][j] = aij;
            sum += (aij%10 == 9)?1:0;
        }
    }
    cout << sum << endl;
    return 0;
}
// 64 位输出请用 printf("%lld")