Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"AtCoder-abc317_b\":[\"MissingNo.\",8509,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc317\\\"\\u003eGAMEFREAK Programming Contest 2023 (AtCoder Beginner Contest 317)\\u003c/a\\u003e\"],\"CodeForces-1845C\":[\"Strong Password\",13375,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1845\\\"\\u003eEducational Codeforces Round 151 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1934C\":[\"Find a Mine\",5959,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1934\\\"\\u003eCodeforces Round 931 (Div. 2)\\u003c/a\\u003e\"],\"OpenJ_NOI-CH0106-02\":[\"陶陶摘苹果\",78308,\"NOIP2005复赛 普及组 第一题\"],\"CodeForces-727C\":[\"Guess the Array\",7470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/727\\\"\\u003eTechnocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1873C\":[\"Target Practice\",35745,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1873\\\"\\u003eCodeforces Round 898 (Div. 4)\\u003c/a\\u003e\"],\"SPOJ-BCEASY\":[\"Bottom Coder (Easy)\",3785,\"IPSC 2005\"],\"CodeForces-689A\":[\"Mike and Cellphone\",5692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/689\\\"\\u003eCodeforces Round 361 (Div. 2)\\u003c/a\\u003e\"],\"OpenJ_NOI-CH0104-14\":[\"计算邮资\",70348,\"1858\"],\"CodeForces-520B\":[\"Two Buttons\",53065,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/520\\\"\\u003eCodeforces Round 295 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-abc234_d\":[\"Prefix K-th Max\",4151,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc234\\\"\\u003eAtCoder Beginner Contest 234\\u003c/a\\u003e\"],\"CodeForces-1729D\":[\"Friends and the Restaurant\",19117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1729\\\"\\u003eCodeforces Round 820 (Div. 3)\\u003c/a\\u003e\"],\"LibreOJ-3505\":[\"数对\",78,\"联合省选 2021 B\"],\"SPOJ-HCOUPLE\":[\"Hidden Couple\",405,\"Problem Setter: Md. Ashraful Islam, Lecturer, Dept. of CSE, Varendra University\"],\"UESTC-153\":[\"虫食算\",0,\"Classic Problem\"],\"DMOJ-coci11c5p2\":[\"COCI \\u0026#39;11 Contest 5 #2 Eko\",205,null],\"OpenJ_NOI-CH0205-1789\":[\"算24\",2840,\"\"],\"CodeForces-1476A\":[\"K-divisible Sum\",36125,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1476\\\"\\u003eEducational Codeforces Round 103 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1856C\":[\"To Become Max\",11423,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1856\\\"\\u003eCodeforces Round 890 (Div. 2) supported by Constructor Institute\\u003c/a\\u003e\"],\"CodeForces-1876A\":[\"Helmets in Night Light\",14933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1876\\\"\\u003eCodeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round)\\u003c/a\\u003e\"],\"AtCoder-abc244_c\":[\"Yamanote Line Game\",4822,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc244\\\"\\u003eAtCoder Beginner Contest 244\\u003c/a\\u003e\"],\"CodeForces-1901B\":[\"Chip and Ribbon\",14157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1901\\\"\\u003eEducational Codeforces Round 158 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1913C\":[\"Game with Multiset\",13669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1913\\\"\\u003eEducational Codeforces Round 160 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1937D\":[\"Pinball\",4,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1937\\\"\\u003eCodeforces Round 930 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1230A\":[\"Dawid and Bags of Candies\",22986,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1230\\\"\\u003eCodeforces Round 588 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-377A\":[\"Maze\",24444,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/377\\\"\\u003eCodeforces Round 222 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1840D\":[\"Wooden Toy Festival\",12965,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1840\\\"\\u003eCodeforces Round 878 (Div. 3)\\u003c/a\\u003e\"],\"Kattis-climbingworm\":[\"Climbing Worm\",1678,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/2018%20Virginia%20Tech%20High%20School%20Programming%20Contest\\\"\\u003e2018 Virginia Tech High School Programming Contest\\u003c/a\\u003e\"],\"UniversalOJ-260\":[\"玩具谜题\",687,\"NOIP2016\"],\"CodeForces-1805C\":[\"Place for a Selfie\",12099,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1805\\\"\\u003eCodeforces Round 862 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1843E\":[\"Tracking Segments\",11123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1843\\\"\\u003eCodeforces Round 881 (Div. 3)\\u003c/a\\u003e\"],\"OpenJ_NOI-CH0111-10\":[\"River Hopscotch\",7197,\"\"],\"SPOJ-TEST\":[\"Life, the Universe, and Everything\",217556,\"Douglas Adams, The Hitchhiker\\u0027s Guide to the Galaxy\"],\"OpenJ_NOI-CH0110-05\":[\"分数线划定\",16951,\"NOIP2009复赛 普及组 第二题\"],\"SPOJ-BOOKGFT\":[\"Book Gift\",837,\"Own Problem\"],\"CodeForces-1891C\":[\"Smilo and Monsters\",11294,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1891\\\"\\u003eCodeforces Round 907 (Div. 2)\\u003c/a\\u003e\"],\"OpenJ_NOI-CH0110-09\":[\"明明的随机数\",22905,\"NOIP2006复赛 普及组 第一题\"],\"UESTC-2829\":[\"生日蛋糕\",55,\"2022 UESTC ICPC Training for String and Search Algorithm\"],\"CodeForces-768B\":[\"Code For 1\",6926,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/768\\\"\\u003eDivide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-679A\":[\"Bear and Prime 100\",12846,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/679\\\"\\u003eCodeforces Round 356 (Div. 1)\\u003c/a\\u003e\"],\"OpenJ_NOI-CH0109-06\":[\"笨小猴\",15527,\"NOIP2008复赛 提高组 第一题\"],\"Toph-hashtag\":[\"#Hashtag\",1263,null],\"CodeForces-1937C\":[\"Bitwise Operation Wizard\",14,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1937\\\"\\u003eCodeforces Round 930 (Div. 2)\\u003c/a\\u003e\"],\"AtCoder-abc333_a\":[\"Three Threes \",12815,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc333\\\"\\u003eToyota Programming Contest 2023#8(AtCoder Beginner Contest 333)\\u003c/a\\u003e\"],\"Gym-104757I\":[\"ISBN Conversion\",261,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/104757\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2023-2024 ICPC East North America Regional Contest (ECNA 2023)\\u003c/a\\u003e\"],\"CodeForces-1721C\":[\"Min-Max Array Transformation\",13601,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1721\\\"\\u003eEducational Codeforces Round 134 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1842B\":[\"Tenzing and Books\",15676,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1842\\\"\\u003eCodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1886B\":[\"Fear of the Dark\",15266,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1886\\\"\\u003eEducational Codeforces Round 156 (Rated for Div. 2)\\u003c/a\\u003e\"],\"Baekjoon-9881\":[\"Ski Course Design\",492,\"\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/2\\\"\\u003eOlympiad\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/106\\\"\\u003eUSA Computing Olympiad\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/281\\\"\\u003e2013-2014 Season\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/294\\\"\\u003eUSACO January 2014 Contest\\u003c/a\\u003e\\u0026nbsp;\\u0026gt;\\u0026nbsp;\\u003ca href\\u003d\\\"https://www.acmicpc.net/category/detail/1220\\\"\\u003eBronze\\u003c/a\\u003e\\u0026nbsp;1번\"],\"SPOJ-INTEST\":[\"Enormous Input Test\",12116,\"Idea put forward by Michael Mendelsohn\"],\"AtCoder-abc243_c\":[\"Collision 2\",4899,\"\\u003ca class\\u003d\\\"contest-title\\\" href\\u003d\\\"https://atcoder.jp/contests/abc243\\\"\\u003eAtCoder Beginner Contest 243\\u003c/a\\u003e\"],\"CodeForces-1006E\":[\"Military Problem\",10197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1006\\\"\\u003eCodeforces Round 498 (Div. 3)\\u003c/a\\u003e\"],\"OpenJ_NOI-CH0105-45\":[\"金币\",45434,\"Rocky Mountain 2004\"],\"OpenJ_NOI-CH0109-03\":[\"不高兴的津津\",23418,\"NOIP2004复赛 普及组 第一题\"],\"CodeForces-1870C\":[\"Colorful Table\",10856,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1870\\\"\\u003eCodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1486D\":[\"Max Median\",6989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1486\\\"\\u003eCodeforces Round 703 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-CPTTRN1\":[\"Character Patterns (Act 1)\",12267,\"\"],\"SPOJ-DIVSUM\":[\"Divisor Summation\",19241,\"Neal Zane\"],\"UESTC-201\":[\"Sliding Window\",69,\"POJ Monthly--2006.04.28, Ikki\"],\"CodeForces-743B\":[\"Chloe and the sequence\",15446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/743\\\"\\u003eCodeforces Round 384 (Div. 2)\\u003c/a\\u003e\"],\"OpenJ_NOI-CH0106-06\":[\"校门外的树\",55738,\"NOIP2005复赛 普及组 第二题\"],\"SPOJ-CPTTRN2\":[\"Character Patterns (Act 2)\",8307,\"\"],\"OpenJ_NOI-CH0106-05\":[\"年龄与疾病\",52509,\"\"],\"SPOJ-CPTTRN8\":[\"Character Patterns (Act 8)\",512,\"\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"UESTC_Guest_WiFi","updateTime":1710062329000,"title":"UESTC XCPC 小白题单","dislikeCnt":0,"content":"## C++ 基础语法\n\n[problem:SPOJ-TEST]\n[problem:OpenJ_NOI-CH0109-03]\n[problem:OpenJ_NOI-CH0109-06]\n[problem:OpenJ_NOI-CH0104-14]\n[problem:OpenJ_NOI-CH0105-45]\n[problem:OpenJ_NOI-CH0106-05]\n[problem:OpenJ_NOI-CH0106-02]\n[problem:OpenJ_NOI-CH0106-06]\n[problem:AtCoder-abc333_a]\n[problem:AtCoder-abc317_b]\n[problem:Toph-hashtag]\n[problem:SPOJ-BOOKGFT]\n[problem:SPOJ-CPTTRN1]\n[problem:SPOJ-CPTTRN2]\n[problem:SPOJ-HCOUPLE]\n[problem:SPOJ-INTEST]\n\n## STL\n\n[problem:OpenJ_NOI-CH0110-09]\n[problem:OpenJ_NOI-CH0110-05]\n[problem:AtCoder-abc243_c]\n[problem:AtCoder-abc234_d]\n[problem:CodeForces-1870C]\n\n## 模拟\n\n[problem:UniversalOJ-260]\n[problem:Gym-104757I]\n[problem:Kattis-climbingworm]\n[problem:Baekjoon-9881]\n[problem:CodeForces-689A]\n[problem:CodeForces-1805C]\n\n## 递归 / 搜索\n\n[problem:OpenJ_NOI-CH0205-1789]\n[problem:UESTC-153]\n[problem:CodeForces-1230A]\n[problem:CodeForces-1006E]\n[problem:CodeForces-377A]\n[problem:CodeForces-520B]\n[problem:CodeForces-768B]\n[problem:CodeForces-743B]\n[problem:UESTC-2829]\n\n## 贪心\n\n[problem:CodeForces-1901B]\n[problem:CodeForces-1876A]\n[problem:CodeForces-1842B]\n[problem:CodeForces-1845C]\n[problem:CodeForces-1873C]\n\n## 二分\n\n[problem:OpenJ_NOI-CH0111-10]\n[problem:DMOJ-coci11c5p2]\n[problem:CodeForces-1476A]\n[problem:CodeForces-1486D]\n[problem:CodeForces-1913C]\n[problem:CodeForces-1840D]\n[problem:CodeForces-1886B]\n[problem:CodeForces-1856C]\n[problem:CodeForces-1843E]\n\n## 前缀和 / 差分 / 双指针\n\n[problem:UESTC-201]\n[problem:CodeForces-1937D]\n[problem:CodeForces-1891C]\n[problem:CodeForces-1729D]\n[problem:CodeForces-1721C]\n\n## 简单交互\n\n不知道什么是交互?可以看看 [Codeforces](https://codeforces.com/blog/entry/45307) 上的说明。\n\n[problem:CodeForces-727C]\n[problem:AtCoder-abc244_c]\n[problem:CodeForces-679A]\n[problem:CodeForces-1934C]\n[problem:CodeForces-1937C]\n\n## 综合练习\n\n[problem:SPOJ-CPTTRN8]\n[problem:LibreOJ-3505]\n[problem:SPOJ-DIVSUM]\n[problem:SPOJ-BCEASY]\n","threadId":184833,"likeCnt":9,"createTime":1709643352000,"isWorkbook":true,"viewCnt":2076,"openness":2,"fav":false,"id":4664,"trustable":false}