Below are my two submissions for this problem:
- First Submission(TLE): Solution Link
- This version included macro definitions and typedefs to simplify the code. The sieve function calculated the smallest prime factors, and the primes were stored in a separate vector.
- Second Submission (Corrected flagged as cheating): Solution Link
- In this version, I removed the macros and typedefs for better clarity. The sieve function remained the same, but I moved the prime vector initialization to the main function to ensure all primes were stored correctly.
Given the nature of competitive programming and the large number of participants, it is not uncommon for solutions to appear similar, especially when standard algorithms like the Sieve of Eratosthenes are applied. My intention was solely to optimize and correct my initial approach.
I would like to clarify that my work was independently developed and i not copy a code from any other participants.
I respectfully request a review of my submissions in the context provided.