{"problem":{"name":"035. Distinct Numbers","description":{"content":"You have a list of numbers. You want to figure out how many distinct (different) numbers are in the list. For example, the list _[1, 2, 3, 4, 4, 5, 5]_ has 5 distinct numbers. The first line of input","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10269035"},"statements":[{"statement_type":"Markdown","content":"You have a list of numbers. You want to figure out how many distinct (different) numbers are in the list. For example, the list _[1, 2, 3, 4, 4, 5, 5]_ has 5 distinct numbers.\n\nThe first line of input contains a single positive integer $n$: the number of items in the list. The next line contains $n$ space-separated integers: the list.\n\nOutput a single positive integer $d$: the number of distinct numbers in the list.\n\n## Input\n\nThe first line of input contains a single positive integer $n$: the number of items in the list. The next line contains $n$ space-separated integers: the list.\n\n## Output\n\nOutput a single positive integer $d$: the number of distinct numbers in the list.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of elements in the list.  \nLet $ A = (a_1, a_2, \\dots, a_n) $ be a sequence of integers.\n\n**Constraints**  \n$ n \\geq 1 $, and $ a_i \\in \\mathbb{Z} $ for all $ i \\in \\{1, \\dots, n\\} $.\n\n**Objective**  \nCompute $ d = \\left| \\{ a_1, a_2, \\dots, a_n \\} \\right| $, the cardinality of the set of distinct elements in $ A $.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10269035","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}