Questions

Status
Bits and mathCoding · FoundationsOpen topic
GCD and LCMMediumWrite codeWrite codeMedium18 minPrime exponent in factorialMediumWrite codeWrite codeMedium22 minSum of divisorsMediumWrite codeWrite codeMedium20 minSmallest prime factorMediumWrite codeWrite codeMedium15 minMaximum pair GCDMediumWrite codeWrite codeMedium25 minFactorial digit countMediumWrite codeWrite codeMedium20 minDivisor count functionMediumWrite codeWrite codeMedium20 minSingle-bit error correctionMediumWrite codeWrite codeMedium22 minUnpack signed converter samplesMediumWrite codeWrite codeMedium22 minBitmap block allocatorHardWrite codeApple styleWrite codeApple styleHard35 minIndex intersection mergeHardWrite codeOracle styleWrite codeOracle styleHard30 minBinomial coefficient modulo primeHardWrite codeCitadel styleWrite codeCitadel styleHard35 min
Modular multiplicative inverseHardWrite codeWrite codeHard30 minMaximum XOR subsetHardWrite codeWrite codeHard35 minGeneralized Chinese remainder theoremHardWrite codeWrite codeHard35 minLongest subarray GCDHardWrite codeWrite codeHard35 minChinese remainder theoremHardWrite codeCitadel styleWrite codeCitadel styleHard35 minPrimes in rangeHardWrite codeCitadel styleWrite codeCitadel styleHard30 minExtended Euclidean algorithmHardWrite codeWrite codeHard30 minCatalan number modulo primeHardWrite codeCitadel styleWrite codeCitadel styleHard30 minMiller-Rabin primality testHardWrite codeCitadel styleWrite codeCitadel styleHard35 minGeometric series moduloHardWrite codeWrite codeHard30 minFibonacci moduloHardWrite codeWrite codeHard35 minCoprime pairs mobius inversionHardWrite codeWrite codeHard35 minDiscrete logarithm modulo primeHardWrite codeWrite codeHard40 minSolve two congruencesHardWrite codeWrite codeHard35 min