{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fninoseki.hatenablog.com%2Fentry%2F2013%2F01%2F05%2F193551\" title=\"Codeforces Round #158 (Div. 2)  - ninoseki&#39;s blog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_title":"ninoseki's blog","type":"rich","author_url":"https://blog.hatena.ne.jp/ninoseki/","author_name":"ninoseki","image_url":null,"url":"https://ninoseki.hatenablog.com/entry/2013/01/05/193551","description":"http://www.codeforces.com/contest/260 A,B\u554f\u984c\u3060\u3051\u3002 A. Adding Digits def op(a, b) for i in 0 .. 9 do c = a * 10 + i return c if c % b == 0 end -1 end a, b, n = gets.chomp.split(\" \").map{|n| n.to_i} c = op(a, b) if c == -1 puts -1 else puts c.to_s + \"0\" * (a.to_s.length + n - c.to_s.length) end B. Ancient\u2026","version":"1.0","blog_url":"https://ninoseki.hatenablog.com/","width":"100%","title":"Codeforces Round #158 (Div. 2) ","published":"2013-01-05 19:35:51","categories":[],"provider_name":"Hatena Blog","height":"190","provider_url":"https://hatena.blog"}