Scribd Logo
Upload

Welcome to Scribd!

  • Zadatak Programiranje - Baloni

    Uploaded by

    Amar Kalabić
    15 views1 page
    The document describes a problem of maximizing the number of tables that can be decorated with exactly 3 balloons per table given constraints on the available numbers of red, green, and blue balloons. The input will be 3 integers representing the quantities of red, green, and blue balloons. The program must output the maximum number of tables that can be decorated while following the rule that no table can have 3 balloons of the same color. Examples and constraints on the input values and time/memory limits are provided.

    Original Description:

    BHOI, zadatak, programiranje, baloni, programming, task

    Original Title

    Zadatak programiranje - Baloni

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a problem of maximizing the number of tables that can be decorated with exactly 3 balloons per table given constraints on the available numbers of red, green, and blue balloons. The input will be 3 integers representing the quantities of red, green, and blue balloons. The program must output the maximum number of tables that can be decorated while following the rule that no table can have 3 balloons of the same color. Examples and constraints on the input values and time/memory limits are provided.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    15 views1 page

    Zadatak Programiranje - Baloni

    Uploaded by

    Amar Kalabić
    The document describes a problem of maximizing the number of tables that can be decorated with exactly 3 balloons per table given constraints on the available numbers of red, green, and blue balloons. The input will be 3 integers representing the quantities of red, green, and blue balloons. The program must output the maximum number of tables that can be decorated while following the rule that no table can have 3 balloons of the same color. Examples and constraints on the input values and time/memory limits are provided.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Baloni (baloni)

    Na raspolaganju imate R crvenih, G zelenih i B plavih balona. Da biste ukrasili jedan sveani
    stol, potrebna su vam tano tri balona. Jedino pravilo koje morate potovati jeste da na
    jednom stolu ne smiju biti sve tri balona iste boje. Va zadatak je da napiete program koji
    rauna maksimalan broj stolova koji mogu biti ukraeni na prethodno opisan nain ukoliko su
    poznate vrijednosti R, G i B.

    Format ulaza i izlaza


    Program treba da koristi standardni ulaz i izlaz. Na prvoj i jedinoj liniji ulaza se nalaze tri cijela
    broja iz opisa zadatka R, G i B meusobno odvojena razmakom. Izlaz treba da sadri jedan
    cijeli broj koji predstavlja maksimalan broj stolova koji mogu biti ukraeni potujudi
    navedena pravila. Na kraju ispisa treba biti upotrebljen i prelazak u novi red.

    Primjeri
    Primjer br. 1
    Ulaz:
    543

    Izlaz:
    4

    Objanjenje: Stolove je mogue ukrasiti na sljedei nain; rgg, gbb, brr, rrg, pri emu r, g i b
    predstavljaju crveni, zeleni i plavi balon respektivno.
    Primjer br. 2
    Ulaz:
    111

    Izlaz:
    1

    Primjer br. 3
    Ulaz:
    233

    Izlaz:
    2

    Ogranienja
    R, G, B [0, 2000000000]
    Vremenska i memorijska ogranienja su dostupna na sistemu za ocjenjivanje.

    You might also like