import java.io.*;
import java.util.*;
public class Solution {
private final static Scanner scanner = new Scanner(System.in);
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
int testcase;
int nnodes;
int nedges;
int startnode;
int x,y;
testcase = scanner.nextInt();
System.out.println(testcase);
if(testcase<1 data-blogger-escaped-testcase="">20)
System.exit(0);
int[][] arrayval = new int[1000][3];
//Input
for(int i=0;i1000)
System.exit(0);
System.out.println(nnodes);
nedges = scanner.nextInt();
if(nedges<1 data-blogger-escaped-nedges="">((nnodes*(nnodes-1))/2))
System.exit(0);
for(int j=0;jnnodes)
System.exit(0);
y = scanner.nextInt();
if(y<1 data-blogger-escaped-y="">nnodes)
System.exit(0);
arrayval[j][1] = x;
arrayval[j][2] = y;
}
//Edges
startnode = scanner.nextInt();
if(startnode<1 data-blogger-escaped-startnode="">nnodes)
System.exit(0);
}
}
}
Saturday, October 24, 2015
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment