营员交流梁盾_沈业基geomcontest_v16.pdfVIP

  • 7
  • 0
  • 约5.27万字
  • 约 31页
  • 2021-05-22 发布于北京
  • 举报
Smalle ea A Input: Standard Input Output: Standard Output Given two points A and B, your task is to find a regular polygon of n sides, passing through these two points, so that the area is minimized. Input There will be at most 100 test cases. Each case contains 5 integers x , y , x , y , n A A B B (0 x ,y ,x ,y =100, 3 n=10000), the coordinates of A and B, and the number of sides of t

文档评论(0)

1亿VIP精品文档

相关文档