Начало
ЗадачиПодразделы
Другие разделы
Дата и время
20/12/2024 09:45:41
STL
Collection of Postage Stamps
Динамическое программирование и запоминающие функцииБитовые массивы
Олимпиадные задачи на английском языке
Алгоритмы и классы STL
| 25/04/2003 | 7-й Чемпионат Урала. 2 тур (3) |
| 03/07/2006 | Лето 2006 дорешивание ( 1D) |
| 03/07/2006 | Лето 2006 - 1 (D) |
| 08/07/2013 | Лето 2013-5 (C) |
| 05/10/2023 | Занятие 1 (проводит test2) (A) |
| 11/10/2023 | Занятие 2 (проводит test2) (A) |
Ограничения: время – 300ms/2s, память – 32MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0) 
Bob collects postage stamps. Every stamp has not only a nice picture, but also a number, which is nominal cost. Once Bob decided to count how many different sums may be composed from his stamps, but after some thousands variants he lost his way. He needs your help badly!
Write the program for calculation of the quantity of different sums, which may be composed from Bob’s stamps.
Input
The first line of the input file contains an integer `N\ (1≤N≤1000)`, which is equal to the amount of Bob’s stamps. The following `N` lines contain the nominal costs of Bob’s stamps (a single integer from 1 to 1000 in a line).
Output
Write into the output file the quantity of different sums, which may be composed from stamps of given nominal costs.
Sample of input
3 1 3 4
Output for the sample input
7
