Solving for the number of mines

题目描述

In order to ensure that important military bases on the border will not be invaded by the enemy,Our army was buried on the way the enemy army must passx颗地雷,known this

The place to go isn * msquare shape,To let our friendly forces know where there are mines,Our military engineers drew one

Mine distribution map.in this distribution,If there are no mines at a certain point,Then the sum of the bits of the number marked by this point will be one

个偶数;Conversely, if the point has a mine,The sum of the bits of the number marked by this point is an odd number.

Please program it out,How many mines have been planted in the area in total.

比如：There is one below5 * 6mine distribution map,The areas in which the mines are buried are marked with a grey background,shared in this area

10颗地雷.

输入

输出

样例输入

5 6
12 35 90 21 1 9
91 3892 8749 342 3421 89
1881 1111 39 4 1 34
9 93 34 12 45 0
67 4 34 19 235 32

样例输出

16

参考代码：

#include<bits/stdc++.h>
using namespace std;
int n,m,a[105][105],s;
int f(int x){
    int k=0;
    while(x!=0){
        k+=x%10;
        x/=10;
    }
    return k%2;
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++){
            scanf("%d",&a[i][j]);
            if(f(a[i][j])==1)
                s++;
        }
    printf("%d",s);
    return 0;
}