This commit is contained in:
Nathan Wang 2020-07-17 22:45:19 -07:00
parent 1f14070c04
commit 6e69588e9c
3 changed files with 3 additions and 11 deletions

View file

@ -65,7 +65,8 @@ Given this new graph, we add edges between two "states" which are reachable from
Don't forget that once Bessie reaches the goal, she will ignore further commands. In the modified problem, if one of the two cows is at the goal, stop applying commands to her.
<<<<<<< HEAD
</Warning>
On this new graph, we can directly run a BFS, and retrieve the answer at ${N, N, N, N, x, y}$ where $x$ and $y$ represent directions.
(Ben - equivalent to existing editorial)

View file

@ -148,7 +148,7 @@ Also, one must always ensure that they do not attempt to divide by 0. Be aware t
<Warning>
The above only works for **prime** modulos. Modulo inverses are *much more nuanced* for composite modulos.
The above only works for **prime** modulos. Modulo inverses are *much more nuanced* for composite modulos.
</Warning>

View file

@ -186,15 +186,6 @@ export function ProblemComponent(props: ProblemComponentProps) {
>
{problem.name}
</a>
{problem.isIntro && (
<span
className={
'ml-2 px-2 inline-flex text-xs leading-5 font-semibold rounded-full bg-teal-100 text-teal-800'
}
>
Intro
</span>
)}
</div>
</td>
<td className="pl-4 md:px-6 py-4 whitespace-no-wrap leading-5 w-full">