C :

#include <stdio.h>
void main()
{
  int m,n,a[36],sum,i,j;
  scanf("%d%d",&m,&n);
  for(i=0;i<m*n;i++)
    scanf("%d",&a[i]);
  for(i=0;i<m;i++)
  {
    sum=0;
    for(j=i*n;j<(i+1)*n;j++)sum+=a[j];
    printf("第%d行元素之和为%d\n",i+1,sum);
  } 
}

C++ :

#include<iostream>
using namespace std;
int main()
{
  int a,b;
  cin>>a>>b;
  for(int i=0;i<a;i++){
    int sum=0,t;
    for(int j=0;j<b;j++){
      cin>>t;sum+=t;
    }
    cout<<"第"<<i+1<<"行元素之和为"<<sum<<endl;
  }
  return 0;
}

Pascal :

var i,j,n,m:integer;a:array[1..10,1..10]of integer;x:array[1..1000]of integer;
begin
 read(n,m);
 for i:=1 to n do begin for j:=1 to m do read(a[i,j]);readln;end;
 for i:=1 to n do for j:=1 to m do x[i]:=x[i]+a[i,j];
 for i:=1 to n do writeln('第',i,'行元素之和为',x[i]);
end.

Java :

import java.util.Scanner;

public class Main {
    private static Scanner s = new Scanner(System.in) ;
    
    public static void main(String[] args) {
		int m = s.nextInt() ;
		int n = s.nextInt() ;
		
		if(1<=m&&m<=6&&1<=n&&n<=6){
		int a[][] = new int[m][n]; 
			for (int i = 0; i < m; i++) {
				for (int j = 0; j < n; j++) {
					a[i][j] = s.nextInt() ;
				}
			}
		for (int i = 0; i < a.length; i++) {
			int sum = 0 ;
			for (int j = 0; j < a[i].length; j++) {
				sum+=a[i][j] ;
			}
			System.out.println("第"+(i+1)+"行元素之和为"+sum);
		}
		}
	}
}