找出排成一行的圆的半径，并给出第一个和最后一个圆的中心之间的距离

这里给出n个在外部相互接触并排成一排的圆圈。给出了第一个和最后一个圆的中心之间的距离。圆的半径相等。任务是找到每个圆的半径。
例子：

Input: d = 42, n = 4
Output: The radius of each circle is 7

Input: d = 64, n = 5
Output: The radius of each circle is 8

方法：
假设有n个半径为r的圆。
令，第一个和最后一个圆之间的距离= d
从图中可以清楚地看出，
r + r +(n-2)* 2r = d
2r + 2nr – 4r = d
2nr – 2r = d
因此， r = d /(2n-2)
$The radius of each circle = distance between the first and last circles/(2*no.of circles -2)$

C++

// C++ program to find radii of the circles
// which are lined in a row
// and distance between the
// centers of first and last circle is given
 
#include 
using namespace std;
 
void radius(int n, int d)
{
    cout << "The radius of each circle is "
         << d / (2 * n - 2) << endl;
}
 
// Driver code
int main()
{
    int d = 42, n = 4;
    radius(n, d);
    return 0;
}

Java

// Java program to find radii of the circles
// which are lined in a row
// and distance between the
// centers of first and last circle is given
import java.io.*;
 
class GFG
{
 
static void radius(int n, int d)
{
    System.out.print( "The radius of each circle is "
        +d / (2 * n - 2));
}
 
// Driver code
static public void main (String []args)
{
    int d = 42, n = 4;
    radius(n, d);
}
}
 
// This code is contributed by anuj_67..

Python3

# Python program to find radii of the circles
# which are lined in a row
# and distance between the
# centers of first and last circle is given
 
def radius(n, d):
    print("The radius of each circle is ",
        d / (2 * n - 2));
 
d = 42; n = 4;
radius(n, d);
 
 
# This code is contributed by PrinciRaj1992

C#

// C# program to find radii of the circles
// which are lined in a row
// and distance between the
// centers of first and last circle is given
using System;
 
class GFG
{
 
static void radius(int n, int d)
{
    Console.Write( "The radius of each circle is "
        +d / (2 * n - 2));
}
 
// Driver code
static public void Main ()
{
    int d = 42, n = 4;
    radius(n, d);
}
}
 
// This code is contributed by anuj_67..

Javascript

// javascript program to find radii of the circles
// which are lined in a row
// and distance between the
// centers of first and last circle is given
function radius(n , d)
{
    document.write( "The radius of each circle is "
        +d / (2 * n - 2));
}
 
// Driver code
var d = 42, n = 4;
radius(n, d);
 
// This code is contributed by 29AjayKumar

输出：

The radius of each circle is 7