CT26508

The tickets Occurrence Count Puzzle

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

In the maple sugarbush of Saprun, Miller the ledger master keeps careful count of the tickets. chart the migration season, every figure matters. Task: Read n integers and a target x; print how many times x occurs. Input format: First line: n and x. Second line: n space-separated integers. Output format: Print the number of occurrences of x. Constraints: 1 <= n <= 744; 0 <= a[i],x <= 10.

Example 1:

Input: 310 6 4 4 4 6 7 3 7 2 5 9 5 1 7 1 9 9 3 7 3 6 8 0 8 2 3 3 5 8 4 3 4 9 0 0 5 5 8 0 10 7 3 4 0 1 6 7 10 8 2 5 6 1 0 1 4 4 3 4 3 10 7 0 5 0 5 1 0 8 9 2 4 8 8 6 1 1 1 7 7 1 0 6 10 1 2 10 8 8 10 7 0 5 3 2 0 6 3 3 0 1 9 1 4 7 4 7 3 9 5 0 0 7 7 7 9 5 3 8 7 7 0 5 0 0 7 8 0 10 10 7 1 9 0 3 2 6 6 0 1 1 7 7 8 7 9 10 1 3 2 0 3 2 6 2 9 4 6 3 0 1 2 6 6 7 0 1 4 7 2 5 8 9 8 1 10 7 9 10 8 7 6 9 4 3 1 9 1 0 6 9 6 6 5 8 2 8 3 0 4 1 7 9 0 4 2 9 9 3 10 6 7 3 0 4 1 0 5 3 0 10 10 5 7 4 2 10 1 3 10 10 7 3 10 4 2 3 4 2 4 6 4 1 4 5 8 8 2 3 8 0 4 5 8 0 9 6 5 3 6 2 2 0 8 8 3 0 9 1 0 6 3 0 3 3 0 2 9 1 2 3 1 0 0 0 8 4 5 9 10 0 5 8 2 7 9 10 3 10 8 0 9 4 9 8 3 6 1 9 10 10
Output: 23

Example 2:

Input: 8 5 1 5 6 2 2 7 6 4
Output: 1

Example 3:

Input: 642 4 5 3 2 8 0 2 1 2 10 2 2 4 9 1 2 10 7 0 9 3 5 7 2 8 9 1 3 1 7 4 2 6 3 0 9 4 2 5 6 1 5 8 4 7 10 6 4 6 5 0 9 2 1 7 8 5 1 0 7 3 3 3 8 4 1 5 2 2 2 2 6 1 6 4 10 9 0 2 9 0 0 5 1 0 7 10 4 1 9 1 7 4 10 6 9 10 2 4 0 10 8 7 9 0 8 2 5 1 1 0 0 6 9 9 5 1 0 3 3 0 4 3 4 8 0 7 10 9 3 4 5 3 8 5 1 3 6 2 6 6 1 5 2 8 3 9 9 7 4 6 3 8 8 5 6 5 10 1 3 3 1 3 9 8 7 10 5 9 9 1 10 4 9 5 2 0 9 3 1 4 3 8 7 1 9 2 2 7 5 0 0 1 4 7 2 7 5 8 10 10 1 3 5 7 8 7 0 4 6 7 0 2 9 8 3 9 3 10 8 8 9 4 6 0 8 0 9 3 1 5 10 0 1 10 10 2 9 4 1 2 7 8 0 0 8 0 1 10 8 1 5 4 7 5 3 5 4 5 2 8 0 0 7 8 5 5 2 1 5 9 7 4 5 1 0 7 2 4 6 5 6 3 9 5 4 9 8 9 10 5 4 9 7 5 6 3 10 7 2 5 7 0 6 1 3 5 0 6 3 0 4 6 9 4 4 9 4 8 8 2 10 3 8 6 7 9 3 2 2 4 10 6 10 5 10 6 10 5 4 10 9 7 8 8 10 0 9 4 7 10 6 2 3 2 10 4 1 5 0 10 1 4 9 0 1 4 10 0 10 7 10 7 4 6 2 8 10 3 2 1 2 7 9 6 0 8 6 0 3 5 4 9 7 2 8 5 1 6 8 8 2 2 5 6 3 9 8 3 10 4 2 6 0 9 4 6 7 9 5 8 7 8 4 10 7 9 9 7 3 0 10 9 7 8 0 5 10 3 4 4 5 0 4 3 4 2 7 2 6 6 5 0 5 8 0 8 5 5 8 0 9 4 10 8 7 0 7 8 9 0 2 0 9 8 4 9 9 2 9 2 3 4 8 5 4 8 1 3 2 3 6 4 3 3 2 1 3 6 8 9 5 5 7 10 8 5 1 1 9 8 5 0 6 6 1 1 2 1 8 10 0 2 1 6 4 5 6 6 0 4 8 5 7 3 3 8 5 9 10 9 0 10 2 10 10 8 1 0 0 8 6 3 7 6 0 8 2 0 8 7 0 8 8 2 5 10 4 2 0 7 4 5 9 1 3 3 8 8 0 5 1 5 10 7 0 8 7 2 6 8 0 1 3 7 3 0 10 3 10 0 8 2 4 8 1 10 5 7 1 4 2 5 8 8 5 3 0 8 4 4 7 6 8 2 8 8 8 1 0 2 1 3 2 3 9 3 7 8 1 4 0 1
Output: 59

Constraints:

1 <= n <= 744; 0 <= a[i],x <= 10.

Loading...
Test Cases:No test cases
No test cases available.