main.cpp

来自「If a tree falls in the forest, and there」· C++ 代码 · 共 49 行

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
    int i,j,p,t;
    int d[100][100];
    int sum;
    char s[3];
    while(scanf("%d %d",&p,&t)!=EOF)
    {
        gets(s);//过滤每行最后的回车
        memset(d,0,100*100*sizeof(int));
        sum=p;
        while(gets(s)&&s[0])
        {
                sscanf(s,"%d %d",&i,&j);
                d[i][j]=1;
        }
        for(int i=1;i<p;i++)
        {
                if(d[i][0]!=0)continue;
                else{
                     d[i][0]=1;
                   for(int k=i+1;k<=p;k++)
                   {
                       if(d[k][0]!=0)continue;
                       else{

                                for(int m=1;m<=t;m++)
                                {

                                    if(d[i][m]!=d[k][m])break;
                                    else if(m==t){sum-=1;d[k][0]=1;}

                                }
                       }
                   }
                }

        }
        cout<<sum<<endl;
    }

    system("pasue");
    return 0;
}