#include #include #include #include #include typedef struct { unsigned long long int iCntCmb; char *cSArr; char *cSArrCpy; int iSiArrSize; int i; unsigned long long int iCmbIdx; int iCmbDel; unsigned long long int iCmbR0; int iCmbR1; char *cPos; char *cPos2, *cPosE; unsigned long long int iCmbR2; } permutationNpp_byCmbVal_Vars_t; int permutationNpp_byCmbVal( char* cArr, int iArrSize, char* cCmbArr, int iCmbArrSize, unsigned long long int *pAiCmbNpp, int iAiCmbNppMaxSize, int *iAiCmbNppSize, permutationNpp_byCmbVal_Vars_t* pHS ); unsigned long long int simple_fact_ulli(unsigned long long int i); int main() { char str[] = "CONGRATULATION! :)"; char cmbstr[ sizeof(str) ] = {0}; strcpy( cmbstr, "CONGRATULATION! :)" ); int iArrSize = strlen(str); int iCmbArrSize = strlen(cmbstr); permutationNpp_byCmbVal_Vars_t HS; HS.cSArr = (char*)calloc( sizeof(char), iArrSize ); HS.cSArrCpy = (char*)calloc( sizeof(char), iArrSize ); unsigned long long int pAiCmbNpp[100]; int iAiCmbNppMaxSize = sizeof(pAiCmbNpp)/sizeof(pAiCmbNpp[0]); int iAiCmbNppSize = 0; printf("\nCalculating serial number of permutation by value [%s]: \n", cmbstr); if( permutationNpp_byCmbVal( str, iArrSize, cmbstr, iCmbArrSize, pAiCmbNpp, iAiCmbNppMaxSize, &iAiCmbNppSize, &HS ) ){ for( int i = 0; i < iAiCmbNppSize ; i++ ){ printf("Result \"%s\" Serial Number [%10llu] \n", cmbstr, pAiCmbNpp[ i ]); }; } else { printf("Invalid parameters passed.\n"); }; free(HS.cSArrCpy); free(HS.cSArr); return 0; }; unsigned long long int simple_fact_ulli(unsigned long long int i){ if(i == 1)return 1; return i * simple_fact_ulli( i - 1 ); }; int charcmp( const void* a, const void* b) { return (*(char*)a == *(char*)b) ?0:(*(char*)a < *(char*)b)?-1:1; }; void print_intarr( char* pValArr, int iSize){ printf(" pValArr { "); for( int i = 0; i < iSize; i++){ printf("'%c', ", pValArr[ i ] ); } printf(" }\n "); } int permutationNpp_byCmbVal( char* cArr, int iArrSize, char* cCmbArr, int iCmbArrSize, unsigned long long int *pAiCmbNpp, int iAiCmbNppMaxSize, int *iAiCmbNppSize, permutationNpp_byCmbVal_Vars_t* pHS) { int iRes = 0; if( pHS == NULL )return iRes; if( iArrSize <= 0 )return iRes; if( iArrSize != iCmbArrSize )return iRes; if( pAiCmbNpp == NULL )return iRes; if( iAiCmbNppMaxSize <= 0 )return iRes; pHS->iSiArrSize = iArrSize; memcpy( pHS->cSArr, cArr, iArrSize ); qsort( pHS->cSArr, iArrSize, sizeof(char), charcmp ); memcpy( pHS->cSArrCpy, cCmbArr, iArrSize ); qsort( pHS->cSArrCpy, iArrSize, sizeof(char), charcmp ); //Check cCmbArr is permutation of cArr if( memcmp(pHS->cSArr, pHS->cSArrCpy, iArrSize) != 0 ){ return iRes; }; *iAiCmbNppSize = 0; memset(pAiCmbNpp, 0, iAiCmbNppMaxSize*sizeof(unsigned long long int) ); pAiCmbNpp[ *iAiCmbNppSize ] = -1; memcpy( pHS->cSArrCpy, pHS->cSArr, iArrSize ); pHS->iCntCmb = simple_fact_ulli( iArrSize ); int bCalcEqlComb = 1; unsigned long long int iCntEqlCmb = 0; int iCurCntEqlCmb = 0; pHS->iCmbIdx = -1; pHS->i = 0; pHS->cPos = strchr(pHS->cSArr, cCmbArr[ pHS->i ] ); if( pHS->cPos != NULL ){ iCurCntEqlCmb = 0; if( (pHS->cPos - pHS->cSArr) < (pHS->iSiArrSize - 1) ){ pHS->cPos2 = strchr(pHS->cPos + 1, cCmbArr[ pHS->i ] ); if( pHS->cPos2 != NULL ){ if(bCalcEqlComb){ pHS->cPosE = pHS->cPos2; while(pHS->cPosE){ iCurCntEqlCmb++; pHS->cPosE = strchr(pHS->cPosE + 1, cCmbArr[ pHS->i ] ); }; }; }; } else { pHS->cPos2 = NULL; }; if( iCurCntEqlCmb ){ if(bCalcEqlComb){ if( !iCntEqlCmb )iCntEqlCmb = 1; else iCurCntEqlCmb++; iCntEqlCmb *= (unsigned long long int)iCurCntEqlCmb; }; }; pHS->iCmbIdx = 0; pHS->iCmbDel = iArrSize; pHS->iCmbR0 = pHS->iCntCmb / pHS->iCmbDel; pHS->iCmbR1 = pHS->cPos - pHS->cSArr; pHS->iCmbIdx += ((unsigned long long int)pHS->iCmbR1) * pHS->iCmbR0; if( pHS->iCmbR1 < pHS->iSiArrSize - 1 ){ memmove( pHS->cSArr + pHS->iCmbR1, pHS->cSArr + pHS->iCmbR1 + 1, sizeof(char)*(pHS->iSiArrSize - (pHS->iCmbR1 + 1) ) ); }; pHS->iSiArrSize--; for( ++pHS->i; pHS->i < iArrSize; pHS->i++){ pHS->iCmbDel--; pHS->cPos = strchr(pHS->cSArr, cCmbArr[ pHS->i ] ); if( pHS->cPos != NULL ){ iCurCntEqlCmb = 0; if( (pHS->cPos - pHS->cSArr) < (pHS->iSiArrSize - 1) ){ pHS->cPos2 = strchr(pHS->cPos + 1, cCmbArr[ pHS->i ] ); if( pHS->cPos2 != NULL ){ if(bCalcEqlComb){ pHS->cPosE = pHS->cPos2; while(pHS->cPosE){ iCurCntEqlCmb++; pHS->cPosE = strchr(pHS->cPosE + 1, cCmbArr[ pHS->i ] ); }; }; }; } else { pHS->cPos2 = NULL; }; if( iCurCntEqlCmb ){ if(bCalcEqlComb){ if( !iCntEqlCmb )iCntEqlCmb = 1; else iCurCntEqlCmb++; iCntEqlCmb *= (unsigned long long int)iCurCntEqlCmb; }; }; pHS->iCmbR0 = pHS->iCmbR0 / (unsigned long long int)pHS->iCmbDel; pHS->iCmbR1 = pHS->cPos - pHS->cSArr; pHS->iCmbIdx += ((unsigned long long int)pHS->iCmbR1) * pHS->iCmbR0; if( pHS->iCmbR1 < pHS->iSiArrSize - 1 ){ memmove( pHS->cSArr + pHS->iCmbR1, pHS->cSArr + pHS->iCmbR1 + 1, sizeof(char)*(pHS->iSiArrSize - (pHS->iCmbR1 + 1) ) ); }; pHS->iSiArrSize--; } else { break; }; }; }; if( pHS->iCmbIdx >= 0 ){ (*iAiCmbNppSize) += 1; pAiCmbNpp[ (*iAiCmbNppSize - 1) ] = pHS->iCmbIdx + 1; if(bCalcEqlComb){ if(iCntEqlCmb > 0){ printf(" It is necessary to implement an algorithm of iterative enumeration of \n" " other permutations (number [%llu]) matching the given value of the combination... \n",iCntEqlCmb); }; bCalcEqlComb = 0; }; }; iRes = 1; return iRes; };

Calculating serial number of permutation by value - experimental code