Day3

[Day3]

1. 백설 공주와 일곱 난쟁이

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

#include <iostream>
using namespace std;

int main(int argc, const char * argv[]) {
    int input[9];
    int sum = 0;
    int fa1=0;
    int fa2=0;
    for(int i=0; i<9; i++){
        cin >> input[i];
    }
    for(int i=0; i<9; i++){
        sum += input[i];
    }
    for(int i=0; i<8; i++){
        for(int j=0; j<9; j++){
            if(j!=i){
                if(sum-input[i]-input[j]==100){
                    fa1 = i;
                    fa2 = j;
                    break;
                }
            }
        }
    }
    for(int i=0; i<9; i++){
        if(i!=fa1 && i!=fa2){
            cout << input[i] << "\n";
        }
    }
    return 0;
}

2. 삼각 김밥

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

#include <iostream>
using namespace std;

int main(int argc, const char * argv[]) {
    float gram, payment;
    float min;
    cin >> payment >> gram;
    min = payment/gram*1000;
    int count;
    cin >> count;
    for(int i=0; i<count; i++){
        cin >> payment >> gram;
        if(payment/gram*1000 <= min){
            min =payment/gram*1000;
        }
    }
    printf("%.2f",min);
    return 0;
}

3. 고득점

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

#include <iostream>
using namespace std;

int main(int argc, const char * argv[]) {
    int count;
    cin >> count;

    for(int i=0; i<count; i++){
        string input;
        cin >> input;

        int result=0;
        int max = 2e9;
        int right, left, temp=0;

        for(int j=0; j<input.size(); j++){
            result += min(input[j]-'A', 'Z'-input[j]+1);
        }
        for (int i = 0, j; i < input.size(); i++) {
            for (j = i + 1; j < input.size() && input[j] == 'A'; j++);
            if (input[i] == 'A' && j == input.size() + 1) break;
            right = i * 2 + input.size() - j;
            left = i + (input.size() - j) * 2;
            temp = min(left, right);
            max = min(temp, max);
        }
        cout << result+max << "\n";
    }
    return 0;
}