Hdu4405 Aeroplane chess 数论

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<vector>

using namespace std;

#define REP(i, a, b) for(int i = (a), _end_ = (b);i <= _end_; ++ i)

const int maxn = 100010;
const int INF = 1000000000;

int n, m;

double f[maxn];
int Map[maxn];

int main() {
    int x, y;
    while(scanf("%d%d", &n, &m) != EOF) {
        if((m + n) == 0)
            break;
        REP(i, 0, maxn)
            Map[i] = INF;
        REP(i, 1, m) {
            scanf("%d%d", &x, &y);  
            Map[x] = y; 
        }
        memset((f), 0, sizeof(f));
        for(int i = n - 1;i >= 0; -- i)     
            if(Map[i] == INF) {
                REP(j, 1, 6)
                    f[i] += f[i + j] / 6.0;
                f[i] += 1;
            }
            else
                f[i] = f[Map[i]];       
        printf("%.4lf\n", f[0]);
    }
    return 0;
}