{"problem":{"name":"Consecutive Integers","description":{"content":"Snuke has $N$ integers: $1,2,\\ldots,N$. He will choose $K$ of them and give those to Takahashi. How many ways are there to choose $K$ consecutive integers?","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"diverta2019_a"},"statements":[{"statement_type":"Markdown","content":"Snuke has $N$ integers: $1,2,\\ldots,N$. He will choose $K$ of them and give those to Takahashi.\nHow many ways are there to choose $K$ consecutive integers?\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq K \\leq N \\leq 50$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"diverta2019_a","tags":[],"sample_group":[["3 2","2\n\nThere are two ways to choose two consecutive integers: $(1,2)$ and $(2,3)$."],["13 3","11"]],"created_at":"2026-03-03 11:01:14"}}