HDU - 2841 Visible Trees （容斥原理）

#include<bits/stdc++.h> using namespace std; typedef long long ll; ll prim[100005], lenp = 0, isprim[100005] = {0}; ll data[100005], lend; ll n, m, t, ans; void getprim() { ll i, j, k; for(i =

>>阅读原文<<