#include<bits/stdc++.h> using namespace std; struct Cow{ int x,y,p; }; int main() { int N; cin>>N; vectorcows(N); for (int i=0;i<N;++i) { cin>>cows[i].x>>cows[i].y>>cows[i].p; } vector<vector>adj(N); for(int i=0;i<N;++i){ for(int j=0;j<N;++j){ if(i==j){ continue; } long long dx=cows[i].x-cows[j].x; long long dy=cows[i].y-cows[j].y; long long distance_squared=dxdx+dydy; long long p_squared=(long long)cows[i].p*cows[i].p; if(p_squared>=distance_squared){ adj[i].push_back(j); } } } int max_reach=0; for(int start=0;start<N;++start){ vectorvisited(N,false); queueq; q.push(start); visited[start]=true; int count=0; while(!q.empty()) { int u=q.front(); q.pop(); count++; for(int v:adj[u]){ if(!visited[v]){ visited[v]=true; q.push(v); } } } if(count>max_reach){ max_reach=count; } } cout<<max_reach<<endl; return 0; }very eazy!!! 阿玛特啦斯!!!