W's Blog W's Blog

입사문제

• 치킨배달

  백준알고리즘 2019. 8. 2. 20:09

  #include #include #include #include using namespace std; int map[50][50]; int ans = 100000; int n, m; vector chick; vector home; void go(){ vector permu; for(int i = 0; i < chick.size(); i++){ if(i < m) permu.push_back(1); else permu.push_back(0); } do{ int sumna = 0; for(int i = 0; i < home.size(); i++){ int s = 10000; for(int j = 0; j < chick.size(); j++){ if(permu[j] == 1){ int temp = abs(hom..

  Read More
• 경사로

  백준알고리즘 2019. 8. 2. 20:08

  #include #include using namespace std; int n, m; int map[100][100]; bool d[100]; int main() { cin>>n>>m; for (int i = 0; i >map[i][j]; } } bool pan = true; int sum = 0; for(int i = 0; i 1) { pan=fals..

  Read More