20250715
#include <stdio.h>
#include <string.h>
int counter(int *arr);
void sort(int *arr, int n);
int dfs(int *arr, int r, int c, int start, int end);
int main()
{
//100,000
int arr[100][100] = {0}, n,m,start;
int u,v,j, max=100001;
scanf("%d %d %d", &n, &m, &start);
getchar();
for (int i=0; i<n; i++){
scanf("%d %d", &u,&v);
if (v>u) {
arr[u][counter(arr[u])] = v;
}
else {
arr[v][counter(arr[u])] = u;
}
if (u>max) {
max = u;
}
if (v>max) {
max = v;
}
}
for (int i=0; i<max; i++) {
if (arr[i] !=0 ) {
sort(arr[i], counter(arr[i]));
}
}
for (int i=1; i<=n; i++) {
dfs(arr,1,0,start,1)
}
for (int i=0; i<n; i++) {
for (j=0; j<n; j++) {
printf("%d ", arr[i][j]);
}
printf("\n");
}
return 0;
}
int dfs(int *arr, int r, int c) {
printf("Test");
}
void sort(int *arr, int n) {
int temp;
for (int i=0; i<n; i++) {
for (int j=i+1; j<n; j++) {
if (arr[i]>arr[j]) {
temp = arr[j];
arr[j] = arr[i];
arr[i] = temp;
}
}
}
}
int counter(int *arr) {
int j=0;
while (arr[j]!=0) {
j++;
}
return j;
}