360在线笔试题:挑选镇长

来源:互联网 发布:windows找不到null文件 编辑:程序博客网 时间:2024/05/04 10:54

题目的描述如下所示:

输入输出要求如下:

#include <stdio.h>
#include <stdlib.h>


struct GX
{
int num1;//renshi ta de ren;
int num2;//ta renshi de ren;
};


int main(void)
{
int T;
int n,m;
int** guanxi;
int i;
int numOfZZ = 0;
struct GX *gx;


scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
guanxi = (int**)malloc(sizeof(int*)*m);
for (i = 0; i < m; i++)
guanxi[i] = (int*)malloc(sizeof(int)*2);


for (i = 0; i < m; i++)
{
scanf("%d%d",&guanxi[i][0],&guanxi[i][1]);
}


gx = (struct GX*)malloc(sizeof(struct GX)*(n+1));
for (i = 1; i < n+1; i++)
{
gx[i].num1 = 0;
gx[i].num2 = 0;
}


for (i = 0; i < m; i++)
{
if (guanxi[i][0] != guanxi[i][1])
{
gx[guanxi[i][1]].num1++;
gx[guanxi[i][0]].num2++;
}
}


numOfZZ = 0;
for (i = 1; i <= n; i++)
{
//ta renshi de renshu wei 0;
//renshi ta de ren wei n-1;
//ta keyi shi zhenzhang;
if (gx[i].num2 == 0 && gx[i].num1 == n-1)
numOfZZ++;
}


printf("%d\n",numOfZZ);
for (i = 1; i <= n; i++)
{
if (gx[i].num2 == 0 && gx[i].num1 == n-1)
printf("%d\n",i);
}
if (numOfZZ == 0)
printf("\n");


free(gx);
for (i = 0; i < m; i++)
free(guanxi[i]);
free(guanxi);
}


return 0;
}


0 0