C :

#include<stdio.h>

void main(){
	int a[100][100];
	int i,j,n,m,c=0,s=0;
	scanf("%d %d",&n,&m);
	
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			scanf("%d",&a[i][j]);
		}
	}
	
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			if(a[i][j]%2!=0){
				c++;
			}
			if(a[i][j]%2==0){
				s++;
			}
		}
	}
	
	printf("%d %d",c,s);
} 

C++ :

#include <bits/stdc++.h>
using namespace std;
int main(){
	int n,m,a[110][110],x = 0,y = 0;
	int i,j;
	cin>>n>>m;
	for(i = 0;i < n;i++){
		for(j = 0;j < m;j++){
			cin>>a[i][j];
			if(a[i][j] % 2 != 0){
				x++;
			}else{
				y++;
			}
		}
	}
	cout<<x<<" "<<y<<endl;
	
	
}

Pascal :

var a:array[1..1000,1..1000] of longint;
x,y,i,j,m,n:longint;
begin
read(m,n);
for i:=1 to m do
for j:=1 to n do
begin
read(a[i,j]);
if a[i,j] mod 2=1 then inc(x)
else inc(y);
end;
write(x,' ',y);
end.

Java :

import java.util.*;
public class Main
{
    public static void main(String[] args){ 
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt(); 
        int[][] a = new int[n][m];
        for(int i = 0;i < n;i++){
            for(int j = 0;j <m;j++){
            	a[i][j]=sc.nextInt();
            }          	
        }
        int x=0;
        int y=0;
        for(int i = 0;i < n;i++){
           for(int j = 0;j <m;j++){
        	  if(a[i][j]%2==0) {
        		  y++;
        	  }else {
        		  x++;
        	  }
           }    
        }
        System.out.print(x+" "+y);
    }
}

Python :

n,m=list(map(int,input().split()))
a=list()
for i in range(n):
    a.append(list(map(int,input().split())))

js,os=0,0

for i in range(n):
    for j in range(m):
        if a[i][j]%2==1:
            js=js+1
        else:
            os=os+1
    
print(js,os)