CPMagical CP Library

Problem solution · C++

ABC192 C — Kaprekar Number

ABC192 C — Kaprekar Number: a C++ solution using sorting and greedy selection. Learn the idea, check the complexity, and read the full code, with credit to michimani AtCoder Solutions.

Technique
Sorting and greedy selection
Source
michimani AtCoder Solutions
Length
33 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sorting and greedy selection

For ABC192 C — Kaprekar Number, the implementation first exposes a useful order, then scans that order while making locally justified choices.

  1. Choose the key that reveals the greedy or grouping structure.
  2. Sort the relevant records by that key.
  3. Scan in order, maintaining the invariant that makes each local choice safe.

Code notes

  • 33 lines of C++ from the credited upstream file abc192_c.cpp.
  • The implementation keeps its working state in language-native values and containers.
  • 2 loop blocks detected.

Complexity

Sorting is typically the dominant term unless the subsequent scan uses a more expensive nested operation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from michimani AtCoder Solutions by michimani and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeABC192 C — Kaprekar Number · C++C++
Use this to learn the idea, then write your own version.
#include <algorithm>#include <iostream> using namespace std;using ui = unsigned int;using ull = unsigned long long; ull f(ull x) {    string xs = to_string(x);    sort(xs.begin(), xs.end());     ui L = ui(xs.length());    ull g1 = 0, g2 = 0;    ull d = 1;    for (ui i = 0; i < L; i++) {        g1 += ull(xs[i] - '0') * d;        g2 += ull(xs[L - 1 - i] - '0') * d;        d *= 10;    }     return g1 - g2;} int main() {    ull n, k;    cin >> n >> k;     ull a = n;    for (ui i = 0; i < k; i++) a = f(a);     cout << a << endl;    return 0;}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗