Logo
(追記) (追記ここまで)

6554번 - Polygon Programming with Ease 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 128 MB47302360.526%

문제

Read the statement of Problem 6553! Given a list of meeting locations as specified in the description of Problem 6553, you have to calculate the locations of the Foreign Offices.

입력

See the input specification of Problem 6553 for the format, and the output specification of Problem 6553 for the meaning of the input.

출력

See the output specification of Problem 6553 for the format, and the input specification of Problem 6553 for the meaning of the output.

제한

예제 입력 1

5 14 2 20 4 18 12 12 18 10 10
3 -3 5 -2 5 -3 6
3 -2 10 5 10 -1 12

예제 출력 1

5 10.000000 2.000000 18.000000 2.000000 22.000000 6.000000 14.000000 18.000000 10.000000 18.000000
3 -4.000000 6.000000 -2.000000 4.000000 -2.000000 6.000000
3 -8.000000 12.000000 4.000000 8.000000 6.000000 12.000000

힌트

The relationship between the sample input and output polygons is illustrated in the figure below. Solid lines indicate the polygon joining the Foreign Offices, whereas dashed lines indicate the polygon joining the meeting locations. To generate further sample input you may use your solution to Problem 6553.

출처

Contest > University of Ulm Local Contest > University of Ulm Local Contest 2002 E번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /