Bag of Santa Claus

Bag of Santa Claus

When the New Year is coming, all the kids wait for a visit from Santa Claus. He comes with a huge bag of gifts, and you can choose any one of them. But how to make the best choice? Santa takes gifts out of the bag one at a time, and if you don't like it, he puts it back into the bag and doesn’t take it out again. This leads to some disappointing situations when the last thing from the bag is a doll, and you already refused a pirate hat because hoping to get a train set!

When this happened with John, his Dad told him - "Don't worry, I’ll teach you how to choose a better gift. Think about how many gifts are in the bag."

Your function will be called many times in the same environment. For each step you are given a value of the current gift, the quantity of gifts in the current bag and a number of the current gift (counted from 1). For each step you should make a choice to take a gift or not -- True or False.

Your function will be checked repeatedly for different bags containing anywhere from 10 to 1000 gifts. We will count only the best gifts from each bag as the second rate gifts are not for us. All calls are running in the same environment, so be careful with globals. You should choose 700+ the best gifts from 2000 bags.

Input: Three arguments.
current_gift - a value of the current gift as an float.
gifts_in_bag - the quantity of gifts in a bag as an integer.
gift_number - a number of the current gift as an integer (from 1 to gifts_in_bag).

Output: Do you accept the current gift or not as a boolean value.

Implementation examples (only to demonstrate the API):

def choose_good_gift(current_gift, gifts_in_bag, gift_number):
    from random import random
    # coin
    if random() > 0.5:
        return True
    else:
        return False
    

How to use: This code can recognize optimal situations and allow you to trigger certain events during those situations. For example, you could create a bot that crawls a website looking for concert tickets and automatically lets you know when your favorite band is playing in your city.

Precondition:
10 ≤ gifts_in_bag ≤ 1000
0 ≤ current_gift
Gifts are offered in the random order.

Settings
Code:
Other:
Invalid hot key. Each hot key should be unique and valid
Hot keys:
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.

Pair Programming (Beta-version)

Welcome to Pair Programming! Engage in real-time collaboration on coding projects by starting a session and sharing the provided unique URL with friends or colleagues. This feature is perfect for joint project development, debugging, or learning new skills together. Simply click 'Start Session' to begin your collaborative coding journey!

Waiting for Pair Programming to start...

You are trying to join a pair programming session that has not started yet.

Please wait for the session creator to join.

Waiting for Pair Programming to reconnect...

It looks like the creator of the pair programming session closed the editor window.

It might happen accidentally, so that you can wait for reconnection.

×
 
 
<< <
> >>
exec show

Whats Next?

Free accounts will see Best CheckiO solutions with some delay.
Best Solutions will be opened in a moment
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