We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Mathematics
- Fundamentals
- Find the Point
- Discussions
Find the Point
Find the Point
Sort by
recency
|
367 Discussions
|
Please Login in order to post a comment
******style visits palsy bozo oz good luzone uzbek oz coat top FL oz
here is very good site recommend you guys plz visit me there are lots of info's about sports :D 먹튀검증
JavaScript
To solve the problem of finding the reflection (inversion) of point P across point Q, we can use simple geometry. The reflection R of point P across point Q can be found using the following formulas for the coordinates of R:
[ R_x = 2Q_x - P_x ] [ R_y = 2Q_y - P_y ]
Here's how you can implement the solution in C:
findPoint
function which takes the coordinates of points P and Q and calculates the coordinates of the reflected point R.main
function, handle the input and output according to the specified format.Here's the complete implementation:
This program reads the input, calculates the reflected point for each pair of points provided, and outputs the results. The function
findPoint
performs the necessary calculations and returns the result as an array of integers.My code in Kotlin: