Scribd Logo
Upload

Welcome to Scribd!

  • 75 views

    Task: TOY Toys: Input

    Uploaded by

    Andrei Florin
    Johnny collects toys of different types like cars, trucks, and diggers. He told Emma a riddle that he could choose a different set of toys each day to play for n days, with a different quantity of one toy type every two days. Emma asked for help determining all possible numbers of toys Johnny could have. The task is to output the number of possible solutions and all possible numbers of toys given an input number n representing the number of days.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Task: TOY Toys: Input

    Uploaded by

    Andrei Florin
    75 views2 pages
    Johnny collects toys of different types like cars, trucks, and diggers. He told Emma a riddle that he could choose a different set of toys each day to play for n days, with a different quantity of one toy type every two days. Emma asked for help determining all possible numbers of toys Johnny could have. The task is to output the number of possible solutions and all possible numbers of toys given an input number n representing the number of days.

    Original Description:

    Informatics

    Original Title

    toy

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Johnny collects toys of different types like cars, trucks, and diggers. He told Emma a riddle that he could choose a different set of toys each day to play for n days, with a different quantity of one toy type every two days. Emma asked for help determining all possible numbers of toys Johnny could have. The task is to output the number of possible solutions and all possible numbers of toys given an input number n representing the number of days.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    75 views2 pages

    Task: TOY Toys: Input

    Uploaded by

    Andrei Florin
    Johnny collects toys of different types like cars, trucks, and diggers. He told Emma a riddle that he could choose a different set of toys each day to play for n days, with a different quantity of one toy type every two days. Emma asked for help determining all possible numbers of toys Johnny could have. The task is to output the number of possible solutions and all possible numbers of toys given an input number n representing the number of days.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    Task: TOY

    Toys english

    CEOI 2018, day 2. Available memory: 256 MB. 16.08.2018

    Johnny collects toys. His collection may contain many toys of many different types: cars, trucks, diggers and
    many more. He may own more than one piece of the same toy, e.g. four trucks, in which case all the pieces are
    indistinguishable for him.
    Emma asked Johnny how many toys he has. Not wanting to reveal the secret, he answered with a riddle (it
    is typical for him): If I chose a different set of my toys for each day, I could play for n days. In other words,
    for every two days there is a type of toy with a different quantity. Here, Johnny considers an empty set of toys
    as a valid set.
    Emma likes neither the answer and nor this riddle, but she is really curious to know how many toys Johnny
    has. She asked you for help. Can you determine all possibilities of the number of toys that Johnny may have
    in his collection?

    Input
    The first (and the only one) line of the standard input contains an integer n (1 ≤ n ≤ 109 ).

    Output
    The first line of the standard output should contain one integer r, the number of solutions (that is, the number
    of possibilities of the number of toys in Johnny’s collection).
    The second line should contain a strictly increasing sequence of r integers that represents the numbers of
    toys that Johnny may have in his collection.

    Example
    For the input data: the correct result is:
    12 4
    4 5 6 11
    Explanation of the example: Johnny could have:
    • two trucks, one car, and one digger (4 toys in total),
    • three trucks and two cars (5 toys in total),
    • five trucks and one car (6 toys in total),
    • eleven trucks (11 toys in total).
    Each of these options guarantees exactly 12 days of fun. For example, if he has eleven trucks, he can choose
    a set of i − 1 trucks on the i-th day (for i = 1, . . . , 12).

    For the input data: the correct result is:


    36 8
    6 7 8 10 11 13 18 35
    Explanation of the example: Note that there are two different sets of 10 toys that guarantee 36 days of
    fun:
    • one truck, one car, and eight diggers,
    • five trucks and five diggers.
    Still, only one of them is output.
    To get 6 toys in total, Johnny could have one truck, one car, two diggers and two buses.

    v. 1.01 Toys 1/2


    Grading
    The test set is divided into the following subtasks with additional constraints. Tests in each of the subtasks
    consist of one or more separate test groups. Each test group may contain one or more test cases.

    Subtask Constraints Points


    1 n ≤ 50 19
    2 n ≤ 10 000 20
    3 n ≤ 100 000 20
    4 n ≤ 108 20
    5 no additional constraints 21

    v. 1.01 Toys 2/2

    You might also like