Merge pull request #5033 from Sosuke23/master

minor add

solutions/silver/cses-1751.mdx

@@ -5,6 +5,8 @@ title: Planets Cycles
 author: Maggie Liu (C++), Qi Wang (Java), George Pong
 ---
 
+## Explanation
+
 Define the number of teleportations starting from a planet as the
 $\texttt{pathlength}$ of that planet. For each planet that hasn't been visited,
 we want to find its $\texttt{pathlength}$. Call the planet we are performing
@@ -42,12 +44,14 @@ $\texttt{steps}$. Once we get to the $\textit{cycle}$, the $\texttt{pathlength}$
 of the planets will all be equal to the $\texttt{pathlength}$ of the
 $\textit{repeat}$, which is the length of the $\textit{cycle}$.
 
-<LanguageSection>
-
-<CPPSection>
 
 ## Implementation
 
+**Time Complexity**: $\mathcal{O}(N)$
+
+<LanguageSection>
+<CPPSection>
+
 ```cpp
 #include <iostream>
 #include <queue>
@@ -102,11 +106,8 @@ void dfs(int planet) {
 ```
 
 </CPPSection>
-
 <JavaSection>
 
-## Implementation
-
 ```java
 import java.io.*;
 import java.util.*;
@@ -158,7 +159,6 @@ public class PlanetCycles {
 ```
 
 </JavaSection>
-
 <PySection>
 
 ```py
@@ -215,5 +215,4 @@ print(*path_length)
 ```
 
 </PySection>
-
 </LanguageSection>