Submission #20300050


Source Code Expand

Copy
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const K = readInt();
      
      long n = N;
      foreach (_; 0 .. K) {
        auto cs = cast(byte[])(cast(char[])(n.to!string));
        auto ds = cs.dup;
        cs.sort.reverse;
        ds.sort;
        long x, y;
        foreach (c; cs) x = x * 10 + (c - '0');
        foreach (c; ds) y = y * 10 + (c - '0');
        n = x - y;
      }
      writeln(n);
    }
  } catch (EOFException e) {
  }
}

Submission Info

Submission Time
Task C - Kaprekar Number
User hos_lyric
Language D (LDC 1.20.1)
Score 300
Code Size 1691 Byte
Status AC
Exec Time 45 ms
Memory 4012 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 31
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, random_27.txt, random_28.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
random_01.txt AC 45 ms 3856 KB
random_02.txt AC 4 ms 3320 KB
random_03.txt AC 33 ms 3832 KB
random_04.txt AC 4 ms 3112 KB
random_05.txt AC 44 ms 3956 KB
random_06.txt AC 4 ms 3296 KB
random_07.txt AC 44 ms 3888 KB
random_08.txt AC 5 ms 3296 KB
random_09.txt AC 42 ms 3964 KB
random_10.txt AC 3 ms 3400 KB
random_11.txt AC 31 ms 4000 KB
random_12.txt AC 4 ms 3292 KB
random_13.txt AC 41 ms 4012 KB
random_14.txt AC 5 ms 3192 KB
random_15.txt AC 38 ms 3844 KB
random_16.txt AC 4 ms 3400 KB
random_17.txt AC 39 ms 3960 KB
random_18.txt AC 3 ms 3224 KB
random_19.txt AC 37 ms 3840 KB
random_20.txt AC 4 ms 3108 KB
random_21.txt AC 27 ms 3724 KB
random_22.txt AC 22 ms 3860 KB
random_23.txt AC 26 ms 3876 KB
random_24.txt AC 29 ms 3836 KB
random_25.txt AC 30 ms 3804 KB
random_26.txt AC 30 ms 3804 KB
random_27.txt AC 27 ms 3864 KB
random_28.txt AC 31 ms 3972 KB
sample_01.txt AC 4 ms 3284 KB
sample_02.txt AC 4 ms 3288 KB
sample_03.txt AC 30 ms 3832 KB