Coding

Perfect Sums

existing in an array. $999.$

Input Specification:

inputt: An integer value representing the length of the integat arrag. input$2$: An integer array of length $N.$

input$3$: An integer value representing the number, the peted sum nure be ciqut to$.$

Output Specification:

Return the number of perfect sums exising in the arap.

Example $1$:

input$1$: $5$

inpute: $\{9,7,3,12,7\}$

input$3$: $14$

Output $1$

Explanation:

Here, the sum of elements $7+7=14.$ Hence the aubler of pelect ens in be gien