37 lines
1.2 KiB
Text
37 lines
1.2 KiB
Text
|
---
|
||
|
id: harder-ordered
|
||
|
title: "Harder Problems with Ordered Maps & Sets"
|
||
|
author: Benjamin Qi
|
||
|
prerequisites:
|
||
|
- Silver - Introduction to Ordered Maps & Sets
|
||
|
description: ""
|
||
|
frequency: 2
|
||
|
---
|
||
|
|
||
|
import { Problem } from "../models";
|
||
|
|
||
|
export const metadata = {
|
||
|
problems: {
|
||
|
sample: [
|
||
|
new Problem("CSES", "Bit Inversions", "1188", "Normal", false, []),
|
||
|
],
|
||
|
general: [
|
||
|
new Problem("Silver", "Milk Measurement", "763", "Normal", false, []),
|
||
|
new Problem("Silver", "Convention II", "859", "Normal", false, []),
|
||
|
new Problem("Gold", "Snow Boots", "813", "Normal", false, []),
|
||
|
new Problem("CF", "Jury Marks", "contest/831/problem/C", "Hard", false, [], "Hard, would recommend skipping (1700 on CF)"),
|
||
|
new Problem("CF", "Mahmoud & Ehab & Function", "contest/862/problem/E", "Hard", false, [], "Hard, do not attempt until Gold/Plat (2100 on CF)"),
|
||
|
new Problem("CF", "Tournament", "contest/878/problem/C", "Very Hard", false, [], "First solve problem for $n$-th tournament only. Extremely hard, do not attempt (2700 on CF)"),
|
||
|
]
|
||
|
}
|
||
|
};
|
||
|
|
||
|
|
||
|
## Example: Using Iterators
|
||
|
|
||
|
<problems-list problems={metadata.problems.sample} />
|
||
|
|
||
|
## Problems
|
||
|
|
||
|
<problems-list problems={metadata.problems.general} />
|