ID 题目 显示标签 隐藏标签 AC / 尝试 难度
827 P1387A  Graph 0 / 0 7
825 P1387B2  Village (Maximum) 0 / 0 9
821 P1388C  Uncle Bogdan and Country Happiness 0 / 0 6
820 P1388D  Captain Flint and Treasure 0 / 0 7
812 P1389G  Directing Edges 0 / 0 10
807 P1391E  Pairs of Pairs 4 / 6 10
800 P1392G  Omkar and Pies 0 / 0 10
794 P1393D  Rarity and New Dress 0 / 0 7
790 P1394B  Boboniu Walks on Graph 0 / 0 8
779 P1396E  Distance Matching 1 / 2 10
765 P1399E1  Weights Division (easy version) 0 / 0 7
764 P1399E2  Weights Division (hard version) 0 / 0 8
757 P1400F  x-prime Substrings 0 / 0 10
752 P1401D  Maximum Distributed Tree 0 / 0 6
747 P1402C  Star Trek 0 / 0 10
745 P1403B  Spring cleaning 0 / 0 8
742 P1404B  Tree Tag 0 / 0 6
740 P1404D  Game of Pairs 0 / 0 10
734 P1406C  Link Cut Centroids 0 / 0 5
727 P1407E  Egor in the Republic of Dagestan 1 / 3 9
709 P1411C  Peaceful Rooks 0 / 0 5
671 P1419F  Rain of Fire 0 / 0 10
600 P1430G  Yet Another DAG Problem 0 / 0 10
586 P1433D  Districts Connection 0 / 0 4
578 P1436D  Bandit in a City 0 / 0 6
552 P1442C  Graph Transpositions 0 / 0 9
550 P1442E  Black, White and Grey Tree 1 / 1 10
542 P1444C  Team-Building 1 / 3 9
540 P1444E  Finding the Vertex 0 / 0 10
531 P1446E  Long Recovery 0 / 0 10
523 P1450E  Capitalism 0 / 0 10
505 P1452G  Game On Tree 0 / 0 10
500 P1453E  Dog Snacks 0 / 0 8
494 P1454E  Number of Simple Paths 0 / 0 7
459 P1463E  Plan of Lectures 0 / 0 9
451 P1466F  Euclid's nightmare 0 / 0 7
442 P1467E  Distinctive Roots in a Tree 0 / 0 9
418 P1470D  Strange Housing 1 / 1 8
408 P1472G  Moving to the Capital 0 / 0 7
384 P1476D  Journey 0 / 1 5
383 P1476E  Pattern Matching 0 / 0 8
377 P1477D  Nezzar and Hidden Permutations 0 / 0 10
345 P1485E  Move and Swap 0 / 0 9
337 P1486F  Pairs of Paths 0 / 0 10
334 P1487C  Minimum Ties 0 / 0 5
316 P1490D  Permutation Transformation 0 / 0 4
308 P1491E  Fib-tree 0 / 0 9
299 P1492E  Almost Fault-Tolerant Database 0 / 0 9
289 P1494D  Dogeforces 0 / 0 8
287 P1494F  Delete The Edges 0 / 0 10

分类

手气不错

根据当前过滤条件随机选择一道题