答案:<pre class="brush:cpp;toolbar:false">//参考代码1 C++
#include <iostream>
using namespace std;
const int N = 510;
int n, m;
int way[N][N];
int cnt[N], st, en;
bool st1[N], flag = false;
void dfs(int u) {
if (u == en) {
cnt[en] ++;
return;
}
if (way[u][0] == 0) flag = true;
for (int i = 1; i <= way[u][0]; i ++ ) {
int j = way[u][i];
if (!st1[j]) {
dfs(j);
st1[j] = true;
}
cnt[u] += cnt[j];
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i ++ ) {
int a, b;
cin >> a >> b;
way[a][0] ++;
way[a][way[a][0]] = b;
}
cin >> st >> en;
dfs(st);
if (flag) cout << cnt[st] << " No";
else cout << cnt[st] << " Yes";
}</pre><pre class="brush:cpp;toolbar:false">//参考代码2 C语言
#include <stdio.h>
#include <stdlib.h>
#define MAX_NODES 502
int N, M, S1, S2, A, B, consistency, laneNum[MAX_NODES];
int Edge[MAX_NODES][MAX_NODES];
int dfs(int index) {
if (laneNum[index] != 0) return laneNum[index];
for (int i = 0; i < MAX_NODES; i++) {
if (Edge[index][i] != 0) {
if (laneNum[i] == 0) dfs(i);
laneNum[index] += laneNum[i];
}
}
if (laneNum[index] == 0) consistency = 1;
return laneNum[index];
}
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < M; ++i) {
scanf("%d %d", &S1, &S2);
Edge[S1][S2] = 1;
}
scanf("%d %d", &A, &B);
laneNum[B] = 1;
dfs(A);
printf("%d %s", laneNum[A], (consistency ? "No" : "Yes"));
return 0;
}</pre>
这道题暂未补解析。