托米的游戏-概率dp

https://ac.nowcoder.com/acm/problem/16765

#include <bits/stdc++.h>
#define ll long long
#define pir pair<int,int>
const int N = 1e6+7;
const int mod = 998244353;
const ll ds = 1e15;
const double eps = 1e-8;

using namespace std;

vector<int>a[N];
int deep[N];
ll ans = 0;
void dfs(int s,int f){
    for(int i = 0; i < a[s].size(); i++){
        int v = a[s][i];
        if(v == f) continue;
        deep[v] = deep[s]+1;
        dfs(v,s);
    }
}

ll qpow(ll x,ll y){
    ll res = 1;
    while(y){
        if(y&1) res = res*x%mod;
        y >>= 1;
        x = x*x%mod;
    }
    return res;
}

void solve(){  
    int n,u,v;
    cin >> n;
    for(int i = 1; i < n; i++){
        cin >> u >> v;
        a[u].push_back(v);
        a[v].push_back(u);
    }
    deep[1] = 1;
    dfs(1,0);
    for(int i = 1; i <= n; i++){
        ans = (ans+qpow(deep[i],mod-2))%mod;
    }
    cout << ans;
}
int main(){
    // int t;
    // cin >> t;
    // while(t--)
        solve();
    //system("pause");
    return 0;
}