C++ · Solution

Happy Number

This C++ solution uses string processing for Happy Number. Read the reasoning, inspect the code, or try your own test case below.

MathString processingC++27 lines
Solution107of 248
Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

String processing

Happy Number: scan the character sequence while maintaining the positions, counts, or partial match information required to construct the answer.

Strings

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

View exact source file ↗
Implementation

B_Happy_Number.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        string s; cin >> s;
        int mx = 1e6;
        auto happy = [&] (string ss) {
            int cnt = 0;
            for (int i = 0; i < ss.size(); i++) {
                int c  = ss[i] - '0';
                cnt += c * c;
            }
            
            return to_string(cnt);
        };
        while (mx--) {
            if (stoi(s) == 1) {
                cout << "Yes" << '\n';
                return 0;
            }
            s = happy(s);
        }
        cout << "No" << '\n';
        return 0;
    }
     
        

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 ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.