标签：
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 6555 | Accepted: 2439 |
Description
Farmer John has challenged Bessie to the following game: FJ has a board with dots marked at N (2 ≤ N ≤ 200) distinct lattice points. Dot i has the integer coordinates Xi and Yi (-1,000 ≤ Xi ≤ 1,000; -1,000 ≤ Yi ≤ 1,000).
Bessie can score a point in the game by picking two of the dots and drawing a straight line between them; however, she is not allowed to draw a line if she has already drawn another line that is parallel to that line. Bessie would like to know her chances of winning, so she has asked you to help find the maximum score she can obtain.
Input
* Line 1: A single integer: N
* Lines 2..N+1: Line i+1 describes lattice point i with two space-separated integers: Xi and Yi.
Output
* Line 1: A single integer representing the maximal number of lines Bessie can draw, no two of which are parallel.
Sample Input
4 -1 1 -2 0 0 0 1 1
Sample Output
4
Source
#include<cstdio> #include<cstring> #include<set> using namespace std; int x[205]; int y[205]; int n; set<double> s; int main() { scanf("%d", &n); for (int i = 0; i < n; ++i) scanf("%d%d", &x[i], &y[i]); int ans = 0; s.clear(); for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) { double k; if (x[i] - x[j] == 0) k = 0x7fffffff; else k = (double)(y[i] - y[j]) / (x[i] - x[j]); if (!s.count(k)) { ++ans; s.insert(k); } } printf("%d\n", ans); return 0; }
标签：
原文地址：http://www.cnblogs.com/albert7xie/p/4743543.html
