백준 2738번: 행렬 덧셈

https://www.acmicpc.net/problem/2738

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int table_a[100][100];
    int table_b[100][100];
 
    int n, m; cin >> n >> m;
 
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) {
            cin >> table_a[i][j];
        }
    }
 
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) {
            cin >> table_b[i][j];
        }
    }
 
    for (int i=0; i<n; i++) {
        for (int j=0; j<m; j++) {
            cout << table_b[i][j] + table_a[i][j] << " ";
        }
        cout << CENDL;
    }
    return 0;
}