## UVA Problem 109 ( SCUD Busters) Solution UVA Problem 109 ( SCUD Busters) : This problem is UVA uhunt book chapters (Computational Geometry problem) category problem. link: http://uva.onlinejudge.org/external/1/109.html   Problem Description: Find each convex hull for each area then select that convex hull whether a Missile falls inside…

## UVA Problem 476 (Points in Figures Rectangles) Solution

UVA Problem 476 (Points in Figures Rectangles) : This problem is UVA uhunt book chapters (Computational Geometry problem) category problem. Details link: http://uva.onlinejudge.org/external/1/476.html   Problem Description: This is a straightforward problem. #include<bits/stdc++.h> using namespace std; int main() { double x1,y1,x2,y2,X,Y; char…

## UVA Problem 640 ( Self Numbers) Solution

UVA Problem 640 ( Self Numbers): Is a basic UVa problem. Details link:   Problem Details: This is a Straightforward problem.   problem solution: #include <stdio.h> #include <math.h> int d; int generator(int num) { int sum = num; while(num >…

## UVA Problem 10137 (The trip) Solution

#include <bits/stdc++.h> using namespace std; double arr; int main() { // double P=0,N=0,F,S,T; int n,i,j; while(cin>>n && n) { double avg=0; for(i=0;i<n;i++) { scanf(“%lf”,&arr[i]); avg += arr[i]; } avg /= n; double P = 0, N = 0; for(…