Submission #230648

---

Source Code Expand

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

int search(int* ar,int cnt,int tr) {
	for(int i=0;i<cnt;i++) {
		if (ar[i]==tr) return i;
	}
	return -1;
}

typedef struct {
	int number;
	int *connections;
	int cc;
} node;

node *nodes;

int dist(node n,int from,int to) {
	if (search(n.connections,n.cc,to)!=-1) {
		return 1;
	} else {
		for(int i=0;i<n.cc;i++) {
			if (n.connections[i]==from) continue;
			int d=dist(nodes[n.connections[i]],n.number,to);
			if (d!=-1) return d+1;
		}
	}
	return -1;
}

int main(void) {
	int v;
	scanf("%d",&v);
	nodes=(node*)malloc(sizeof(node)*v);
	for(int i=0;i<v;i++) {
		nodes[i].number=i;
		nodes[i].cc=0;
		nodes[i].connections=(int*)malloc(sizeof(int)*v);
	}
	int ls[2];
	for(int i=0;i<(v-1);i++) {
		scanf("%d %d",ls,ls+1);
		nodes[ls[0]-1].connections[nodes[ls[0]-1].cc]=ls[1]-1;
		nodes[ls[0]-1].cc++;
		nodes[ls[1]-1].connections[nodes[ls[1]-1].cc]=ls[0]-1;
		nodes[ls[1]-1].cc++;
	}
	int rc;
	scanf("%d",&rc);
	int *rets=(int*)malloc(sizeof(int)*rc);
	for(int i=0;i<rc;i++) {
		scanf("%d %d",ls,ls+1);
		rets[i]=dist(nodes[ls[0]-1],nodes[ls[0]-1].number,ls[1]-1)+1;
	}
	for(int i=0;i<rc;i++) {
		printf("%d\n",rets[i]);
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:43:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:50:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:53:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result