2018 Kakao Blind Recruitment - [1차] 비밀지도

코딩테스트 연습 - Level 1 - [1차] 비밀지도

https://programmers.co.kr/learn/courses/30/lessons/17681

#include <string>
#include <vector>

using namespace std;

vector<string> solution(int n, vector<int> arr1, vector<int> arr2) {
    vector<string> answer;
    for(int i=0;i<n;i++)
    {
        arr1[i]=arr1[i]|arr2[i];
        string str="";
        for(int j=0;j<n;j++)
        {
            if(arr1[i]%2==0)
            {
                str=" "+str;
            }
            
            else
            {
                str="#"+str;
            }
            arr1[i]=arr1[i]>>1;
        }
        answer.push_back(str);
    }
    return answer;
}