Day5

[Day5]

1. 손익분기점

문제 링크: https://www.acmicpc.net/problem/1712https://leetcode.com/problems/merge-sorted-array/)

#include <iostream>
using namespace std;

int main(int argc, const char * argv[]) {
    int a, b, c;
    cin >> a >> b >> c;
    if(b>=c){
        cout << -1;
    }
    else{
        cout << a/(c-b)+1;
    }
    return 0;
}

2. ACM 호텔

문제 링크: https://www.acmicpc.net/problem/10250

#include <iostream>
using namespace std;

int main(int argc, const char * argv[]) {
    int count;
    cin >> count;
    int i=1;
    while(i<=count){
        int h, w, p;
        cin >> h >> w >> p;
        int x, y;
        y = p%h;
        if(y==0){
            y = h;
        }
        x = p/h+1;
        if(p%h==0){
            x-=1;
        }
        cout << y*100+x << "\n";
        i++;
    }
    return 0;
}

3. 부녀회장이 될테야

문제 링크: https://www.acmicpc.net/problem/2775

#include <iostream>
using namespace std;

int people(int k, int n){
    if(k == 0){
        return n;
    }
    if(n == 1){
        return 1;
    }
    return(people(k-1, n)+people(k, n-1));
}

int main(int argc, const char * argv[]) {
    int count;
    cin >> count;
    int k, n;
    for(int i=0; i<count; i++){
        cin >> k >> n;
        cout << people(k, n) << "\n";
    }
    return 0;
}