Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- typedef pair<int, int> P;
- P p[110];
- int main()
- {
- int n;
- cin >> n;
- map<P, int> mp;
- for (int i = 0; i < n; i++)
- {
- cin >> p[i].first >> p[i].second;
- }
- bool f = false;
- for (int i = 0; i < n - 2; i++)
- {
- for (int j = i + 1; j < n - 1; j++)
- {
- for (int k = j + 1; k < n; k++)
- {
- if ((p[i].first - p[j].first) * (p[i].second - p[k].second) == (p[i].first - p[k].first) * (p[i].second - p[j].second))
- {
- f = true;
- break;
- }
- }
- if (f)
- break;
- }
- if (f)
- break;
- }
- if (f)
- cout << "Yes" << endl;
- else
- cout << "No" << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement