{"image_url":"https://cdn.user.blog.st-hatena.com/default_entry_og_image/154149487/1553670776372553","author_url":"https://blog.hatena.ne.jp/amifiable/","blog_title":"\u3042\u308b\u30a8\u30f3\u30b8\u30cb\u30a2\u306eAtCoder\u596e\u95d8\u8a18","version":"1.0","provider_name":"Hatena Blog","blog_url":"https://ami-atcoder.hatenablog.com/","author_name":"amifiable","published":"2019-07-05 14:52:02","categories":["\u7af6\u30d7\u30ed","AtCoder","ABC068","D\u554f\u984c","600\u70b9","Python"],"width":"100%","url":"https://ami-atcoder.hatenablog.com/entry/20190705/1562305922","height":"190","type":"rich","provider_url":"https://hatena.blog","title":"AtCoder ABC 068 D - Decrease (Contestant ver.) (Python)","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fami-atcoder.hatenablog.com%2Fentry%2F20190705%2F1562305922\" title=\"AtCoder ABC 068 D - Decrease (Contestant ver.) (Python) - \u3042\u308b\u30a8\u30f3\u30b8\u30cb\u30a2\u306eAtCoder\u596e\u95d8\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","description":"irisrune\u3067\u3059\u3002\u6d41\u77f3\u306bABC132F\u306f\u96e3\u3057\u3059\u304e\u305f\u306e\u3067\u4e45\u3005\u306b\u904e\u53bb\u554f\u3067\u3059\u3002 \u554f\u984c atcoder.jp \u64cd\u4f5c\u3092\u884c\u3063\u305f\u7d50\u679c\u3068\u3057\u3066\u72b6\u614b\u304c\u3069\u306e\u3088\u3046\u306b\u5909\u308f\u308b\u304b\u3001\u3069\u306e\u3088\u3046\u306a\u72b6\u614b\u304c\u505c\u6b62\u72b6\u614b\u3068\u306a\u308b\u304b\u3092\u628a\u63e1\u3059\u308b\u3053\u3068\u304c\u91cd\u8981\u3067\u3059\u3002 import sys import numpy as np def main(): k = int(input()) n = 50 an = [n - 1 + (k // n) - (k % n) for _ in range(n)] for i in range(k % n): an[i] += n + 1 print(n) print(*an) main() \u516c\u5f0f\u89e3\u8aac\u3067\u306f\u3044\u304d\u306a\u308a\u2026"}