Golden Pyramid Golden Pyramid
FR HU JA RU UK Simplified Chinese EN

我们的机器人 -三重奏需要为未来的旅程和寻宝活动而训练。斯蒂芬已经建立了一个金字塔型的特殊平面模型。现在机器人可以训练用来收集黄金。他们起始于金字塔的顶端,而且必须在每个空间收集黄金,然后选择走左边还是右边的路径,并继续下降到下一层。为了优化他们收集黄金的能力,斯蒂芬需要知道可以在一次运行中收集到的黄金的最大数量。

给你一个由元组组成的元组,其中第一个元组具有一个整数,每下一个元组具有一个比上一个元祖整数个数多一个。这个由元组组成的元组看起来像一个三角形。你需要写一个程序,来帮助史蒂芬在金字塔中找到最赚钱的路线下所收集到黄金的最大数量。下金字塔所有路线是向左下方或者向右下方。 ...

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
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