#include <iostream> using namespace std; int main() { int row, column = 0; long int elem_now, elem_next = 0; std::cin >> row >> column; for (int i_r = 0; i_r <= row - 1;i_r++) { for (int i_c = 0;i_c <= column - 1; i_c++ ) { std::cin >> elem_now; elem_next += elem_now; } } std::cout << elem_next << std::endl; }
package main import ( "fmt" ) func main() { var n, m int fmt.Scan(&n, &m) // 读取矩阵的行数和列数 var sum int64 = 0 // 使用 int64 存储累加和,避免溢出 for i := 0; i < n; i++ { for j := 0; j < m; j++ { var num int fmt.Scan(&num) // 读取矩阵中的每个元素 sum += int64(num) // 将元素累加到总和中 } } fmt.Println(sum) // 输出最终的累加和 }
import java.util.Scanner; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n,m; long sum; n = 0; m = 0; sum = 0; if(in.hasNextInt()){ n = in.nextInt(); } if(in.hasNextInt()){ m = in.nextInt(); } int i = n*m; while(0 < i--){ if(in.hasNextInt()){ sum = sum + in.nextInt(); } } System.out.println(sum); in.close(); } }
#include <iostream> #include <vector> using namespace std; int main() { long long n,m; cin>>n>>m; vector<vector<long long>> a(n,vector<long long>(m,0)); for(long long i=0;i<n;i++){ for(long long j=0;j<m;j++){ cin>>a[i][j]; } } long long count=0; for(long long i=0;i<n;i++){ for(long long j=0;j<m;j++){ count+=a[i][j]; } } cout<<count<<endl; return 0; } // 64 位输出请用 printf("%lld")