fork download
  1. #include<stdio.h>
  2. #include<math.h>
  3.  
  4. long long dist(int, int, int, int);
  5.  
  6. int main()
  7. {
  8. int N, x1, x2, x3, y1, y2, y3, count=0;
  9. long long side1, side2, side3;
  10.  
  11. scanf("%d",&N);
  12.  
  13. while(N--)
  14. {
  15. scanf("%d %d %d %d %d %d",&x1,&y1,&x2,&y2,&x3,&y3);
  16.  
  17. side1 = dist(x1, y1, x2, y2);
  18. side2 = dist(x2, y2, x3, y3);
  19. side3 = dist(x3, y3, x1, y1);
  20.  
  21. if(side1>side2 && side1>side3)
  22. {
  23. if( side1 == side2+side3 )
  24. count++;
  25. }
  26.  
  27. else if(side2>side3 && side2>side1)
  28. {
  29. if( side2 == side1+side3 )
  30. count++;
  31. }
  32.  
  33. else if(side3>side1 && side3>side2)
  34. {
  35. if( side3 == side1+side2 )
  36. count++;
  37. }
  38. }
  39.  
  40. printf("%d\n",count);
  41.  
  42. return 0;
  43. }
  44.  
  45. long long dist(int X1, int Y1, int X2, int Y2)
  46. {
  47. return(((X1-X2)*(X1-X2)+(Y1-Y2)*(Y1-Y2)));
  48. }
Success #stdin #stdout 0s 3300KB
stdin
1
0 0 0 2 2 0
stdout
1