1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 252525
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define umll unordered_map<ll,ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
using namespace std;
string solve(vpll& A, ll k) {
if(k == 1) return "Infinity";
ll n = A.size(), res = 0;
unordered_map<string, ll> mp;
for(ll i = 0; i < n; i++) {
for(ll j = i + 1; j < n; j++) {
ll y = A[j].first - A[i].first;
ll x = A[j].second - A[i].second;
if(y < 0) y = -y, x = -x;
if(y == 0) x = 1;
ll g = __gcd(y,x);
if(g) y /= g, x /= g;
ll c = y * A[i].second - x * A[i].first;
mp[to_string(y) + "#" + to_string(x) + "#" + to_string(c)]++;
}
}
for(auto& [_, c] : mp) {
if (2 * c >= k * (k - 1)) res++;
}
return to_string(res);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
ll n, k;
cin>>n>>k;
vpll A(n);
for(ll j = 0; j < n; j++) cin>>A[j].first>>A[j].second;
cout<<solve(A,k);
}
return 0;
}
|
