AcWing 郑轻 3104. 不会Dynamic Programming怎么办 (运算
原题链接
简单
作者:
JustDoIt11
,
2023-12-03 18:10:52
,
所有人可见
,
阅读 51
import java.util.Scanner;
public class F {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt(), b = sc.nextInt(), ans = sc.nextInt();
int now = 0;
int bw = (int) Math.log10(b) + 1;
int aw = (int) Math.log10(a) + 1;
if (bw == aw) {
now = (b - a + 1) * bw;
// System.out.println("debug -> : " + now);
if (now == ans) System.out.println("nizhenlihai!");
else System.out.println("laji");
return ;
}
for (int i = aw; i <= bw - 1; i ++ ) {
if (i == aw) now += ((int) Math.pow(10, aw) - a) * aw;
else now += ((int) Math.pow(10, i) - (int) Math.pow(10, i - 1)) * i;
}
// System.out.println("now -> " + now);
now += (b - ((int) Math.pow(10, bw - 1)) + 1) * bw;
// System.out.println("debug -> : " + now);
if (now == ans) System.out.println("nizhenlihai!");
else System.out.println("laji");
}
}