zoukankan      html  css  js  c++  java
  • How Many Tables

    Description

    Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.
    One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.
    For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.
     

    Input

    The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.
     

    Output

    For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
     

    Sample Input

    2 5 3 1 2 2 3 4 5 5 1 2 5
     

    Sample Output

    2 4
     
     
    View Code
     1 #include<stdio.h>
    2 #include<stdlib.h>
    3 #include<string.h>
    4 int num[1005];
    5 int find( int x )
    6 {
    7 return num[x] == x ? num[x]: num[x]=find(num[x]);
    8 }
    9 void merge( int x, int y )
    10 {
    11 int fx, fy;
    12 fx = find( x );
    13 fy = find( y );
    14 if( fx != fy )
    15 num[fx] = fy;
    16 }
    17 int main()
    18 {
    19 int n, x, y, count, a, b,i;
    20 scanf( "%d", &n );
    21 while( n-- )
    22 {
    23 scanf( "%d%d", &x, &y );
    24 for( i = 1; i <= x; i++ )
    25 num[i] = i;
    26 for( int j = 1; j <= y; j++ )
    27 {
    28 scanf( "%d%d", &a, &b );
    29 merge( a, b );
    30 }
    31 for( count = 0, i = 1; i <= x; i++ )
    32 if( num[i] == i )
    33 count++;
    34 printf( "%d\n", count );
    35 }
    36
    37 }
  • 相关阅读:
    Android配置----adb工具的使用
    Android配置----小米手机通过wifi连接ADB调试Android应用
    Java语法基础(二)----运算符
    Java语法基础(一)----关键字、标识符、常量、变量
    Java学习----Java概述
    nginx配置upstream实现负载均衡
    docker挂载本地目录和数据卷容器
    sublime text 3 配置优化
    sql update set使用case when语句
    mysql表复制create table like和create table as比较
  • 原文地址:https://www.cnblogs.com/zsj576637357/p/2389230.html
Copyright © 2011-2022 走看看