| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 6791 | Accepted: 2523 |
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
计算每条线的斜率，然后统计不同斜率的个数就可以。
又陷入了一WA就是好几次的窘境啊……
先是RE，反映半天原来是数组开小了，然后各种WA，于是看了评论区，发现要调精度到1e-8
……
1 /**/ 2 #include<iostream> 3 #include<cstdio> 4 #include<cmath> 5 #include<cstring> 6 #include<algorithm> 7 using namespace std; 8 const double eps=1e-8; 9 const int mxn=3000; 10 double x[mxn],y[mxn]; 11 int n; 12 double k[mxn*20]; 13 int cnt; 14 int main(){ 15 scanf("%d",&n); 16 int i,j; 17 for(i=1;i<=n;i++)scanf("%lf%lf",&x[i],&y[i]); 18 for(i=1;i<n;i++) 19 for(j=i+1;j<=n;j++){ 20 if(x[i]==x[j])k[++cnt]=1e15; 21 else k[++cnt]=(double)(y[i]-y[j])/(x[i]-x[j]); 22 } 23 sort(k+1,k+cnt+1); 24 int ans=0; 25 ans++;//一定可以画至少一条 26 for(i=1;i<cnt;i++){ 27 if(fabs(k[i]-k[i+1])>eps)ans++; 28 } 29 cout<<ans; 30 return 0; 31 }
原文：http://www.cnblogs.com/SilverNebula/p/5701337.html