Codeforces Round #430 (Div. 2) B

题意:给出一个圆环,问有多少个圆完全在内环和外环之间

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 typedef long long ll;
 4 const int N=1e5+10;
 5 
 6 
 7 int main(){
 8    int r,d;
 9    cin>>r>>d;
10    int n;
11    cin>>n;
12    d=r-d;
13    int x,y,r1;
14    int sum=0;
15    for(int i=1;i<=n;i++){
16         scanf("%d%d%d",&x,&y,&r1);
17         int z=(x*x+y*y);
18         double l=sqrt(z);
19        // printf("%f
",l);
20         if(l>=(d+r1)*1.0&&(l+r1)*1.0<=r*1.0){
21             sum++;
22         }
23    }
24    cout<<sum<<endl;
25 }
原文地址:https://www.cnblogs.com/hhxj/p/7454763.html