# PHP Exercises: Test if circumference of two circles intersect or overlap

## PHP: Exercise-58 with Solution

There are two circles C1 with radius r1, central coordinate (x1, y1) and C2 with radius r2 and central coordinate (x2, y2)

Write a PHP program to test the followings -

"C2 is in C1" if C2 is in C1

"C1 is in C2" if C1 is in C2

"Circumference of C1 and C2 intersect" if circumference of C1 and C2 intersect, and and
"C1 and C2 do not overlap" if C1 and C2 do not overlap.

**Input:**Input numbers (real numbers) are separated by a space.

Input 0 to exit.

**Sample Solution: **-

**PHP Code:**

```
<?php
$n = intval(fgets(STDIN));
for($i = 0; $i < $n; $i++){
fscanf(STDIN, "%lf %lf %lf %lf %lf %lf", $xa, $ya, $ra, $xb, $yb, $rb);
$r = sqrt(($xb - $xa)*($xb - $xa) + ($yb - $ya)*($yb - $ya));
if($r + $ra < $rb){
echo "C1 is in C2\n";
continue;
}
if($r + $rb < $ra){
echo "C2 is in C1.\n";
continue;
}
if($r <= $ra + $rb){
echo "Circumference of C1 and C2 intersect.";
continue;
}
echo "C1 and C2 do not overlap.\n";
}
?>
```

**Sample Input:**

2

0.0 0.0 6.0 0.0 0.0 5.0

0.0 0.0 3.0 5.1 0.0 3.0

Sample Output:

C2 is in C1. Circumference of C1 and C2 intersect.

**Flowchart: **

**PHP Code Editor:**

**Have another way to solve this solution? Contribute your code (and comments) through Disqus.**

**Previous:** Write a PHP program to find the maximum sum of a contiguous subsequence from a given sequence of numbers a1, a2, a3, ... an. A subsequence of one element is also a continuous subsequence.

**Next:** Write a PHP program to that reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Friday. Note that 2004 is a leap year.

**What is the difficulty level of this exercise?**

Test your Programming skills with w3resource's quiz.

## PHP: Tips of the Day

**Mutates the original array to filter out the values specified**

Example:

<?php function tips_pull(&$items, ...$params) { $items = array_values(array_diff($items, $params)); return $items; } $items = ['x', 'y', 'z', 'x', 'y', 'z']; print_r(tips_pull($items, 'y', 'z')); ?>

Output:

Array ( [0] => x [1] => x )

**Weekly Trends**- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join
- JavaScript functions Exercises
- Python Tutorial
- Python Array Exercises
- SQL Cross Join
- C# Sharp Array Exercises