fork download
  1. // I. A sky full of stars
  2.  
  3. #include<bits/stdc++.h>
  4. using namespace std;
  5.  
  6. #define io ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  7.  
  8. void solve() {
  9. long long n;
  10. long double l, r;
  11. cin >> n >> l >> r;
  12. vector<pair<long long, long long>> v(n);
  13. for (int i = 0; i < n; ++i) {
  14. cin >> v[i].first >> v[i].second;
  15. }
  16. long long count = 0;
  17. for (int i = 0; i + 2 < n; ++i) {
  18. for (int j = i + 1; j + 1 < n; ++j) {
  19. for (int k = j + 1; k < n; ++k) {
  20. long long a = (v[i].first - v[j].first)*(v[i].first - v[j].first) + (v[i].second - v[j].second)*(v[i].second - v[j].second);
  21. long long b = (v[j].first - v[k].first)*(v[j].first - v[k].first) + (v[j].second - v[k].second)*(v[j].second - v[k].second);
  22. long long c = (v[k].first - v[i].first)*(v[k].first - v[i].first) + (v[k].second - v[i].second)*(v[k].second - v[i].second);
  23. long long watr = max({a, b, c});
  24. long long dl3 = min({a, b, c});
  25. long long elbaky = a + b + c - watr - dl3;
  26. if (dl3 + elbaky == watr) {
  27. long double area = 0.5 * 0.5 * dl3 * elbaky;
  28. if (l * l <= area && area <= r * r) {
  29. count++;
  30. }
  31. }
  32. }
  33. }
  34. }
  35. cout << count << "\n";
  36. }
  37.  
  38. int main() {
  39. freopen("points.in", "r", stdin);
  40. // freopen("test.out", "wt", stdout);
  41. io;
  42. long long tests = 1;
  43. cin >> tests;
  44. while (tests--) {
  45. solve();
  46. }
  47. return 0;
  48. }
Success #stdin #stdout 0.01s 5268KB
stdin
Standard input is empty
stdout
0