B. Gleb And Pizza #430 (Div. 2)
来源:互联网 发布:自救手环 淘宝 编辑:程序博客网 时间:2024/05/18 16:38
Gleb ordered pizza home. When the courier delivered the pizza, he was very upset, because several pieces of sausage lay on the crust, and he does not really like the crust.
The pizza is a circle of radius r and center at the origin. Pizza consists of the main part — circle of radius r - d with center at the origin, and crust around the main part of the width d. Pieces of sausage are also circles. The radius of the i -th piece of the sausage is ri, and the center is given as a pair (xi, yi).
Gleb asks you to help determine the number of pieces of sausage caught on the crust. A piece of sausage got on the crust, if it completely lies on the crust.
First string contains two integer numbers r and d (0 ≤ d < r ≤ 500) — the radius of pizza and the width of crust.
Next line contains one integer number n — the number of pieces of sausage (1 ≤ n ≤ 105).
Each of next n lines contains three integer numbers xi, yi and ri ( - 500 ≤ xi, yi ≤ 500, 0 ≤ ri ≤ 500), where xi and yi are coordinates of the center of i-th peace of sausage, ri — radius of i-th peace of sausage.
Output the number of pieces of sausage that lay on the crust.
8 477 8 1-7 3 20 2 10 -2 2-3 -3 10 6 25 3 1
2
10 840 0 90 0 101 0 11 0 2
0
Below is a picture explaining the first example. Circles of green color denote pieces of sausage lying on the crust.
#include <iostream>#include<cstdio>#include<cmath>#include<algorithm>using namespace std;int main(){ double r,d; scanf("%lf%lf",&r,&d); int n; scanf("%d",&n); int sum=0; for(int i=0;i<n;i++){ double x,y,rr; scanf("%lf%lf%lf",&x,&y,&rr); double dis=sqrt(x*x+y*y); if(dis-rr>=(r-d)&&dis+rr<=r) sum++; } printf("%d\n",sum); return 0;}
- B. Gleb And Pizza #430 (Div. 2)
- Codeforces Round #430 (Div. 2) B. Gleb And Pizza
- Codeforces Round #430 (Div. 2) B. Gleb And Pizza
- Codeforces Round #430 (Div. 2) B. Gleb And Pizza(数论)
- Codeforces Round #430 (Div. 2) B. Gleb And Pizza
- B. Gleb And Pizza
- (几何题)Codeforces 430 B. Gleb And Pizza
- Codeforces 842B. Gleb And Pizza 模拟
- Codeforces 842 B Gleb And Pizza
- Gleb And Pizza
- CF-448(Div.2)-A. Pizza Separation
- codeforces #448(div 2) A. Pizza Separation
- #297 (div.2) B. Pasha and String
- #299 (div.2) B. Tavas and SaDDas
- #308 (div.2) B. Vanya and Books
- Codeforces Round #437 (Div. 2 C. Ordering Pizza 贪心 only two types of pizza
- Codeforces Round #437 Div. 2 C. Ordering Pizza
- Codeforces Round #448 (Div. 2) A. Pizza Separation 前缀和
- 简述为什么不能用父类给子类赋值
- CentOS7(64位)下运行IPython3出错解决办法
- 史上最全最强SpringMVC详细示例实战教程
- 在IntelliJ IDEA中创建Spring项目
- 集合collection 下List接口和Set接口
- B. Gleb And Pizza #430 (Div. 2)
- python list 排序
- session和cookie的区别
- 常用数据库的驱动程序名,驱动类名以及URL
- M斐波那契数列
- 题目1045:百鸡问题
- zlib压缩库解压失败的问题
- 关于CGI
- CodeForces 526F Pudding Monsters (分治)