View Code of Problem 124

import java.util.*;
class teem{
	int self;
	int point=0;
}
public class Main {
	 public static void main(String[] args) {
		 Scanner in = new Scanner(System.in);
		 int t = in.nextInt();
		 for(int i =0;i<t;i++) {
			 int n=in.nextInt();
			 int m=in.nextInt();
			 int win = in.nextInt();
			 int equal= in.nextInt();
			 int lose = in.nextInt();
			 int[][] allmatch =new int[1000][2];
			 int count=0;
			 for(int j =0;j<n;j++) {
				 for(int l=j+1;l<n;l++) {
					 allmatch[count][0]=j;
					 allmatch[count][1]=l;
					 count++;
				 }
			 }
			 //System.out.println("Case #"+(i+1)+": "+getmaxandmin(n,m,AL,allmatch,win,equal,lose)[0]+" "+getmaxandmin(n,m,AL,allmatch,win,equal,lose)[1]);
 
		 }
	 }
	 public static int C(int m,int n) {
			double s=1; 
			for(int i =0;i<n;i++) {
				s=s*(m--)/(i+1);
			}
			return (int)s;
		}
	 public static int mininthree(int a,int b,int c) {
		 int temp = a<b?a:b;
		 int max = temp<c?temp:c;
		 return max;
	 }
	 public static int maxinthree(int a,int b,int c) {
		 int temp = a>b?a:b;
		 int max = temp>c?temp:c;
		 return max;
	 }
}