// CalcManager.h
#pragma once
typedef ttmath::UInt<4> MyBig; //<TTMATH_BITS(64), TTMATH_BITS(512)> MyBig;
class CalcManager
{
public:
    CalcManager(int ThreadNum);
    CalcManager(void);
    ~CalcManager(void);
    void DoCalc();
    BYTE aNumCount[10];
    MyBig llModulo;
    MyBig llRestN;
    MyBig llRestA;
    MyBig i;
    MyBig NumStart;
    MyBig NumEnd;
    int _ThreadNum;
    MyBig BigLongs[6];
    long Longs[6];
    void operator()() { DoCalc(); }
    bool CheckValids();
    bool CheckValidsInProgress();
    bool CheckNumber(MyBig llInput);
    long long GetTimeMs64();
};
// CalcManager.cpp
#include "CalcManager.h"
CalcManager::CalcManager(int ThreadNum)
{
    int sizeo = sizeof(long long);
    this->_ThreadNum = ThreadNum;
    this->llModulo = 0;
    this->llRestA = 0;
    this->llRestN = 0;
    this->NumStart = CALC_START + (ThreadNum * THREAD_NUMBERS);
    this->NumEnd = this->NumStart + THREAD_NUMBERS;
    for (int i = 0; i < 6 ; i++)
    {
        BigLongs[i] = 0x00;
        Longs[i] = 0x00;
    }
}
CalcManager::CalcManager(void)
{
}
CalcManager::~CalcManager(void)
{
}
void CalcManager::DoCalc()
{
    MyBig CounterCopy;
    MyBig ModuloOut;
    long long OldTime = GetTimeMs64();
    for (i = this->NumStart; i < this->NumEnd; i++)
    {
        ZeroMemory((BYTE*)&aNumCount[0],10);
        if (i == 71788112)
            int BREAK = 1337;
        if (CheckNumber(i*i))
            std::cout << "[" << this->_ThreadNum << "] i found: " << i.ToString() << " after " << ((GetTimeMs64()-OldTime)) << " ms [" << (GetTimeMs64()-OldTime)/1000/60 << ":" << ((GetTimeMs64()-OldTime)/1000)%60 << "] ||| Squared: " << (i*i).ToString(10) <<  std::endl;
        /*CounterCopy = i;
        CounterCopy.Div(1000000,&ModuloOut);
        if (ModuloOut == 0)
        {
            std::cout << "[" << this->_ThreadNum << "] Reached: " << i.ToString() << " after " << ((GetTimeMs64()-OldTime)) << " ms [" << (GetTimeMs64()-OldTime)/1000/60 << ":" << ((GetTimeMs64()-OldTime)/1000)%60 << "]" << std::endl;
        }*/
    }
    std::cout << "[" << this->_ThreadNum << "] Finished!" << std::endl;
}
bool CalcManager::CheckValids()
{
    for (int i = 1; i < 10; i++)
    {
        if (this->aNumCount[i] != 0x00 && this->aNumCount[i] != i)
            return false;
    }
    // Es kann vorkommen, dass sich eine 0 reinschleicht:
    std::string result;
    (i*i).ToString(result,10);
    if (strrchr(result.c_str(), '0'))
        return false;
    return true;
}
bool CalcManager::CheckValidsInProgress()
{
    for (int i = 1; i < 10; i++)
    {
        if (this->aNumCount[i] != 0x00 && this->aNumCount[i] > i)
            return false;
    }
    return true;
}
bool CalcManager::CheckNumber(MyBig llInput)
{
    /*llModulo = 10;
    llRestN = 0;
    llRestA = 0;
    MyBig llInputCopy = llInput;*/
    long long RestA = 0;
    long long RestN = 0;
    long long Modulo = 10;
    BYTE iLongCounter = 0;
    BYTE iLongSize = 0x00;
    // Wir teilen die große Zahl in Longs auf -> BigLongs (MyBig) werden mit Rest gefüllt
    do
    {
        llInput.Div(1000000000L, &BigLongs[iLongCounter]);
        iLongCounter++;
    }
    while (llInput.table[0] != 0);
    iLongSize = iLongCounter;
    iLongCounter = 0;
    // Wir füllen die "echten" Long Longs mit Werten
    for (int i = 0; i < iLongSize; i++)
    {
        Longs[i] = BigLongs[i].ToUInt();
    }
    // Wir gehen alle Long Longs durch und schauen was geht...
    for (int i = 0; i < iLongSize; i++)
    {
        while (RestN != Longs[i])
        {
            RestA = Longs[i] % Modulo;
            //llInputCopy = llInput;
            //llInputCopy.Div(llModulo, &llRestA);
            //llRestA -= llRestN;
            //llRestN = llRestA + llRestN;
            RestA -= RestN;
            RestN += RestA;
            if ( RestA == 0)
                return false;
            //llModulo *= 10;
            Modulo *= 10;
            //MyBig llModCopy = llModulo;
            //llModCopy.Div(100);
            //llRestA = llRestA / (llModulo / 100);
            RestA = RestA / (Modulo / 100);
            //aNumCount[llRestA.table[0]]++;
            aNumCount[RestA]++;
            if (!CheckValidsInProgress())
                return false;
        }
        RestA = 0;
        RestN = 0;
        Modulo = 10;
    }
    if (!CheckValids())
        return false;
    //DEBUGPrintNumCount();
    return true;
}
long long CalcManager::GetTimeMs64()
{
 /* Windows */
 FILETIME ft;
 LARGE_INTEGER li;
 /* Get the amount of 100 nano seconds intervals elapsed since January 1, 2025 (UTC) and copy it
  * to a LARGE_INTEGER structure. */
 GetSystemTimeAsFileTime(&ft);
 li.LowPart = ft.dwLowDateTime;
 li.HighPart = ft.dwHighDateTime;
 long long ret = li.QuadPart;
 ret -= 116444736000000000LL; /* Convert from file time to UNIX epoch time. */
 ret /= 10000; /* From 100 nano seconds (10^-7) to 1 millisecond (10^-3) intervals */
 return ret;
}