{"problem":{"name":"H. Levenshtein Distance","description":{"content":"","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":524288},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10242H"},"statements":[{"statement_type":"Markdown","content":"[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ t \\in \\mathbb{Z} $ be the number of test cases.  \nLet $ T = \\{(n_k, A_k) \\mid k \\in \\{1, \\dots, t\\}\\} $ be the set of test cases, where for each $ k $:  \n- $ n_k \\in \\mathbb{Z} $ denotes the length of the sequence.  \n- $ A_k = (a_{k,1}, a_{k,2}, \\dots, a_{k,n_k}) $ is a sequence of integers.  \n\n**Constraints**  \n1. $ 1 \\le t \\le 1000 $  \n2. For each $ k \\in \\{1, \\dots, t\\} $:  \n   - $ 1 \\le n_k \\le 50 $  \n   - $ 1 \\le a_{k,i} \\le 100 $ for all $ i \\in \\{1, \\dots, n_k\\} $  \n\n**Objective**  \nFor each test case $ k \\in \\{1, \\dots, t\\} $, compute:  \n$$ S_k = \\sum_{i=1}^{n_k} (-1)^{i-1} a_{k,i} $$","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10242H","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}