Guest User

Untitled

a guest
Dec 11th, 2014
268
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.38 KB | None | 0 0
  1. #include <cstdio>
  2. #include <cstring>
  3. #include <cstdlib>
  4. #include <cmath>
  5. #include <ctime>
  6. #include <cassert>
  7. #include <sstream>
  8. #include <iostream>
  9. #include <algorithm>
  10. #include <string>
  11. #include <iomanip>
  12. #include <vector>
  13. #include <queue>
  14. #include <stack>
  15. #include <deque>
  16. #include <set>
  17. #include <map>
  18. #include <list>
  19. using namespace std;
  20. #define endl "\n"
  21.  
  22. inline int area (int x1, int y1, int x2, int y2, int x3, int y3) {
  23.     return (x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1);
  24. }
  25.  
  26. void create_test(){
  27.     vector<pair<int, int> > v;
  28.     v.push_back({0, 0});
  29.     for (int i = 0; i < 2500; ++i) {
  30.         pair<int, int> r = {rand() % 20000 - 10000, rand() % 20000 - 10000};
  31.         int ok = 1;
  32.         for (int j = 0; j < v.size() && ok; ++j)
  33.             for (int k = j + 1; k < v.size(); ++k)
  34.                 if (area(v[j].first, v[j].second, v[k].first, v[k].second, r.first, r.second) == 0) {
  35.                     ok = 0;
  36.                     break;
  37.                 }
  38.         if (ok)
  39.             v.push_back(r);
  40.         else
  41.             --i;
  42.     }
  43.     cout << v.size() << endl;
  44.     for (int i = 1; i < v.size(); ++i)
  45.         cout << v[i].first << ",";
  46.     cout << endl;
  47.     for (int i = 1; i < v.size(); ++i)
  48.         cout << v[i].second << ",";
  49.     cout << endl;
  50. }
  51.  
  52. int main() {
  53. #ifdef KVARK
  54.     freopen("D:/workspaces/contest/task/input.txt", "w", stdout);
  55. #else
  56.     //freopen("input.txt", "r", stdin);
  57.     //freopen("output.txt", "w", stdout);
  58. #endif
  59.  
  60.     srand(time(0));
  61.     create_test();
  62.  
  63.     return 0;
  64. }
Advertisement
Add Comment
Please, Sign In to add comment