Update README.md

README.md

@@ -508,7 +508,7 @@ The algorithm runs in \(O(n \log \log n)\) due to the sieve operation, which is
 ### Solution Code
 Here is the Python implementation of the described approach:
 
-```python
+'''python
 def main():
     import sys
     n = int(sys.stdin.readline())
@@ -542,6 +542,7 @@ def main():
 
 if __name__ == "__main__":
     main()
-```
+'''
 
-This code reads the input, computes the necessary values using a sieve-based approach, assigns values efficiently, and outputs the results ensuring that the maximum value is minimized while satisfying the coprimality condition.
+This code reads the input, computes the necessary values using a sieve-based approach, assigns values efficiently, and outputs the results ensuring that the maximum value is minimized while satisfying the coprimality condition.
+```