프로그래머스 카펫

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

프로그래머스

#include <string>
#include <vector>
#include<cmath>
#include<iostream>
using namespace std;
struct ySqure{
    int width;
    int height;
};

vector<int> solution(int brown, int yellow) {
    vector<int> answer;
    //노랑의 경우의수를 전부 구해야함
    //즉 가로>=세로
    vector<ySqure>ysqure;
    int h=1;
    int w=yellow;
    for(int i=1;i<=yellow;i++){
        ySqure tmp;
        if(yellow%i==0){
            
           w=yellow/i;
           tmp.width=yellow/i+2;
           
           
           if(i==1){
              h=1;
              tmp.height=h+2;
           }else{
              h=i;
              tmp.height=h+2;
           }
 
            if(tmp.width<tmp.height){
              break;
            }
           ysqure.push_back(tmp); 
        }
     
    }
    //갈색
    for(int i=0;i<ysqure.size();i++){
        if(brown==(ysqure[i].width)*2+(ysqure[i].height-2)*2){
            answer.push_back(ysqure[i].width);
            answer.push_back(ysqure[i].height);
        }
    }
   
    return answer;
}