[프로그래머스] 1레벨 문제

행렬의 덧셈

https://school.programmers.co.kr/learn/courses/30/lessons/12950

프로그래머스

#include <string>
#include <vector>

using namespace std;

vector<vector<int>> solution(vector<vector<int>> arr1, vector<vector<int>> arr2) 
{
    vector<vector<int>> answer;
    
    answer.reserve(arr1.size());
    
    for(int i = 0; i < arr1.size(); ++i)
    {
        vector<int> tempArr;
        tempArr.reserve(arr1[i].size());
        
        for(int j = 0; j < arr1[i].size(); ++j)
        {
            tempArr.push_back(arr1[i][j] + arr2[i][j]);
        }
        
        answer.push_back(tempArr);
    }
    
    
    return answer;
}

 

하샤드 수

https://school.programmers.co.kr/learn/courses/30/lessons/12947

프로그래머스

#include <string>
#include <vector>

using namespace std;

bool solution(int x) 
{
    string strText = to_string(x);
    
    int iNum(0);
    for(int i = 0; i < strText.size(); ++i)
    {
        iNum += strText[i] - 48;
    }
    
    if(x % iNum == 0)
    {
        return true;
    }
    
    return false;
}