백준 8949번: 대충 더해

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
 
#define c_reverse(s) reverse(s.begin(), s.end())
 
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int a,b; cin >> a >> b;
 
    vector<int> arr;
    while(true) {
        if (a == 0 && b == 0) {
            break;
        }
 
        int cand = a % 10 + b % 10;
        arr.push_back(cand);
        a /= 10;
        b /= 10;
    }
 
    c_reverse(arr);
    print_vector(arr);
 
    return 0; 
}