Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define sfi ({int a;scanf("%d",&a);a;})
- typedef pair<int,int> pii;
- map<pii,int>mpp;
- int x[705],y[705];
- long long trarea(long long i,long long j,long long k)
- {
- return x[i]*(y[j]-y[k])-x[j]*(y[i]-y[k])+x[k]*(y[i]-y[j]);
- }
- int main()
- {
- int t=sfi,ti=1;
- while(t--)
- {
- int n=sfi;
- for(int i=0; i<n; i++)
- {
- x[i]=sfi;
- y[i]=sfi;
- }
- for(int i=0; i<n; i++)
- {
- for(int j=0; j<n; j++)
- {
- for(int k=0; k<n; k++)
- {
- if(i!=j and j!=k and k!=i)
- {
- if(trarea(i,j,k)==0)mpp[make_pair(i,j)]++;
- }
- }
- }
- }
- int mxx=0;
- for(map<pii,int>::iterator it=mpp.begin(); it!=mpp.end(); it++)
- {
- mxx=max(mxx,it->second);
- }
- printf("Case %d: %d\n",ti++,mxx+2);
- mpp.clear();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement