import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.StringTokenizer; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class row { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); ROW solver = new ROW(); solver.solve(1, in, out); out.close(); } static class ROW { private static final long MAX = 1000000000000000000L; public void solve(int testNumber, InputReader in, PrintWriter out) { long k = in.nextLong(); long a = in.nextLong(); long b = in.nextLong(); int ans = 0; for (int f = 0; f <= 18 * 81; f++) { //f = n/k if (f <= MAX / k) { long N = f * k; if (a <= N && N <= b && fun(N) == f) { ans++; } } } out.println(ans); } private int fun(long n) { int ans = 0; while (n > 0) { long d = n % 10; ans += d * d; n /= 10; } return ans; } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public long nextLong() { return Long.parseLong(next()); } } }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 | import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.StringTokenizer; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class row { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); ROW solver = new ROW(); solver.solve(1, in, out); out.close(); } static class ROW { private static final long MAX = 1000000000000000000L; public void solve(int testNumber, InputReader in, PrintWriter out) { long k = in.nextLong(); long a = in.nextLong(); long b = in.nextLong(); int ans = 0; for (int f = 0; f <= 18 * 81; f++) { //f = n/k if (f <= MAX / k) { long N = f * k; if (a <= N && N <= b && fun(N) == f) { ans++; } } } out.println(ans); } private int fun(long n) { int ans = 0; while (n > 0) { long d = n % 10; ans += d * d; n /= 10; } return ans; } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public long nextLong() { return Long.parseLong(next()); } } } |