草坪做过aeration和over seeding以后要做什么？# Living
y*n
1 楼
Find the max integer which satisfies the following requirement:
Starting from left most digit, each digit's position k can be counted as 1,
2, 3, ...., n
The number left to this digit (including current digit), should be divisible
by the current count.
Example:
96005
k=1, value is 9
k=2, value is 96
k=3, value is 960
k=4, value is 9600
k=5, value is 96005
So this int satisfy the requirement, but of course this is just example, so
not the max int satisfies this
requirement.
Any idea how to solve it mathematically or programmatically?
Starting from left most digit, each digit's position k can be counted as 1,
2, 3, ...., n
The number left to this digit (including current digit), should be divisible
by the current count.
Example:
96005
k=1, value is 9
k=2, value is 96
k=3, value is 960
k=4, value is 9600
k=5, value is 96005
So this int satisfy the requirement, but of course this is just example, so
not the max int satisfies this
requirement.
Any idea how to solve it mathematically or programmatically?
