UVA_10903_Rock_Paper_Scissor_Tournament

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;
int n,k; map<int,ii> mp;

char cd1[10];char cd2[10];
void victoria(int p1,int p2){
   if((cd1[0]=='r' && cd2[0]=='s') || (cd1[0]=='s' && cd2[0]=='p') || (cd1[0]=='p' && cd2[0]=='r')){
    if (mp.count(p1)!=0){
        (mp[p1].first)++;(mp[p1].second)++;
    } else{
        mp[p1].first=1;
        mp[p1].second=1;

     }
      if (mp.count(p2)!=0){
         (mp[p2].second)++;
        }else{
        mp[p2].second=1;mp[p2].first=0;
       }

    }else if((cd2[0]=='r' && cd1[0]=='s') || (cd2[0]=='s' && cd1[0]=='p') || (cd2[0]=='p' && cd1[0]=='r')){
        if (mp.count(p2)!=0){
        (mp[p2].first)++;(mp[p2].second)++;
        }else{
        mp[p2].first=1;
        mp[p2].second=1;

        }
        if (mp.count(p1)!=0){
         (mp[p1].second)++;
       } else{
        mp[p1].second=1;mp[p1].first=0;

      }
    }else{/*empate*/
      return;

    }
}


int main() {
    int p1,p2;
    int cont=1;
    while(scanf("%d",&n)){
        if(n==0) break;
        if(cont>1) printf("\n");
        scanf("%d",&k);
        int aux=((k)*(n-1)*(n))/2;
        for(int i=0;i<aux;i++){
            scanf("%d %s %d %s",&p1,&cd1,&p2,&cd2);
            victoria(p1,p2);
        }
       map<int,ii> ::iterator it;
       for(int i=1;i<=n;i++){
         if(mp.count(i)!=0){
            double aux=(double)(mp[i].first)/(double)(mp[i].second);
            printf("%.3lf\n",aux);
         }else{
            printf("-\n");
         }
       }
       mp.clear();cont++;

    }
    return 0;
}