乘法持久性 - Problem

#22762. 乘法持久性

Statistics

奶牛们在玩一个数字游戏。她们从某个数开始，例如 6593。她们取出各位数字（例如 6、5、9、3），将它们相乘得到乘积（在这里，$6 x 5 x 9 x 3 = 810$）。她们再次进行这个操作（例如 $8 x 1 x 0$），得到 0，这是一个一位数。

帮助奶牛们玩这个游戏。读入一个数，展示得到一位数的各个步骤。

输入格式

一个起始整数 $N$（$10 \le N \le 2{,}000{,}000{,}000$）。

输出格式

一行整数，包含起始数，以及计算过程中依次得到的数，直到得到一位数为止。

样例

输入格式 1

输出格式 1

98886 27648 2688 768 336 54 20 0

题目作者：Russ Cox

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:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0