Connect Stars Connect Stars
Undefined
EN Japanese

これは 最小全域木 (Minimum spanning tree (Wikipedia)) を作成するミッションです.

入力値は点の座標 (x座標, y座標 のタプル) のリストで与えられます. 与えられた全ての点を接続するための線を探して 2整数のタプル(整数は入力値のリストのインデックスを表します) のリスト (またはイテラブル) で返して下さい. それらの線の長さの合計は最小値の必要があります.

注意
  • 各テストは出力する線の組み合わせが一意になるように設計されています ...
You should be an authorized user in order to see the full description and start solving this mission.

Become Awesome

  • No Ads
  • No Limits
  • More Content
Settings
Code:
Other:
CheckiO Extensions

CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.

In order to install CheckiO client you'll need installed Python (version at least 3.8)

Install CheckiO Client first:

pip3 install checkio_client

Configure your tool

checkio --domain=py config --key=

Sync solutions into your local folder

checkio sync

(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)

checkio serv -d

Alternatevly, you can install Chrome extension or FF addon

checkio install-plugin
checkio install-plugin --ff
checkio install-plugin --chromium

Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.

×
 
 
<< <
> >>
exec show

Whats Next?

Free accounts will see Best CheckiO solutions with some delay.
Best Solutions will be opened in
Become Awesome and Don't wait
The next stage is ""
Will be activated in
View More Solutions Random Review Solutions Go to the next mission