Codeforces Round #430 (Div. 2) B. Gleb And Pizza
2017-08-30 11:18
363 查看
B. Gleb And Pizza
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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
Output the number of pieces of sausage that lay on the crust.
Examples
Input
Output
Input
Output
Note
Below is a picture explaining the first example. Circles of green color denote pieces of sausage lying on the crust.
![](http://codeforces.com/predownloaded/1a/f7/1af710f0aba613eb2ae66c09de651a0009e21369.png)
水题,判断一下有多少个圆在环的里面
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
//freopen("in.txt","r",stdin);
int r,d;
cin>>r>>d;
int n;
cin>>n;
int ans=0;
while(n--){
double x,y,dis;
scanf("%lf%lf%lf",&x,&y,&dis);
double a=x*x+y*y;
double radiu=sqrt(a);
if(radiu+dis<=r){
if(radiu-dis>=r-d){
ans++;
}
}
}
cout<<ans<<endl;
}
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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
Output the number of pieces of sausage that lay on the crust.
Examples
Input
8 4 7 7 8 1 -7 3 2 0 2 1 0 -2 2 -3 -3 1 0 6 2 5 3 1
Output
2
Input
10 8
4
0 0 9
0 0 101 0 1
1 0 2
Output
0
Note
Below is a picture explaining the first example. Circles of green color denote pieces of sausage lying on the crust.
![](http://codeforces.com/predownloaded/1a/f7/1af710f0aba613eb2ae66c09de651a0009e21369.png)
水题,判断一下有多少个圆在环的里面
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
//freopen("in.txt","r",stdin);
int r,d;
cin>>r>>d;
int n;
cin>>n;
int ans=0;
while(n--){
double x,y,dis;
scanf("%lf%lf%lf",&x,&y,&dis);
double a=x*x+y*y;
double radiu=sqrt(a);
if(radiu+dis<=r){
if(radiu-dis>=r-d){
ans++;
}
}
}
cout<<ans<<endl;
}
相关文章推荐
- 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
- Codeforces Round #430 B. Gleb And Pizza
- Codeforces Round #430 (Div. 2) C. Ilya And The Tree
- Codeforces Round #430 (Div. 2) D. Vitya and Strange Lesson
- Codeforces Round #430 (Div. 2):D. Vitya and Strange Lesson(模拟建树)
- Codeforces Round #430 (Div. 2) C. Ilya And The Tree dfs+set
- Codeforces Round #430 (Div. 2)C. Ilya And The Tree dfs D - Vitya and Strange Lesson
- Codeforces Round #430 (Div. 2) C. Ilya And The Tree dfs+set
- 【Codeforces Round #430 (Div. 2) D】Vitya and Strange Lesson
- Codeforces Round #430 (Div. 2) D. Vitya and Strange Lesson [trie]
- Codeforces Round #430 (Div. 2) C. Ilya And The Tree dfs+set
- 【Codeforces Round #430 (Div. 2) C】Ilya And The Tree
- Codeforces Round #430 (Div. 2) Ilya And The Tree 树上因子 思维 + dfs
- Codeforces Round #430 (Div. 2) C. Ilya And The Tree dfs+set
- Codeforces Round #430 (Div. 2) E. Nikita and game
- Codeforces Round #430 (Div. 2) 842C Ilya And The Tree(暴力)
- Codeforces Round #430 (Div. 2) - D. Vitya and Strange Lesson (01字典树)