View Code of Problem 32

#include <bits/stdc++.h>
using namespace std;
int main(){
	int m,n;
	while(cin>>m>>n){
		int a[5],b[5],c[5],l;
		double r;
		for(int i=0;i<5;i++)
			cin>>a[i]>>b[i]>>c[i];
		cin>>l>>r;
		int flag=-1;
		for(int i=0;i<5;i++){
			double s=sqrt((a[i]-m)*a[i]-m+(b[i]-n)*(b[i]-n));
			if(s<=l&&c[i]<=s){
				flag=i;
				double k;
				double s=sqrt((a[i]-m)*(a[i]-m)+(b[i]-n)*(b[i]-n));
				if(n==b[flag]) k=0;
				else k=1.0*(b[flag]-n)/(a[flag]-m);
				for(int i=0;i<5;i++){
					double k2;
					double s2=sqrt((a[i]-m)*(a[i]-m)+(b[i]-n)*(b[i]-n));
					if(n==b[flag]) k=0;
					else k=1.0*(b[flag]-n)/(a[flag]-m);
					if(k==k2&&s2<s) flag=-1;
				}
			}
		}
		if(flag!=-1) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
}