fork(2) download
  1. import java.awt.Point;
  2. import java.util.*;
  3.  
  4. class A_Triangle {
  5. public static void main(String[] args) throws Exception{
  6. Scanner scan = new Scanner(System.in);
  7. List<Point> list = new ArrayList<Point>();
  8. for(int i = 0; i < 3;++i){
  9. list.add(new Point(scan.nextInt(), scan.nextInt()));
  10. }
  11. if(f(list)){
  12. System.out.println("RIGHT");
  13. return ;
  14. }
  15. for(int i = 0; i < 3; ++i){
  16. Collections.rotate(list, 1);
  17. if(g(list)){
  18. System.out.println("ALMOST");
  19. return;
  20. }
  21. }
  22. System.out.println("NEITHER");
  23. }
  24. static boolean f(List<Point> list){
  25. int[]dist = new int[3];
  26. dist[0] = (int) list.get(0).distanceSq(list.get(1));
  27. dist[1] = (int) list.get(1).distanceSq(list.get(2));
  28. dist[2] = (int) list.get(2).distanceSq(list.get(0));
  29. Arrays.sort(dist);
  30. for(int d : dist){
  31. if(d==0){
  32. return false;
  33. }
  34. }
  35. return dist[2] == dist[0] + dist[1];
  36. }
  37. static boolean g(List<Point> list){
  38. Point point = list.get(0);
  39. point.translate(1, 0);
  40. if(f(list))
  41. return true;
  42. point.translate(-2, 0);
  43. if(f(list))
  44. return true;
  45. point.translate(1, 1);
  46. if(f(list))
  47. return true;
  48. point.translate(0, -2);
  49. if(f(list))
  50. return true;
  51. point.translate(0, 1);
  52. return false;
  53. }
  54. }
  55.  
Success #stdin #stdout 0.06s 213888KB
stdin
0 0 2 0 0 1
stdout
RIGHT