33 lines
No EOL
1.1 KiB
Text
33 lines
No EOL
1.1 KiB
Text
---
|
|
id: maps-sets
|
|
title: "More with Maps & Sets"
|
|
author: Benjamin Qi
|
|
prerequisites:
|
|
- Bronze - Data Structures
|
|
description: "More with iterators?"
|
|
frequency: 2
|
|
---
|
|
|
|
(set iterators?)
|
|
|
|
## USACO Problems
|
|
|
|
- [CSES Bit Inversions](https://cses.fi/problemset/task/1188/)
|
|
- Silver
|
|
- [Cities & States](http://usaco.org/index.php?page=viewproblem2&cpid=667)
|
|
- [Milk Measurement](http://usaco.org/index.php?page=viewproblem2&cpid=763)
|
|
- [Convention II](http://usaco.org/index.php?page=viewproblem2&cpid=859)
|
|
- Gold
|
|
- [Snow Boots](http://www.usaco.org/index.php?page=viewproblem2&cpid=813)
|
|
- [Springboards](http://www.usaco.org/index.php?page=viewproblem2&cpid=995)
|
|
- hard?
|
|
|
|
## CF Problems
|
|
|
|
- [Jury Marks](http://codeforces.com/contest/831/problem/C) [](67)
|
|
- Hard, would recommend skipping (1700 on CF)
|
|
- [Mahmoud & Ehab & Function](http://codeforces.com/contest/862/problem/E) [](74)
|
|
- Hard, do not attempt until Gold/Plat (2100 on CF)
|
|
- [Tournament](http://codeforces.com/contest/878/problem/C) [](106)
|
|
- First solve problem for $n$-th tournament only
|
|
- Extremely hard, do not attempt (2700 on CF) |