Patikrinkite, ar du duoti apskritimai liečia arba kerta vienas kitą
Išbandykite „GfG Practice“. 
#practiceLinkDiv { display: none !important; }
Išvestis
#practiceLinkDiv { display: none !important; } Yra du apskritimai A ir B su jų centrais C1(x1 y1) ir C2(x2 y2) ir spindulys R1 ir R2 . Užduotis yra patikrinti, ar abu apskritimai A ir B liečia vienas kitą, ar ne.
Pavyzdžiai:
Rekomenduojama praktika Patikrinkite, ar du duoti apskritimai liečia vienas kitą Išbandykite!Įvestis: C1 = (3 4)
C2 = (14 18)
R1 = 5 R2 = 8
Išvestis: Apskritimai vienas kito neliečia.Įvestis: C1 = (2 3)
C2 = (15 28)
R1 = 12 R2 = 10
Išvestis: Apskritimai susikerta vienas su kitu.Įvestis: C1 = (-10 8)
C2 = (14–24)
R1 = 30 R2 = 10
Prieiga:
Atstumas tarp centrų C1 ir C2 apskaičiuojamas kaip
C1C2 = sqrt((x1 - x2) 2 + (y1 - y2) 2 ).
Yra trys sąlygos.
- Jeigu C1C2 <= R1 - R2: Apskritimas B yra A viduje.
- Jeigu C1C2 <= R2 - R1: Apskritimas A yra B viduje.
- Jeigu C1C2 < R1 + R2: Apskritimas kerta vienas kitą.
- Jeigu C1C2 == R1 + R2: Apskritimas A ir B liečiasi vienas su kitu.
- Priešingu atveju Apskritimas A ir B nesutampa
Žemiau pateikiamas pirmiau minėto metodo įgyvendinimas:
C++ // C++ program to check if two // circles touch each other or not. #include using namespace std ; int circle ( int x1 int y1 int x2 int y2 int r1 int r2 ) { double d = sqrt (( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 )); if ( d <= r1 - r2 ) { cout < < 'Circle B is inside A' ; } else if ( d <= r2 - r1 ) { cout < < 'Circle A is inside B' ; } else if ( d < r1 + r2 ) { cout < < 'Circle intersect to each other' ; } else if ( d == r1 + r2 ) { cout < < 'Circle touch to each other' ; } else { cout < < 'Circle not touch to each other' ; } } // Driver code int main () { int x1 = -10 y1 = 8 ; int x2 = 14 y2 = -24 ; int r1 = 30 r2 = 10 ; circle ( x1 y1 x2 y2 r1 r2 ); return 0 ; }
Java // Java program to check if two // circles touch each other or not. import java.io.* ; class GFG { static void circle ( int x1 int y1 int x2 int y2 int r1 int r2 ) { double d = Math . sqrt (( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 )); if ( d <= r1 - r2 ) { System . out . println ( 'Circle B is inside A' ); } else if ( d <= r2 - r1 ) { System . out . println ( 'Circle A is inside B' ); } else if ( d < r1 + r2 ) { System . out . println ( 'Circle intersect' + ' to each other' ); } else if ( d == r1 + r2 ) { System . out . println ( 'Circle touch to' + ' each other' ); } else { System . out . println ( 'Circle not touch' + ' to each other' ); } } // Driver code public static void main ( String [] args ) { int x1 = - 10 y1 = 8 ; int x2 = 14 y2 = - 24 ; int r1 = 30 r2 = 10 ; circle ( x1 y1 x2 y2 r1 r2 ); } } // This article is contributed by vt_m.
Python # Python program to check if two # circles touch each other or not. import math # Function to check if two circles touch each other def circle ( x1 y1 x2 y2 r1 r2 ): d = math . sqrt (( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 )) if ( d <= r1 - r2 ): print ( 'Circle B is inside A' ) elif ( d <= r2 - r1 ): print ( 'Circle A is inside B' ) elif ( d < r1 + r2 ): print ( 'Circle intersect to each other' ) elif ( d == r1 + r2 ): print ( 'Circle touch to each other' ) else : print ( 'Circle not touch to each other' ) # Driver code x1 y1 = - 10 8 x2 y2 = 14 - 24 r1 r2 = 30 10 # Function call circle ( x1 y1 x2 y2 r1 r2 ) # This code is contributed by Aman Kumar
C# // C# program to check if two // circles touch each other or not. using System ; class GFG { static void circle ( int x1 int y1 int x2 int y2 int r1 int r2 ) { double d = Math . Sqrt (( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 )); if ( d <= r1 - r2 ) { Console . Write ( 'Circle B is inside A' ); } else if ( d <= r2 - r1 ) { Console . Write ( 'Circle A is inside B' ); } else if ( d < r1 + r2 ) { Console . Write ( 'Circle intersect' + ' to each other' ); } else if ( d == r1 + r2 ) { Console . Write ( 'Circle touch to' + ' each other' ); } else { Console . Write ( 'Circle not touch' + ' to each other' ); } } // Driver code public static void Main ( String [] args ) { int x1 = - 10 y1 = 8 ; int x2 = 14 y2 = - 24 ; int r1 = 30 r2 = 10 ; circle ( x1 y1 x2 y2 r1 r2 ); } } // This article is contributed by Pushpesh Raj.
JavaScript // JavaScript program to check if two circles touch each other or not. function circle ( x1 y1 x2 y2 r1 r2 ) { var d = Math . sqrt (( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 )); if ( d <= r1 - r2 ) { console . log ( 'Circle B is inside A' ); } else if ( d <= r2 - r1 ) { console . log ( 'Circle A is inside B' ); } else if ( d < r1 + r2 ) { console . log ( 'Circle intersect to each other' ); } else if ( d === r1 + r2 ) { console . log ( 'Circle touch to each other' ); } else { console . log ( 'Circle not touch to each other' ); } } // Driver code var x1 = - 10 y1 = 8 ; var x2 = 14 y2 = - 24 ; var r1 = 30 r2 = 10 ; circle ( x1 y1 x2 y2 r1 r2 ); // this code is contributed by devendra
Išvestis
Circle touch to each other
Laiko sudėtingumas: O(log(n)) nes naudojant integruotą sqrt funkciją
Pagalbinė erdvė: O(1)
Prie šio straipsnio prisidėjo Aarti_Rathi ir Dharmendra kumar .
