more bitsets

Author: bqi343

content/5_Plat/Bitsets.mdx

@@ -57,13 +57,13 @@ export const problems = {
 	],
 	ad: [
 		new Problem(
-			'Plat',
-			'Equilateral Triangles',
-			'1021',
-			'Normal',
+			'TOKI',
+			'Tzaph & Number Line',
+			'https://tlx.toki.id/contests/troc-15-div-1/problems/E',
+			'Easy',
 			false,
-			['Bitset', 'Sliding Window'],
-			'Again, the intended solution runs in $O(N^3)$. Of course, it is still possible to pass $O(N^4)$ solutions with bitset! See the analysis [here](http://www.usaco.org/current/data/sol_triangles_platinum_feb20.html).'
+			['Bitset'],
+			''
 		),
 		new Problem(
 			'Baltic OI',
@@ -83,6 +83,24 @@ export const problems = {
 			['Knapsack', 'Bitset'],
 			'baltic-10-candies'
 		),
+		new Problem(
+			'COCI',
+			'2015 - Uzastopni',
+			'https://oj.uz/problem/view/COCI15_uzastopni',
+			'Normal',
+			false,
+			['Bitset'],
+			''
+		),
+		new Problem(
+			'Plat',
+			'Equilateral Triangles',
+			'1021',
+			'Hard',
+			false,
+			['Bitset', 'Sliding Window'],
+			'Again, the intended solution runs in $O(N^3)$. Of course, it is still possible to pass $O(N^4)$ solutions with bitset! See the analysis [here](http://www.usaco.org/current/data/sol_triangles_platinum_feb20.html).'
+		),
 		new Problem(
 			'IZhO',
 			'2017 - Bootfall',
@@ -102,12 +120,12 @@ export const problems = {
 			'baltic-15-tug'
 		),
 		new Problem(
-			'COCI',
-			'2015 - Uzastopni',
-			'https://oj.uz/problem/view/COCI15_uzastopni',
+			'CF',
+			'Rectangular Polyline',
+			'https://codeforces.com/contest/1444/problem/D',
 			'Hard',
 			false,
-			['Bitset'],
+			[],
 			''
 		),
 	],