๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
๐Ÿ“ ์•Œ๊ณ ๋ฆฌ์ฆ˜/Programmers

[PGS] Lv.0 (์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์ž…๋ฌธ) 4์ผ์ฐจ ๋ฌธ์ œ

by xxilliant 2023. 1. 16.
728x90
๋ฐ˜์‘ํ˜•

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

 

ํ”ผ์ž ๋‚˜๋ˆ  ๋จน๊ธฐ (1)

int solution(int n) {
    int answer = 0;
    for(int i=1; i<16; ++i){
        if(7*i >= n) return i;
    }
    return answer;
}

ํ”ผ์ž ๋‚˜๋ˆ  ๋จน๊ธฐ (2)

int solution(int n) {
    int answer = 0;
    for(int i=1; i<n*6; ++i){
        if((6*i) % n == 0) return i;
    }
    return answer;
}

ํ”ผ์ž ๋‚˜๋ˆ  ๋จน๊ธฐ (3)

int solution(int slice, int n) {
    for(int i=1; i<=(100/slice)+1; ++i){
        if(slice*i >= n) return i;
    }
    return 0;
}

๋ฐฐ์—ด์˜ ํ‰๊ท ๊ฐ’

double solution(vector<int> numbers) {
    double answer = 0;
    double sum = 0;
    for(int i=0; i<numbers.size(); ++i){
        sum += numbers[i];
    }
    answer = sum / numbers.size();
    return answer;
}

.

728x90
๋ฐ˜์‘ํ˜•