

import java.util.Scanner;
public class Main
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
while(N-- > 0)
{
int nodenum = sc.nextInt();
int sidenum = sc.nextInt();
boolean nodes[][] = new boolean[nodenum][nodenum];
while(sidenum-- > 0)
{
int i = sc.nextInt() - 1;

最低0.47元/天 解锁文章
1036

被折叠的 条评论
为什么被折叠?



