static void input2DArr(out int[,] arr)
Console.Write("Nhap n cua mang n x m: ");
int n = Int32.Parse(Console.ReadLine());
Console.Write("Nhap m cua mang n x m: ");
int m = Int32.Parse(Console.ReadLine());
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
Console.Write("Nhap phan tu [{0},{1}] cua mang: ", i, j);
arr[i,j] = Int32.Parse(Console.ReadLine());
static bool isPrime(int num)
if (num < 2) return false;
for (int i = 2; i*i <= num; i++)
static int counPrime(int[,] arr)
for (int i = 0; i < arr.GetLength(0); i++)
for (int j = 0; j < arr.GetLength(1); j++)
static void output2DArr(int[,] arr)
for (int i = 0; i < arr.GetLength(0); i++)
for (int j = 0; j < arr.GetLength(1); j++)
Console.Write(arr[i,j] + " ");
static void output1DArr(int[] arr)
for (int i = 0; i < arr.GetLength(0); i++)
Console.Write(arr[i] + " ");
static int[] SumRow2DArr(int[,] arr)
int[] res = new int[arr.GetLength(0)];
for (int i = 0; i < arr.GetLength(0); i++)
for (int j = 0; j < arr.GetLength(1); j++)
public static void Main()
int[] SumRow2Darr = SumRow2DArr(arr);
output1DArr(SumRow2Darr);