Computational Ry-question list

 

Move @ xiaoyuan's hard-earned questions and do it by yourself ~ Thanks to her ~

 

 

 

 

Two slashes are already used, and the four slashes are all used in zoj and poj.

3D convex bag poj 3528 2974hdu 3662 ECNU 1624 calculates the intersection Polygon Area and calculates the Two convex polygon areas. Question. You can use semi-flat or yy. Poj 1259 maximum internal convex hull HDU 3644 polygon can be placed into the largest circle radius (may be concave, decimal + judgment) HDU 1086 HDU 3982 semi-Plane Cross + Convex Polygon and circular area cross HDU 4063 pay attention to the method of determining whether a line segment is covered by a circle, which can be divided into a small segment and a small segment to determine, you can also determine the case hdu3629fzu1973uva681 Based on the right endpoint of the Left circle to the right (down) to find the convex hull, question 634: Determine whether the points are in the polygon 11626 to give you the convex points (unordered), sort them in a counter-clockwise order, and then sort the points in the interior point to 109 same as poj126410002 to find the center of the convex polygon 218 water question, find the point of the convex hull and the total length of the output side 10173 rotate the card shell to find the smallest external rectangle 11096 find the convex circumference, question 10088 calculate polygon interior point number 10065 Polygon Area 10652 Convex Hull area rectangular area 361 convex hull solution within all triangles 191 same as poj1410478 judge whether the point is in the circle, rectangle, 477 to 478 in a triangle is missing in the triangle. 476 in the rectangle, 10078 In the rectangle, determines whether the polygon is a convex bag. 10060 gives you the shape of some steel plates (not limited to convex and concave), as well as the thickness, and gives you the radius and thickness of the manhole cover, ask how many wells can you overwrite. 190 The number of grids covered by the poj1329356 circle and the number of grids passing through the border 10678 the elliptical area 10991 the triangle area-the three slice areas can be 143 The number of triangle points, in the White Paper, the question 10522 is the three-height length of a known triangle, and an area of 11854 is used to determine whether a triangle is a right triangle. 10347 it is known that the three midline lengths of a triangle, and the triangle area is 11455 square meters, determine the triangle *********** 10577 and zoj189210005 minimum circle coverage to obtain a radius of 11345 for multiple Rectangles and 10242 known parallelogram three points for another vertex. Pay attention to the relationship between the three locations. In this example, the links are connected, and the two points may not be in the middle .. 11817 determine the distance between the geocoordinate sphere and the linear distance. 10167 a B must be an integer, enumeration 10897 calculates great-circle distance 10316 for the longitude and latitude, and finds the airport where a hub is built to minimize the distance from all airports to the hub. 10075 coordinate coordinates to find the distance, then Floyd, note that the distance before Floyd should also be rounded to uralural 1020 perimeter + circle Ural 1052 to find the maximum point of Collinearity Ural 1084 to find the intersection area of the circle with a fixed radius and the fixed length rectangle (the circle and the rectangle are in the same center)) ural 1207 divides points into two equal vertices. Sort Ural 1348. calculates the Ural 1159 radius of the nearest vertex to the straight line, note that all vertices are in the special case of a circle diameter Ural 1489 three-dimensional to two-dimensional, pay attention to the details, okural 1572 is given a shape size (circle, square, equilateral triangle ), calculate the maximum number of places that can be placed in other shapes (input), zoj1010 1032 1037 1041 1081 1090 binary parabolic quadratic coefficient, and then 1104 1123 rectangular area and 1128 1139 directly enumerative the midpoint of the wall, find the maximum number of intersections with the wall. 1165 do not understand the intersection of 1185 1199 two circular public tangent, according to the proportional relationship of 1247 to the given direction, enter a little trouble point 1248 to determine whether a polygon has a nuclear, semi-plane intersection, determines whether the number of points in the intersection polygon is 0. 1280 1289 1309 calculates the tangent of the vertex and the circle, and then sorts and verifies whether the circle is intersecting. 1357 1369 13771426 determines how many rectangles are formed by the intersection of 100 line segments and 1439 minimum circular coverage, the random increment method 1453 cut the cake and asked how many slices to cut. Euler's theorem shows that the input data is very sinister and has a duplicate edge, and the cut end points are not necessarily at the edge of the cake .. 14651469 calculate the area of the polygon core. If the 1472 circle and the rectangle circle and the circle rectangle and the rectangle are intersecting and tangent, do you need to enter the T t1491 1550 surface ?? 1580 1000 points: How many right triangle 1597 1608 two circles can be placed into a rectangle 1648 1650 to the length of four line segments, find the largest area, area 1662, 1683, 1696, N circles, and finally you can see a few 1704 points. Find the largest area of a triangle, and other points are not in this triangle (top) 1739 find the area of the block covered by the polygon 1821 1860 water question, compare the length. The 1868 circle is used to obtain the minimum distance from the maximum value. The enumerated value is 1892 to give you the three points of the positive polygon, and the minimum rectangular area surrounding it is obtained (the rectangular length and width must be parallel to X or Y) 19101943 coordinate for distance, map is very convenient 1973 give polygon n vertices, find the midpoint of all edges 1974 give polygon n midpoint, find the vertex. The even edge is not unique. The odd side 19961999 given by the question determines whether a rectangle can be placed in another rectangle (which can be diagonal ), discretization 2015 calculate the polygon Center of Gravity 2062 give the polygon of N points, and obtain a Ray to make the intersection with the most edges (the rays cannot be inside the polygon ). 2102 give you a stick coordinate and several circle table coordinates, judge whether the stick can fall down 2107 21372157 give you a few points of the polygon, calculate the circumference 2167 find the Unit Circle covers the maximum number of points, find the unit circle formed by each point to cover the arc with the largest number of times. 2171 2228 gives a triangle area and a rope length, find the largest area of 2318 enclosed by a rope in a triangle area and give a circular ship. Ask if you can escape from the Islands consisting of many circles 2335 and draw three circles. Each circle can only be drawn once, the minimum Painting time is 2347, and 1000 points are given. How many squares can the 1000 points constitute? 2352. Many lines constitute the area of the Closed Area (which may constitute multiple areas, output the area of each piece) 2370 given the arc-shaped String Length and arc length. The height of the bow is 2375 2394 2403. You can find the law and simulate 2419 points for you, calculate the area of the maximum triangle that can be composed of three points, rotate the jamming case, reference the rotary jamming case of the rhubarb question solution O (N), first convex hull, then select the first three points P, Q, R to start rotation, note R does not If the value exceeds the first vertex, Q cannot exceed R, and P cannot exceed Q. Push R three times each time, so that the PQ does not move the largest area, then push Q, and then push P. If the three times have not been pushed, R will push one grid. Update the maximum area after each point. 2428 2459 give the six pieces of the triangle, seeking for the volume, the Euler's formula poj2208 with this formula can not survive 2503 points .. 2518 find the smallest area of the Elliptical Cylinder side area do not understand 2519 2525 25562551 2568 2589 Euler's theorem, find the number of sides after the intersection of N circles 2623 find the area of the union of two polygon, triangle division? 2629 how many circles are covered? 2637 2675 2713 2716 2718 how many colors are left after different rectangles are covered. 2748 2820 determine whether there is a nuclear, semi-plane intersection 2825 2854 2870 determine whether there is a straight line and all line segments have at least one intersection of 2959 0ac God question .. // 2978 same as 2167 2983 2993 30123521 scanned line + and query set poj1031 fence1039 pipe /// 10661092 farmland /// 1106 transmitters /// 1113 wall /// 1118 lining up1133 stars1151 Atlanta 1225 strictly inscribed similar triangles1259 the picnic1263 reflections1264 convex bag + determine whether the point is inside the polygon + the Polygon Area of 1265 area1266 cover an arc. /// 1269 intersecting lines1271 nice milk semi-plane intersection // 1279 art gallery // 12881294 not too convex hull1319 pipe fitters /// 13 291347 triangle1361 jaws /// 1375 intervals1379 run away /// 1380 /// 13851389 area of simple polygons1408 fishnet1410 Intersection Line Segment and rectangle intersection, note that question 1418 Viva confetti calculates the intersection of the circle and the circle, and then calculates the point of the intersection in a certain circle, sorted by the Polar Angle on the same circumference (remember to deduplicate ), calculate the midpoint of each short arc, and then check that the midpoint is in several disks, and record the vertex and the corresponding ID (which can be recorded as a vertex and an ID ). Scan the midpoint at the end of the scan. If it is not covered, it will be included in the answer. In addition, if a disk is not covered, that is, it is complete or completely covered. In this case, the intersection cannot be calculated and thus requires special determination. 1428 Hermes 'category1434 fill the cisterns! 1444 parallelepiped walk //// 14681471 triangles /// 1473 there's treasure everywhere! /// 14741494 sunrise1499 supercomputer selection, the sequel1500 polygonal component metal algorithm problem bee1536 specify the doors // 1569 myacm contains a round peg in a ground hole1586 three sides make a primary horse shoe limit quad trees1623 limit this takes the cake1645 BSP trees // 1654 area1660 princess frog1673 exocenter of a triangle1685 color tunnels1687 Buggy sat1688 doldolphin pool1693 counting rectangles1696 space ant1727 advanced causal measurements (ACM) 1758 inherit November rain1774 fold paper strips // 17881803 box art1810 covering1813 overlapped shapes1819 disks1834 line segment processing 1843 shire1851 map1871 bullet handle the fortified forest1875 robot1877 flooded! 1881 sail race1899 farmer Bill's problem1902 illumination // 19051912 a highway and the seven dwarfs1921 paper cut1927 area in triangle1931 limit balanced food // 1939 diplomatic license // 1940 polygon programming with ease1956 pumps and pipes1971 random counting // 1981 circle and points1982 water tank /// 2002 // 2007 scrambled polygon2012 triangle cuts2016 ink blots2026 as the C Row flies2031 building a space station2036 I conducting it! 2043 area of polygons2048 monster trap2053 square2066 Minimax coverage super star minimum coverage ball 2074 line of sight /// 2079 triangle2087 petanque2098 blocks cannot match inherit the spheres2150 crossing cannot find the specified hosts Ghost Busters // // 21872284 that nice Euler Circuit // 23182354 obtain the sphere distance from the Earth coordinate system // 2398 // 2504 obtain the intersection area of the two circles with zoj18922546 /// 2606/ /// 26102621 parallelepip Ed2622 convex login traveling by login Earth observation with a mobile robot team2747 shy polygons // 27802839 convex hull and triangle2932 partition triangle3011 secrets in shadows3129 How I wonder what you are! 3130 how I mathematician wonder what you are! Determine whether there is a kernel. The half plane intersection is 3135 polygons on the grid3334 connected gheeves3335 rotating scoreboard, half plane intersection 3347 kadj squares // 33483384 feng shui half plane intersection 3407 brookebond s 'en va en guerre... 3410 split convex polygon3058 calculates the intersection area of the circle and the ring. 35973608 bridge communications SS islands calculates the minimum distance between the two convex packets and rotates the jamming case.