Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

[euler 102]

Browse Source
This commit is contained in:
Mike Schwörer
2017-11-20 18:28:21 +01:00
parent 69e3f51730
commit a25b5b7662
4 changed files with 60 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
www/statics/euler/Euler_Problem-102_description.md Normal file
View File

@@ -0,0 +1,16 @@
Three distinct points are plotted at random on a Cartesian plane, for which `-1000 <= x,y <= 1000`, such that a triangle is formed.
Consider the following two triangles:
~~~
A(-340,495), B(-153,-910), C(835,-947)
X(-175,41), Y(-421,-714), Z(574,-645)
~~~
It can be verified that triangle ABC contains the origin, whereas triangle XYZ does not.
Using [triangles.txt](https://projecteuler.net/project/resources/p102_triangles.txt), a 27K text file containing the co-ordinates
of one thousand "random" triangles, find the number of triangles for which the interior contains the origin.
NOTE: The first two examples in the file represent the triangles in the example given above.