Add count distinct primes from binary string algorithm

[rudrakshtank]

@realstealthninja Could you please review this PR?

Description of Change

Added count_distinct_primes_from_binary_string.cpp to the bit_manipulation/ directory.

This program counts the number of distinct prime numbers that can be formed from a binary string using:

• Any permutation of characters (i.e., swapping)
• Changing '1's to '0's (but not the reverse)

It uses an efficient implementation of the Sieve of Eratosthenes for prime checking and bitmasking to explore all possible combinations.

Includes:

• Doxygen-style documentation
• A working main() with an example test case

Contributors guide

---

Checklist

• Added description of change
• File name matches File name guidelines
• Added test case/example in main()
• Added Doxygen-style documentation
• Comments/documentation added as needed
• PR title follows semantic commit guidelines
• Confirmed this is not a duplicate contribution
• I acknowledge that all my contributions will be made under the project's license

---

Notes:

Efficient bitmask + sieve-based solution to find all valid prime numbers from binary strings using allowed transformations.