QOJ.ac

QOJ

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

#22777. Suma 25

The problem was used in the following contests:

USACO 2001 Winter Open Contest (Orange)

Wczytaj 7 cyfr ($0 \le \text{each digit} \le 9$; każda od 0 do 9) i policz sposoby wyboru zbioru cyfr o sumie 25. Cyfra 0 oznacza 10, nie 0.

To wejście:

5 0 1 5 4 3 7

daje pięć różnych sum równych 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

Wejście

Jeden wiersz z siedmioma jednocyfrowymi całkowitymi.

Wyjście

Jeden wiersz z liczbą podzbiorów o sumie 25.

Przykład

Wejście 1

5 0 1 5 4 3 7

Wyjście 1

Źródło: 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.