1869.cpp

来自「杭电 acm部分代码 有兴趣的可以下载 谢谢」· C++ 代码 · 共 41 行

#include<stdio.h>
int dist[110][110];
const int maxint = 0xffffff;
int main()
{
    int n, m, i, j, k, a, b, flag;
    while(scanf("%d %d", &n, &m) == 2)
    {
        for(i = 0; i < n; i++)
            for(j = 0; j < n; j++)
                dist[i][j] = maxint;
        while(m--)
        {
            scanf("%d %d", &a, &b);
            dist[a][b] = 1;
            dist[b][a] = 1;
        }
        for(k = 0; k < n; k++)
            for(i = 0; i < n; i++)
                for(j = i + 1; j < n; j++)
                    if(k != i && k != j && i != j && dist[i][j] > dist[i][k] + dist[k][j])
                    {
                        dist[i][j] = dist[i][k] + dist[k][j];
                        dist[j][i] = dist[i][j];
                    }
        flag = 0;
        for(i = 0; i < n; i++)
            for(j = i + 1; j < n; j++)
                if(i != j && dist[i][j] > 7)
                {
                    flag = 1;
                    break;
                }
        if(flag == 1)
            printf("No\n");
        else
            printf("Yes\n");
    }
    return 0;
}