QOJ.ac

QOJ

Süre Sınırı: 2 s Bellek Sınırı: 1024 MB Toplam puan: 100

#23880. 數位和

İstatistikler

題目描述

JOI 君最初持有某個喺 $1$ 以上 $N$ 以下嘅整數。JOI 君執行咗 $0$ 次或以上嘅以下操作之後,佢所持有嘅整數變成咗 $N$:

  • 將目前持有嘅整數喺$10$ 進制表示下嘅各位數字之和,加到目前持有嘅整數上面。

給定 $N$,請編寫一個程式,求出 JOI 君最初可能持有嘅整數嘅個數。

數據範圍

  • $1 \le N \le 1\,000\,000$。
  • $N$ 係整數。

輸入格式

輸入由標準輸入按以下格式給出:

N

輸出格式

輸出 $1$ 行,代表 JOI 君最初可能持有嘅整數嘅個數。

樣例 1

輸入

13

輸出

4

例如,如果 JOI 君最初持有整數 $5$,並執行咗 $3$ 次操作,就會按 $5 \to 10 \to 11 \to 13$ 變化。JOI 君最初可能持有嘅整數只有 $5, 10, 11, 13$ 呢 $4$ 個。

樣例 2

輸入

20

輸出

1

樣例 3

輸入

2019

輸出

449

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.