🛸目录
🚀题目描述
🚀代码(仅供参考)
因为蓝桥杯系统该题的调试还没有上线,因此该代码仅供参考!
import java.util.Scanner;
public class Main {
static boolean judge(long k, long M, int n) {
long m = 5;
while (n >= 1) {
k -= (M / m);
--n;
m *= 5;
}
return k == 0;
}
static double[] nums = new double[30];
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
long k = cin.nextLong();
for (int i = 1; i < 30; ++i) {
nums[i] = (4 * k) / (1 - Math.pow(0.2, i * 1.0));
}
for (int i = 1; i < 30; ++i) {
double cur = Math.pow(5, i);
double tCur = Math.pow(5, i + 1);
if (nums[i] >= cur && nums[i]*1.0 < tCur) {
long lI = (long) (nums[i]);
int mod = (int) (lI % 5);
if (lI != nums[i]) {
lI += 5;
}
lI -= mod;
if (judge(k, lI, i)) {
System.out.println(lI);
return;
}
}
}
System.out.println(-1);
}
}