8943: Intersection

内存限制:128 MB 时间限制:1 S
题面:传统 评测方式:文本比较 上传者:
提交:0 通过:0

题目描述

链接:https://ac.nowcoder.com/acm/contest/57355/F
来源:牛客网
Given n circles in a plane, you need to draw a circle, and find the maximum number of given circles it can intersect with.
Two circles intersect with each other if and only if they share at least one common point. It is guaranteed that any two given circles do not share a common point and do not contain each other. The circle you draw may degenerate into a line (a circle with infinite radius) or a point.

输入格式

The first line contains an integer n (1≤n≤150), indicating the number of circles.
Each of the next n lines contains three integers xi,yi (∣xi∣,∣yi∣≤10^3) and ri (1≤ri≤10^3), indicating the coordinates and the radius of a circle.

输出格式

Output an integer indicating the maximum number of intersected circles.

输入样例 复制

4
-3 1 1
6 0 2
0 -4 2
1 0 1

输出样例 复制

3

分类标签