Update usaco-1228.mdx

Author: SansPapyrus683

solutions/bronze/usaco-1228.mdx

@@ -45,7 +45,7 @@ int main() {
 	// that must be lying given that Bessie is at the position of cow i.
 	vector<int> lying_left(n);
 	for (int i = 1; i < n; i++) {
-		// Add up all the cows that are lying to the left of our pos.
+		// Add up all the cows that are lying to the left of our position.
 		lying_left[i] += lying_left[i - 1];
 
 		if (cows[i - 1].second == 'L' && cows[i].first >= cows[i - 1].first) {
@@ -124,7 +124,7 @@ public class CountingLiars {
 		// that must be lying given that Bessie is at the position of cow i.
 		int[] lying_left = new int[n];
 		for (int i = 1; i < n; i++) {
-			// Add up all the cows that are lying to the left of our pos.
+			// Add up all the cows that are lying to the left of our position.
 			lying_left[i] += lying_left[i - 1];
 
 			if (cows[i - 1].statement == 'L' &&
@@ -185,7 +185,7 @@ cows.sort(key=lambda c: (c.pos, c.statement))
 # that must be lying given that Bessie is at the position of cow i.
 lying_left = [0 for _ in range(n)]
 for i in range(1, n):
-	# Add up all the cows that are lying to the left of our pos.
+	# Add up all the cows that are lying to the left of our position.
 	lying_left[i] += lying_left[i - 1]
 
 	if cows[i - 1].statement == "L" and cows[i].pos >= cows[i - 1].pos: