|
|
10300 |
luoguP6869
[COCI 2019/2020 #5] Putovanje
|
0 / 0 |
6 |
|
|
10348 |
luoguP6870
[COCI 2019/2020 #5] Zapina
|
0 / 0 |
6 |
|
|
11136 |
luoguP7195
[IOI 2019] 折线
|
0 / 0 |
9 |
|
|
10640 |
luoguP7199
[COCI 2019/2020 #1] Trol
|
0 / 0 |
3 |
|
|
10643 |
luoguP7200
[COCI 2019/2020 #1] Lutrija
|
0 / 0 |
3 |
|
|
10644 |
luoguP7201
[COCI 2019/2020 #1] Džumbus
|
0 / 0 |
7 |
|
|
10649 |
luoguP7202
[COCI 2019/2020 #1] Trobojnica
|
0 / 0 |
8 |
|
|
10654 |
luoguP7203
[COCI 2019/2020 #3] Preokret
|
0 / 0 |
3 |
|
|
10655 |
luoguP7204
[COCI 2019/2020 #3] Grudanje
|
0 / 0 |
(无) |
|
|
10658 |
luoguP7205
[COCI 2019/2020 #3] Drvca
|
0 / 0 |
7 |
|
|
10659 |
luoguP7206
[COCI 2019/2020 #3] Lampice
|
0 / 0 |
8 |
|
|
10660 |
luoguP7207
[COCI 2019/2020 #3] Sob
|
0 / 0 |
8 |
|
|
10811 |
luoguP7208
[COCI 2019/2020 #1] Zoo
|
0 / 0 |
(无) |
|
|
11154 |
luoguP7241
[COCI 2019/2020 #4] Holding
|
0 / 0 |
7 |
|
|
11155 |
luoguP7242
[COCI 2019/2020 #4] Klasika
|
0 / 0 |
8 |
|
|
11298 |
luoguP7544
[COCI 2019/2020 #4] Nivelle
|
0 / 0 |
5 |
|
|
12662 |
luoguP8678
[蓝桥杯 2019 省 A] 填空问题
|
0 / 0 |
6 |
|
|
12663 |
luoguP8679
[蓝桥杯 2019 省 B] 填空问题
|
0 / 0 |
5 |
|
|
11805 |
luoguP8680
[蓝桥杯 2019 省 B] 特别数的和
|
0 / 0 |
1 |
|
|
11806 |
luoguP8681
[蓝桥杯 2019 省 AB] 完全二叉树的权值
|
0 / 0 |
3 |
|
|
11807 |
luoguP8682
[蓝桥杯 2019 省 B] 等差数列
|
0 / 0 |
3 |
|
|
11808 |
luoguP8683
[蓝桥杯 2019 省 B] 后缀表达式
|
0 / 0 |
5 |
|
|
11809 |
luoguP8684
[蓝桥杯 2019 省 B] 灵能传输
|
0 / 0 |
7 |
|
|
11810 |
luoguP8685
[蓝桥杯 2019 省 A] 外卖店优先级
|
0 / 0 |
5 |
|
|
11811 |
luoguP8686
[蓝桥杯 2019 省 A] 修改数组
|
0 / 0 |
5 |
|
|
11813 |
luoguP8687
[蓝桥杯 2019 省 A] 糖果
|
0 / 0 |
5 |
|
|
11814 |
luoguP8688
[蓝桥杯 2019 省 A] 组合数问题
|
0 / 0 |
8 |
|
|
12664 |
luoguP8689
[蓝桥杯 2019 国 A] 填空问题
|
0 / 0 |
(无) |
|
|
12665 |
luoguP8690
[蓝桥杯 2019 国 B] 填空问题
|
0 / 0 |
5 |
|
|
12666 |
luoguP8691
[蓝桥杯 2019 国 C] 填空问题
|
0 / 0 |
(无) |
|
|
12667 |
luoguP8692
[蓝桥杯 2019 国 C] 数正方形
|
0 / 0 |
5 |
|
|
12668 |
luoguP8693
[蓝桥杯 2019 国 AC] 大胖子走迷宫
|
0 / 0 |
6 |
|
|
12669 |
luoguP8694
[蓝桥杯 2019 国 AC] 估计人数
|
0 / 0 |
6 |
|
|
12670 |
luoguP8695
[蓝桥杯 2019 国 AC] 轨道炮
|
0 / 0 |
5 |
|
|
12671 |
luoguP8697
[蓝桥杯 2019 国 C] 最长子序列
|
0 / 0 |
3 |
|
|
12673 |
luoguP8699
[蓝桥杯 2019 国 B] 排列数
|
0 / 0 |
6 |
|
|
12674 |
luoguP8700
[蓝桥杯 2019 国 B] 解谜游戏
|
0 / 0 |
3 |
|
|
12675 |
luoguP8701
[蓝桥杯 2019 国 B] 第八大奇迹
|
0 / 0 |
7 |
|
|
12676 |
luoguP8702
[蓝桥杯 2019 国 B] 燃烧权杖
|
0 / 0 |
8 |
|
|
12672 |
luoguP8703
[蓝桥杯 2019 国 B] 最优包含
|
0 / 0 |
5 |
|
|
13227 |
luoguP9111
[福建省队集训2019] 最大权独立集问题
|
0 / 0 |
8 |
|
|
13105 |
luoguP9250
[集训队作业 2019] 蜀道难
|
0 / 0 |
9 |
|
|
13648 |
luoguP9606
[CERC2019] ABB
|
0 / 0 |
6 |
|
|
13649 |
luoguP9607
[CERC2019] Be Geeks!
|
0 / 0 |
8 |
|
|
13650 |
luoguP9608
[CERC2019] Bob in Wonderland
|
0 / 0 |
3 |
|
|
13651 |
luoguP9609
[CERC2019] Crimson Sexy Jalapeños（征集交互库/SPJ）
|
0 / 0 |
(无) |
|
|
13652 |
luoguP9610
[CERC2019] Deep800080
|
0 / 0 |
(无) |
|
|
13653 |
luoguP9611
[CERC2019] Zeldain Garden
|
0 / 0 |
6 |
|
|
13654 |
luoguP9612
[CERC2019] Light Emitting Hindenburg
|
0 / 0 |
5 |
|
|
13655 |
luoguP9613
[CERC2019] K==S
|
0 / 0 |
8 |
|
|
13656 |
luoguP9614
[CERC2019] Ponk Warshall
|
0 / 0 |
7 |
|
|
13657 |
luoguP9615
[CERC2019] Saba1000kg
|
0 / 0 |
(无) |
|
|
13658 |
luoguP9616
[CERC2019] Screamers in the Storm
|
0 / 0 |
(无) |
|
|
13659 |
luoguP9617
[CERC2019] The Bugs
|
0 / 0 |
(无) |
|
|
13976 |
luoguP9640
[SNCPC2019] Digit Mode
|
0 / 0 |
7 |
|
|
13977 |
luoguP9641
[SNCPC2019] Grid with Arrows
|
0 / 0 |
5 |
|
|
13978 |
luoguP9642
[SNCPC2019] 0689
|
0 / 0 |
5 |
|
|
13979 |
luoguP9643
[SNCPC2019] Pick Up
|
0 / 0 |
7 |
|
|
13990 |
luoguP9644
[SNCPC2019] Turn It Off
|
0 / 0 |
3 |
|
|
13991 |
luoguP9645
[SNCPC2019] K-hour Clock
|
0 / 0 |
1 |
|
|
13992 |
luoguP9646
[SNCPC2019] Paper-cutting
|
0 / 0 |
8 |
|
|
13996 |
luoguP9647
[SNCPC2019] To the Park
|
0 / 0 |
6 |
|
|
13997 |
luoguP9648
[SNCPC2019] Unrooted Trie
|
0 / 0 |
6 |
|
|
13998 |
luoguP9649
[SNCPC2019] Coolbits
|
0 / 0 |
5 |
|
|
13999 |
luoguP9650
[SNCPC2019] Escape Plan
|
0 / 0 |
6 |
|
|
14000 |
luoguP9651
[SNCPC2019] Digit Product
|
0 / 0 |
1 |
|
|
14350 |
luoguP9958
[USACO19JAN] Shell Game B
|
0 / 0 |
3 |
|
|
14351 |
luoguP9959
[USACO19JAN] Sleepy Cow Sorting B
|
0 / 0 |
3 |
|
|
14352 |
luoguP9960
[USACO19JAN] Guess the Animal B
|
0 / 0 |
3 |
|
|
14839 |
luoguP10338
[THUSC 2019] 彩票
|
0 / 0 |
8 |
|
|
14840 |
luoguP10339
[THUSC 2019] 补给计划
|
0 / 0 |
7 |
|
|
14843 |
luoguP10341
[THUSC 2019] 紧急决策
|
0 / 0 |
5 |
|
|
14846 |
luoguP10342
[THUSC 2019] 数列
|
0 / 0 |
8 |
|
|
14847 |
luoguP10343
[THUSC 2019] 推恩令
|
0 / 0 |
9 |
|
|
14848 |
luoguP10344
[THUSC 2019] PCAP 文件解析与读写
|
0 / 0 |
6 |
|
|
14849 |
luoguP10345
[THUSC 2019] 常见网络校验和计算
|
0 / 0 |
6 |
|
|
14850 |
luoguP10346
[THUSC 2019] 数据链路层协议数据处理
|
0 / 0 |
7 |
|
|
14851 |
luoguP10347
[THUSC 2019] 网络层协议数据处理
|
0 / 0 |
7 |
|
|
14852 |
luoguP10348
[THUSC 2019] RIP 路由协议实现
|
0 / 0 |
8 |
|
|
15325 |
luoguP10732
[NOISG 2019 Prelim] Palindromic FizzBuzz
|
0 / 0 |
1 |
|
|
15327 |
luoguP10733
[NOISG 2019 Prelim] Lost Array
|
0 / 0 |
3 |
|
|
15329 |
luoguP10734
[NOISG 2019 Prelim] Experimental Charges
|
0 / 0 |
6 |
|
|
15330 |
luoguP10735
[NOISG 2019 Prelim] Square or Rectangle?
|
0 / 0 |
7 |
|
|
13744 |
luoguP11080
[ROI 2019] 拍照 (Day 1)
|
0 / 0 |
6 |
|
|
13745 |
luoguP11081
[ROI 2019] 自动驾驶 (Day 1)
|
0 / 0 |
8 |
|
|
13746 |
luoguP11082
[ROI 2019] 高速电车 (Day 1)
|
0 / 0 |
9 |
|
|
13747 |
luoguP11083
[ROI 2019] 黑洞 (Day 1)
|
0 / 0 |
9 |
|
|
13748 |
luoguP11084
[ROI 2019] 灯串 (Day 2)
|
0 / 0 |
(无) |
|
|
13749 |
luoguP11085
[ROI 2019] 学生座位 (Day 2)
|
0 / 0 |
8 |
|
|
13750 |
luoguP11086
[ROI 2019] 机器人高尔夫 (Day 2)
|
0 / 0 |
8 |
|
|
13751 |
luoguP11087
[ROI 2019] 考古 (Day 2)
|
0 / 0 |
9 |
|
|
15599 |
luoguP11221
[COTS 2019] 序列操作 K-ti
|
0 / 0 |
7 |
|
|
15618 |
luoguP11222
[COTS 2019] 车位安排 Parking
|
0 / 0 |
8 |
|
|
15619 |
luoguP11223
[COTS 2019] 传话游戏 Pokvareni
|
0 / 0 |
8 |
|
|
15757 |
luoguP11224
[COTS 2019] 挑战 Izazov
|
0 / 0 |
9 |
|
|
15758 |
luoguP11225
[COTS 2019] 疏散 Sklonište
|
0 / 0 |
8 |
|
|
15759 |
luoguP11226
[COTS 2019] 排名 Vezuv
|
0 / 0 |
7 |
|
|
15866 |
luoguP11337
[COI 2019] IZLET
|
0 / 0 |
8 |
|
|
15867 |
luoguP11338
[COI 2019] LJEPOTICA
|
0 / 0 |
7 |
|
|
15868 |
luoguP11339
[COI 2019] SEGWAY
|
0 / 0 |
(无) |
