UVa 10903 - Rock-Paper-Scissors Tournament

题目

n个人玩剪刀石头布游戏，求每个人赢的概率。

分析

概率为：w/(w+l)

说明

又是太久没刷题了

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int w_count[101];
int l_count[101];
int judger[3][3] = {0, -1, 1,  1, 0, -1,  -1, 1, 0};
int get_id(char buf[])
{
    if (!strcmp(buf, "rock")) {
        return 0;
    }else if (!strcmp(buf, "paper")) {
        return 1;
    }else if (!strcmp(buf, "scissors")) {
        return 2;
    }
    return -1;
}

int main()
{
    int  n, k, p1, p2, m1, m2, cases = 0;
    char buf[10];
    while (~scanf("%d", &n) && n) {
        if (cases ++) {
            printf("\n");
        }

        for (int i = 1; i <= n; ++ i) {
            w_count[i] = 0;
            l_count[i] = 0;
        }

        scanf("%d", &k);
        int t = k*n*(n-1)/2;
        int size = 0;
        for (int i = 1; i <= t; ++ i) {
            scanf("%d%s", &p1, buf);
            m1 = get_id(buf);
            scanf("%d%s", &p2, buf);
            m2 = get_id(buf);
            if (judger[m1][m2] == 1) {
                w_count[p1] ++;
                l_count[p2] ++;
            }else if (judger[m1][m2] == -1) {
                w_count[p2] ++;
                l_count[p1] ++;

            }
        }

        for (int i = 1; i <= n; ++ i) {
            if (!w_count[i] && !l_count[i]) {
                printf("-\n");
            }else {
                printf("%.3lf\n", (w_count[i]+0.0)/(w_count[i]+l_count[i]));
            }
        }
    }

    return 0;
}