POJ3660（Floyd最短路）

反思：出现了一些奇怪的问题。所得经验就是，能直接在循环里加，能在循环中直接break的，就不要用flag变量再做指示了。

#include <iostream>
#include <queue>
#include <cstdio>
#include <map>
#include <cstring>
#include <stack>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

const int INF = 1 << 30;
const int maxn = 110;

int n, m;
int dis[maxn][maxn];

void Init()
{
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            dis[i][j] = INF;
            if (i == j) dis[i][j] = 1;
        }
    }
}

void Floyd()
{
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (dis[i][k] != INF && dis[k][j] != INF && dis[i][j] > dis[i][k] + dis[k][j]) {
                    dis[i][j] = dis[i][k] + dis[k][j];
                }
            }
        }
    }
}

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    #endif // ONLINE_JUDGE
    scanf ("%d%d", &n, &m);
    Init ();
    for (int i = 0; i < m; i++) {
        int a, b;
        scanf ("%d%d", &a, &b);
        dis[a][b] = 1;
    }
    Floyd ();
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            if (dis[i][j] == INF && dis[j][i] == INF) {
                cnt++;
                break;
            }
        }
    }
    printf ("%d\n", n - cnt);
    return 0;
}