Submission #1686051

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;

int n;
vector<int> g[100005];
ll MOD = 1000000007, dp[100005][2];

void dfs(int cur, int pre) {
	FOR(i, g[cur].size()) {
		int x = g[cur][i];
		if (x != pre) {
			dfs(x, cur);
			dp[cur][0] = (dp[cur][0] * (dp[x][0] + dp[x][1])) % MOD;
			dp[cur][1] = (dp[cur][1] * dp[x][0]) % MOD;
		}
	}
}

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n;
	FOR(i, n-1) {
		int u, v;
		cin >> u >> v;
		g[u-1].push_back(v-1);
		g[v-1].push_back(u-1);
	}
	FOR(i, n) FOR(j, 2) dp[i][j] = 1;
	dfs(0, -1);
	cout << (dp[0][0]+dp[0][1])%MOD << endl;
	return 0;
}

Submission Info

Judge Result