#include #include "string.h" #include "ctype.h" #include "stdlib.h" #define STR_HELPER(x) #x #define STR(x) STR_HELPER(x) #define MAXLEN_NUM 5000 #define sSCANFORMAT "%" STR(MAXLEN_NUM) "s" void MulCHarNumByDig1Dig(char* cNums, int iVal) { if(cNums[0] == 0)return; if(cNums[0] == '0')return; int iLen = strlen(cNums); char* sc = cNums; char c = '0'; int r, rl; rl = 0; for(int i=iLen - 1; i >= 0; i--){ c = sc[i]; r = rl + ((int)c - (int)'0') * iVal; if(r <= 9){ rl = 0; sc[i] = (int)'0' + (char)r; }else{ rl = r / 10; sc[i] = (int)'0' + (char)(r % 10); }; }; if(rl != 0){ c = (int)'0' + (char)rl; memmove(cNums+1, cNums, iLen); iLen++; cNums[0] = c; } cNums[iLen] = 0; } void MulCHarNumBy10Pow(char* cNums, int iTenPow) { int iLen = strlen(cNums); if(cNums[0] == 0)return; if(cNums[0] == '0')return; if(iTenPow < 0){ if( -iTenPow >= iLen){ cNums[0] = '0'; cNums[1] = 0; return; }; }; if(iTenPow > 0){ memset(cNums + iLen, '0', iTenPow); cNums[iLen + iTenPow] = 0; } else { if( -iTenPow <= iLen ){ cNums[iLen + iTenPow] = 0; } else { cNums[0] = 0; }; }; return; } int MulOneBy10Pow(int iCnt){ //ограничение длинны числа множителя в степенях 10 для int if( iCnt > 9 )return 0; int iMulRes = 1; do{ iCnt--; iMulRes = iMulRes * 10; }while( iCnt ); return iMulRes; } int CalcDigCnt(int iVal){ int iCnt = 0; do{ iCnt++; iVal = iVal / 10; }while( iVal ); return iCnt; } typedef struct{ int iSize; char* cNums; } cNumsSumMulDig_t; void SumTwoCharNums(char* cNums1, char* cNums2) { int iLen1 = strlen(cNums1); int iLen2 = strlen(cNums2); int iMaxLen = (iLen1 > iLen2)?iLen1:iLen2; int iDig = 0; int iDig1Chr = 0; int iDig2Chr = 0; int iExtraVal = 0; while(iDig < iMaxLen){ if(iDig >= iLen1){ memmove(cNums1+1, cNums1, iLen1); cNums1[0] = '0'; iLen1++; cNums1[iLen1] = 0; }; iDig1Chr = iLen1 - iDig - 1; iDig2Chr = iLen2 - iDig - 1; if(iDig >= iLen2){ cNums1[iDig1Chr] += iExtraVal; } else { cNums1[iDig1Chr] += (cNums2[iDig2Chr] - '0') + iExtraVal; }; iExtraVal = 0; if(cNums1[iDig1Chr] > '9'){ iExtraVal = 1; cNums1[iDig1Chr] -= 10; }; iDig++; }; if(iExtraVal){ memmove(cNums1+1, cNums1, iLen1); cNums1[0] = '1'; iLen1++; } cNums1[iLen1] = 0; } void SubTwoCharNums(char* cNums1, char* cNums2) { int iLen1 = strlen(cNums1); int iLen2 = strlen(cNums2); int iMaxLen = (iLen1 > iLen2)?iLen1:iLen2; int iDig = 0; int iDig1Chr = 0; int iDig2Chr = 0; int iExtraVal = 0; while(iDig < iMaxLen){ if(iDig >= iLen1){ memmove(cNums1+1, cNums1, iLen1); cNums1[0] = '0'; iLen1++; cNums1[iLen1] = 0; }; iDig1Chr = iLen1 - iDig - 1; iDig2Chr = iLen2 - iDig - 1; if(iDig >= iLen2){ cNums1[iDig1Chr] -= iExtraVal; } else { cNums1[iDig1Chr] -= (cNums2[iDig2Chr] - '0') + iExtraVal; }; iExtraVal = 0; if(cNums1[iDig1Chr] < '0'){ iExtraVal = 1; cNums1[iDig1Chr] += 10; }; iDig++; }; if(iExtraVal){ for(iDig = 0;iDig < iLen1; iDig++){ iDig1Chr = iLen1 - iDig - 1; cNums1[iDig1Chr] = (9 - (cNums1[iDig1Chr] - '0')) + '0'; }; for(iDig = 0;iDig < iLen1; iDig++){ iDig1Chr = iLen1 - iDig - 1; if(iDig == 0){ cNums1[iDig1Chr] += 1; } else cNums1[iDig1Chr] += iExtraVal; iExtraVal = 0; if(cNums1[iDig1Chr] > '9'){ iExtraVal = 1; cNums1[iDig1Chr] -= 10; } else break; }; while(cNums1[0] == '0' && iLen1>0 ){ memmove(cNums1, cNums1+1, iLen1 - 1); iLen1--; cNums1[iLen1] = 0; }; if(iLen1 == 0){ cNums1[iLen1] = '0'; iLen1++; }; if(cNums1[0] != '0'){ memmove(cNums1+1, cNums1, iLen1); cNums1[0] = '-'; iLen1++; }; } else { while(cNums1[0] == '0' && iLen1>0 ){ memmove(cNums1, cNums1+1, iLen1 - 1); iLen1--; cNums1[iLen1] = 0; }; if(iLen1 == 0){ cNums1[iLen1] = '0'; iLen1++; }; }; cNums1[iLen1] = 0; } void DivOneByDigWithPrecis( int iDivVal, int precission, char* cFrstDec, char* cResNumsMulTenPrec, int cResSize ) { *cFrstDec = '0'; int iStep; char* pResNumsPos; memset(cResNumsMulTenPrec, 0, cResSize); if( precission > (cResSize - 1) )return; if( iDivVal == 1 ){ *cFrstDec = '1'; iStep = precission; pResNumsPos = cResNumsMulTenPrec; while( iStep-- > 0 )*( pResNumsPos++ ) = '0'; return; }; int iDivValDig = CalcDigCnt( iDivVal ); //ограничение длинны числа делителя в степенях 10 для int if( iDivValDig > 8 )return; pResNumsPos = cResNumsMulTenPrec; int iCntFillZeros = (iDivValDig - 1); if( iCntFillZeros ){ while( iCntFillZeros-- > 0 )*( pResNumsPos++ ) = '0'; }; iStep = precission - 1; int iPos = precission - (iDivValDig - 1); int iPartDividend = MulOneBy10Pow( iDivValDig ); int iCalcMulDivInPartDividend = 0; while( iPos > 0 ){ iCalcMulDivInPartDividend = 0; if( iPartDividend ){ while( iPartDividend >= iDivVal ){ iPartDividend -= iDivVal; iCalcMulDivInPartDividend++; }; if( iCalcMulDivInPartDividend == 10 ){ *pResNumsPos = '1'; pResNumsPos++; *pResNumsPos = '0'; pResNumsPos++; iPos -= 2; } else { *pResNumsPos = (char)((int)'0' + iCalcMulDivInPartDividend); pResNumsPos++; iPos -= 1; }; } else { *pResNumsPos = '0'; pResNumsPos++; iPos -= 1; }; if(iPos){ iPartDividend *= 10; iStep--; }; }; if( (iPartDividend << 1) >= iDivVal ){ SumTwoCharNums(cResNumsMulTenPrec, (char*)"1"); }; } typedef struct{ const char* cNumU; const char* cNumD; } cCharNumsPair_t; int test_AddSubMulDigPow() { // U / D char cNumU[MAXLEN_NUM + 1]={0}; char cNumD[MAXLEN_NUM + 1]={0}; const cCharNumsPair_t acCharNumsPairs[] = { { "9999999999", "12345678" }, { "12345678", "9999999999" }, { "10000000000000000000000000000000000000000000000000000000000000000000000000000000000", "0" }, { "0", "10000000000000000000000000000000000000000000000000000000000000000000000000000000000" }, { "123", "7777777" }, { "7777777", "123" }, { "123456789098765432123456789098765532134678876553248863743245556789966543334667899988776544334567654445566777777654322245667899877655443333356777775455566788766443234", "456789098765432123456789098765532134678876553248863743245789966765543334667899988776544334567654445566777777654322245667899877655443333356777775455566788766443234" } }; int iacCharNumsPairsSie = sizeof(acCharNumsPairs)/sizeof(cCharNumsPair_t); int bCheck = 1; int iNumLen; char cNumTest[MAXLEN_NUM + 1]={0}; int iTestPair = 0; while(iTestPair < iacCharNumsPairsSie){ memset(cNumU, 0, MAXLEN_NUM + 1); memset(cNumD, 0, MAXLEN_NUM + 1); strcpy(cNumU, acCharNumsPairs[iTestPair].cNumU ); strcpy(cNumD, acCharNumsPairs[iTestPair].cNumD ); printf("\nTest the pair -> dividend \"%s\" and divider \"%s\"\n", cNumU, cNumD); iNumLen= strlen(cNumU); for(int i=0;i

Experiments with numbers in strings - functions +, -, * and then and /, roots