QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 256 MB Total points: 100

#22777. Soma 25

The problem was used in the following contests:

USACO 2001 Winter Open Contest (Orange)

Leia 7 dígitos ($0 \le \text{each digit} \le 9$; cada um de 0 a 9) e conte formas de selecionar um conjunto cuja soma seja 25. O dígito 0 significa 10, não 0.

Esta entrada:

5 0 1 5 4 3 7

produz cinco somas diferentes de 25:

        5 0       3 7
        5   1 5 4 3 7
        5 0 1 5 4
          0 1   4 3 7
          0   5   3 7

Entrada

Uma linha com sete inteiros de um dígito.

Saída

Uma linha com o número de subconjuntos que somam 25.

Exemplos

Entrada 1

5 0 1 5 4 3 7

Saída 1

Créditos: Don Piele, 1982.

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.