1109 | USACO:最短网络 | 60 | 90 | 66.667% |
2754 | 「一本通 2.3 练习 1」Immediate Decodability | 42 | 95 | 44.211% |
2828 | 「一本通 4.3 例 2」A Simple Problem with Integers | 84 | 286 | 29.371% |
2899 | 「一本通 6.2 例 1」Prime Distance | 28 | 148 | 18.919% |
2905 | 「一本通 6.3 例 1」反素数 Antiprime | 34 | 54 | 62.963% |
2949 | 「一本通 6.7 练习 4」S-Nim | 4 | 6 | 66.667% |
4166 | 桐桐的爬山计划(climb) | 16 | 26 | 61.538% |
4493 | ABC214 D - Sum of Maximum Weights | 0 | 0 | 0.000% |
5376 | BZOJ1376:[Baltic2002]limit 速度限制 | 0 | 0 | 0.000% |
5384 | BZOJ1384:[Baltic2000]Time Zones | 0 | 0 | 0.000% |
5423 | BZOJ1423:Optimus Prime | 0 | 0 | 0.000% |
5454 | BZOJ1454:Uva 11423 Cache Simulator | 0 | 0 | 0.000% |
5620 | BZOJ1620:[Usaco2008 Nov]Time Management 时间管理 | 0 | 0 | 0.000% |
5642 | BZOJ1642:[Usaco2007 Nov]Milking Time 挤奶时间 | 0 | 0 | 0.000% |
5665 | BZOJ1665:[Usaco2006 Open]The Climbing Wall 攀岩 | 0 | 0 | 0.000% |
5737 | BZOJ1737:[Usaco2005 jan]Naptime 午睡时间 | 0 | 0 | 0.000% |
5889 | BZOJ1889:Maximal | 0 | 0 | 0.000% |
6091 | BZOJ2091:[Poi2010]The Minima Game | 0 | 0 | 0.000% |
6395 | BZOJ2395:[Balkan 2011]Timeismoney | 0 | 0 | 0.000% |
6400 | BZOJ2400:Spoj 839 Optimal Marks | 0 | 0 | 0.000% |
6410 | BZOJ2410:Nim游戏 | 0 | 0 | 0.000% |
6422 | BZOJ2422:Times | 0 | 0 | 0.000% |
6780 | BZOJ2780:[Spoj]8093 Sevenk Love Oimaster | 0 | 0 | 0.000% |
6801 | BZOJ2801:[Poi2012]Minimalist Security | 0 | 0 | 0.000% |
6819 | BZOJ2819:Nim | 0 | 0 | 0.000% |
7070 | BZOJ3070: [Pa2011]Prime prime power 质数的质数次方 | 0 | 0 | 0.000% |
7080 | BZOJ3080:Minimum Variance Spanning Tree | 0 | 0 | 0.000% |
7105 | BZOJ3105:[cqoi2013]新Nim游戏 | 1 | 1 | 100.000% |
7138 | BZOJ3138:[Baltic2013]Vim | 0 | 0 | 0.000% |
7212 | BZOJ3212:Pku3468 A Simple Problem with Integers | 0 | 1 | 0.000% |
7345 | BZOJ3345:Pku2914 Minimum Cut | 0 | 0 | 0.000% |
7346 | BZOJ3346:Ural1811 Dual Sim Phone | 0 | 0 | 0.000% |
7489 | BZOJ3489: A simple rmq problem | 0 | 0 | 0.000% |
7638 | BZOJ3638:Cf172 k-Maximum Subsequence Sum | 0 | 0 | 0.000% |
7740 | BZOJ3740:pku2842 N-dimension Matching N维匹配 | 0 | 0 | 0.000% |
7828 | BZOJ3828:[Poi2014]Criminals | 0 | 0 | 0.000% |
7890 | BZOJ3890:[Usaco2015 Jan]Meeting Time | 0 | 0 | 0.000% |
7921 | BZOJ3921:Mimori与树海 | 0 | 0 | 0.000% |
7927 | BZOJ3927:[Neerc2014]Improvements | 0 | 0 | 0.000% |
7980 | BZOJ3980:[WF2012]Minimum Cost Flow | 0 | 0 | 0.000% |
8047 | BZOJ4047:[Cerc2014] The Imp | 0 | 0 | 0.000% |
8094 | BZOJ4094:[Usaco2013 Dec]Optimal Milking | 0 | 0 | 0.000% |
8147 | BZOJ4147:[AMPPZ2014]Euclidean Nim | 0 | 0 | 0.000% |
8342 | BZOJ4342:CF348 Pilgrims | 0 | 0 | 0.000% |
8347 | BZOJ4347:[POI2016]Nim z utrudnieniem | 0 | 0 | 0.000% |
8404 | BZOJ4404:[Neerc2015]Binary vs Decimal | 0 | 0 | 0.000% |
8452 | BZOJ4452:[Cerc2015]Export Estimate | 0 | 0 | 0.000% |
8589 | BZOJ4589:Hard Nim | 0 | 0 | 0.000% |
8604 | BZOJ4604:The kth maximum number | 0 | 0 | 0.000% |
8616 | BZOJ4616:[Wf2016]Road Times | 0 | 0 | 0.000% |
8679 | BZOJ4679:Hdu5331 Simple Problem | 0 | 0 | 0.000% |
8688 | BZOJ4688:One-Dimensional | 0 | 0 | 0.000% |
8848 | BZOJ4848:[Neerc2016]List of Primes | 0 | 0 | 0.000% |
10075 | [Atcoder]CBA270 C - Simple path | 0 | 0 | 0.000% |
100543 | [AtCoder]ABC054 D - Mixing Experiment | 0 | 0 | 0.000% |
100570 | [AtCoder]ABC057 A - Remaining Time | 0 | 0 | 0.000% |
100573 | [AtCoder]ABC057 D - Maximum Average Sets | 0 | 0 | 0.000% |
100603 | [AtCoder]ABC060 D - Simple Knapsack | 0 | 0 | 0.000% |
100961 | [AtCoder]ABC096 B - Maximum Sum | 0 | 0 | 0.000% |
101012 | [AtCoder]ABC101 C - Minimization | 0 | 0 | 0.000% |
101021 | [AtCoder]ABC102 B - Maximum Difference | 0 | 0 | 0.000% |
101022 | [AtCoder]ABC102 C - Linear Approximation | 0 | 0 | 0.000% |
101100 | [AtCoder]ABC110 A - Maximize the Formula | 0 | 0 | 0.000% |
101101 | [AtCoder]ABC110 B - 1 Dimensional World's Tale | 0 | 0 | 0.000% |
101121 | [AtCoder]ABC112 B - Time Limit Exceeded | 0 | 0 | 0.000% |
101275 | [AtCoder]ABC127 F - Absolute Minima | 0 | 0 | 0.000% |
101305 | [AtCoder]ABC130 F - Minimum Bounding Box | 0 | 0 | 0.000% |
101332 | [AtCoder]ABC133 C - Remainder Minimization 2019 | 0 | 0 | 0.000% |
101384 | [AtCoder]ABC138 E - Strings of Impurity | 0 | 0 | 0.000% |
101402 | [AtCoder]ABC140 C - Maximal Value | 0 | 0 | 0.000% |
101405 | [AtCoder]ABC140 F - Many Slimes | 0 | 0 | 0.000% |
101432 | [AtCoder]ABC143 C - Slimes | 0 | 0 | 0.000% |
101492 | [AtCoder]ABC149 C - Next Prime | 0 | 0 | 0.000% |
101574 | [AtCoder]ABC157 E - Simple String Queries | 0 | 0 | 0.000% |
101575 | [AtCoder]ABC157 F - Yakiniku Optimization Problem | 0 | 0 | 0.000% |
101592 | [AtCoder]ABC159 C - Maximum Volume | 0 | 0 | 0.000% |
101725 | [AtCoder]ABC172 F - Unfair Nim | 0 | 0 | 0.000% |
101774 | [AtCoder]ABC177 E - Coprime | 0 | 0 | 0.000% |
101795 | [AtCoder]ABC179 F - Simplified Reversi | 0 | 0 | 0.000% |
101852 | [AtCoder]ABC185 C - Duodecim Ferra | 0 | 0 | 0.000% |
101883 | [AtCoder]ABC188 D - Snuke Prime | 0 | 0 | 0.000% |
101900 | [AtCoder]ABC190 A - Very Very Primitive Game | 0 | 9 | 0.000% |
101945 | [AtCoder]ABC194 F - Digits Paradise in Hexadecimal | 0 | 0 | 0.000% |
101955 | [AtCoder]ABC195 F - Coprime Present | 0 | 0 | 0.000% |
102105 | [AtCoder]ABC210 F - Coprime Solitaire | 0 | 0 | 0.000% |
102127 | [AtCoder]ABC212 H - Nim Counting | 0 | 0 | 0.000% |
102143 | [AtCoder]ABC214 D - Sum of Maximum Weights | 0 | 0 | 0.000% |
102153 | [AtCoder]ABC215 D - Coprime 2 | 0 | 0 | 0.000% |
102260 | [AtCoder]ABC226 A - Round decimals | 0 | 0 | 0.000% |
102314 | [AtCoder]ABC231 E - Minimal payments | 0 | 0 | 0.000% |
102317 | [AtCoder]ABC231 H - Minimum Coloring | 0 | 0 | 0.000% |
102325 | [AtCoder]ABC232 F - Simple Operations on Sequence | 0 | 1 | 0.000% |
102351 | [AtCoder]ABC235 B - Climbing Takahashi | 0 | 0 | 0.000% |
102352 | [AtCoder]ABC235 C - The Kth Time Query | 0 | 0 | 0.000% |
102393 | [AtCoder]ABC239 D - Prime Sum Game | 0 | 0 | 0.000% |
102421 | [AtCoder]ABC242 B - Minimize Ordering | 0 | 0 | 0.000% |
102447 | [AtCoder]ABC244 Ex - Linear Maximization | 0 | 0 | 0.000% |
102481 | [AtCoder]ABC248 B - Slimes | 0 | 0 | 0.000% |
102514 | [AtCoder]ABC251 E - Takahashi and Animals | 0 | 0 | 0.000% |
102536 | [AtCoder]ABC253 G - Swap Many Times | 0 | 0 | 0.000% |