A12542 | Nirvana
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Kurt reaches nirvana when he finds the product of all the digits of some positive integer. Greater value of the product makes the nirvana deeper.
Help Kurt find the maximum possible product of digits among all integers from $1$ to $n$ .
Help Kurt find the maximum possible product of digits among all integers from $1$ to $n$ .
输入格式
The only input line contains the integer $n$ ( $1 \le n \le 2\cdot10^9$ ).
输出格式
Print the maximum product of digits among all integers from $1$ to $n$ .
输入输出样例
输入 #1
390
输出 #1
216
输入 #2
7
输出 #2
7
输入 #3
1000000000
输出 #3
387420489
In the first example the maximum product is achieved for $389$ (the product of digits is $3\cdot8\cdot9=216$ ).
In the second example the maximum product is achieved for $7$ (the product of digits is $7$ ).
In the third example the maximum product is achieved for $999999999$ (the product of digits is $9^9=387420489$ ).
In the second example the maximum product is achieved for $7$ (the product of digits is $7$ ).
In the third example the maximum product is achieved for $999999999$ (the product of digits is $9^9=387420489$ ).
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted