fork download
  1.  
  2. import java.util.*;
  3. import java.lang.*;
  4. import java.io.*;
  5.  
  6. class Ideone
  7. {
  8. public static void main (String[] args) throws java.lang.Exception
  9. {
  10. Scanner sc= new Scanner(System.in);
  11. int t= sc.nextInt();
  12. for(int i=0;i<t;i++){
  13. int a=sc.nextInt();
  14. int b=sc.nextInt();
  15. int kingx=sc.nextInt();
  16. int kingy=sc.nextInt();
  17. int queenx=sc.nextInt();
  18. int queeny=sc.nextInt();
  19. HashSet<String> attackOnKing = new HashSet<>();
  20. HashSet<String> attackOnQueen = new HashSet<>();
  21.  
  22. int [][] arr = {{a,b},{-a,b},{a,-b},{-a,-b},
  23. {b,a},{-b,a},{b,-a},{-b,-a}
  24. };
  25. for(int j=0;j<arr.length;j++){
  26. int x=arr[j][0];
  27. int y=arr[j][1];
  28. String kingPosition = Integer.toString(kingx+x)+","+Integer.toString(kingy+y);
  29. String queenPosition = Integer.toString(queenx+x)+","+Integer.toString(queeny+y);
  30. attackOnKing.add(kingPosition);
  31. attackOnQueen.add(queenPosition);
  32. }
  33. int knightPosition = 0;
  34. for(String j:attackOnQueen){
  35. if(attackOnKing.contains(j)){
  36. knightPosition = knightPosition+1;
  37. }
  38. }
  39. System.out.println(knightPosition);
  40. }
  41. }
  42. }
Success #stdin #stdout 0.23s 58836KB
stdin
4
2 1
0 0
3 3
1 1
3 1
1 3
4 4
0 0
8 0
4 2
1 4
3 4
stdout
2
1
2
0