PAT A1011 World Cup Betting(20)

AC代码
#include <cstdio>

#include <algorithm>

const int max_n = 3;

using namespace std;

/*

struct Bet {

    double W, T, L

}bet[3];

void init() {

    for(int i = 0; i < max_n; i++) {

        bet[i].W = bet[i].T = bet[i].L = 0.0;

    }

}

*/

int main() {

    #ifdef ONLINE_JUDGE

    #else

        freopen("1.txt", "r", stdin);

    #endif // ONLINE_JUDGE

    char str[] = {'W', 'T', 'L'};

    int str_record[3] = {0};

    double max_record[3] = {0.0};

    for(int i = 0; i < max_n; i++) {

        double W = 0.0, T = 0.0, L = 0.0;

        scanf("%lf%lf%lf", &W, &T, &L);

        max_record[i] = (W>T)?(W>L?W:L):(T>L?T:L); //通过三元运算符比较大小

        //printf("max_record[%d]:%lf\n", i, max_record[i]);

        double temp = max_record[i];

        //printf("temp:%lf\n", temp);

        int j = temp==W?0:(temp==T?1:(temp==L?2:-1));//通过三元运算符确定哪个概率最大

        //printf("num:%d\n", j);

        str_record[i] = j;

        max_record[i] = temp;

    }

    for(int i = 0; i < max_n; i++) {

        printf("%c ", str[str_record[i]]);

    }

    double result = 0.0;

    result = (max_record[0] * max_record[1] * max_record[2] * 0.65 - 1) * 2;//

    printf("%.2f", result);

    return 0;

}
巴特西

PAT A1011 World Cup Betting(20)

最新文章

热门文章
