|
|
1004 |
P1791E
Negatives and Positives
|
0 / 0 |
3 |
|
|
1003 |
P1791F
Range Update Point Query
|
0 / 0 |
5 |
|
|
1002 |
P1791G1
Teleporters (Easy Version)
|
0 / 0 |
3 |
|
|
1001 |
P1791G2
Teleporters (Hard Version)
|
0 / 0 |
6 |
|
|
1000 |
P1792A
GamingForces
|
0 / 0 |
3 |
|
|
999 |
P1792B
Stand-up Comedian
|
0 / 0 |
4 |
|
|
998 |
P1792C
Min Max Sort
|
0 / 0 |
5 |
|
|
997 |
P1792D
Fixed Prefix Permutations
|
0 / 0 |
5 |
|
|
996 |
P1792E
Divisors and Table
|
0 / 0 |
9 |
|
|
995 |
P1792F1
Graph Coloring (easy version)
|
0 / 0 |
10 |
|
|
994 |
P1792F2
Graph Coloring (hard version)
|
0 / 0 |
10 |
|
|
993 |
P1793A
Yet Another Promotion
|
0 / 0 |
3 |
|
|
992 |
P1793B
Fedya and Array
|
0 / 0 |
3 |
|
|
991 |
P1793C
Dora and Search
|
0 / 0 |
4 |
|
|
990 |
P1793D
Moscow Gorillas
|
0 / 0 |
6 |
|
|
989 |
P1793E
Velepin and Marketing
|
0 / 0 |
10 |
|
|
988 |
P1793F
Rebrending
|
0 / 0 |
10 |
|
|
987 |
P1794A
Prefix and Suffix Array
|
0 / 0 |
3 |
|
|
986 |
P1794B
Not Dividing
|
0 / 0 |
3 |
|
|
985 |
P1794C
Scoring Subsequences
|
0 / 0 |
4 |
|
|
984 |
P1794D
Counting Factorizations
|
0 / 0 |
6 |
|
|
983 |
P1794E
Labeling the Tree with Distances
|
0 / 0 |
9 |
|
|
982 |
P1795A
Two Towers
|
0 / 0 |
3 |
|
|
981 |
P1795B
Ideal Point
|
0 / 0 |
3 |
|
|
980 |
P1795C
Tea Tasting
|
0 / 0 |
5 |
|
|
979 |
P1795D
Triangle Coloring
|
0 / 0 |
5 |
|
|
978 |
P1795E
Explosions?
|
0 / 0 |
8 |
|
|
977 |
P1795F
Blocking Chips
|
0 / 0 |
9 |
|
|
976 |
P1795G
Removal Sequences
|
0 / 0 |
10 |
|
|
975 |
P1796A
Typical Interview Problem
|
0 / 0 |
3 |
|
|
974 |
P1796B
Asterisk-Minor Template
|
0 / 0 |
3 |
|
|
973 |
P1796C
Maximum Set
|
0 / 0 |
5 |
|
|
972 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
971 |
P1796E
Colored Subgraphs
|
0 / 0 |
9 |
|
|
970 |
P1796F
Strange Triples
|
0 / 0 |
10 |
|
|
969 |
P1797A
Li Hua and Maze
|
0 / 0 |
3 |
|
|
968 |
P1797B
Li Hua and Pattern
|
0 / 0 |
3 |
|
|
967 |
P1797C
Li Hua and Chess
|
0 / 0 |
5 |
|
|
966 |
P1797D
Li Hua and Tree
|
0 / 0 |
6 |
|
|
965 |
P1797E
Li Hua and Array
|
0 / 0 |
8 |
|
|
964 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
963 |
P1798A
Showstopper
|
0 / 0 |
3 |
|
|
962 |
P1798B
Three Sevens
|
0 / 0 |
3 |
|
|
961 |
P1798C
Candy Store
|
0 / 0 |
5 |
|
|
960 |
P1798D
Shocking Arrangement
|
0 / 0 |
5 |
|
|
959 |
P1798E
Multitest Generator
|
0 / 0 |
8 |
|
|
958 |
P1798F
Gifts from Grandfather Ahmed
|
0 / 0 |
9 |
|
|
957 |
P1799A
Recent Actions
|
0 / 0 |
3 |
|
|
956 |
P1799B
Equalize by Divide
|
0 / 0 |
4 |
|
|
955 |
P1799C
Double Lexicographically Minimum
|
0 / 0 |
5 |
|
|
954 |
P1799D1
Hot Start Up (easy version)
|
0 / 0 |
6 |
|
|
953 |
P1799D2
Hot Start Up (hard version)
|
0 / 0 |
7 |
|
|
952 |
P1799E
City Union
|
0 / 0 |
8 |
|
|
951 |
P1799F
Halve or Subtract
|
0 / 0 |
10 |
|
|
950 |
P1799G
Count Voting
|
0 / 0 |
10 |
|
|
949 |
P1799H
Tree Cutting
|
0 / 0 |
10 |
|
|
948 |
P1800A
Is It a Cat?
|
0 / 0 |
3 |
|
|
947 |
P1800B
Count the Number of Pairs
|
0 / 0 |
3 |
|
|
946 |
P1800C1
Powering the Hero (easy version)
|
0 / 0 |
3 |
|
|
945 |
P1800C2
Powering the Hero (hard version)
|
0 / 0 |
3 |
|
|
944 |
P1800D
Remove Two Letters
|
0 / 0 |
4 |
|
|
943 |
P1800E1
Unforgivable Curse (easy version)
|
0 / 0 |
4 |
|
|
942 |
P1800E2
Unforgivable Curse (hard version)
|
0 / 0 |
5 |
|
|
941 |
P1800F
Dasha and Nightmares
|
0 / 0 |
6 |
|
|
940 |
P1800G
Symmetree
|
0 / 0 |
8 |
|
|
939 |
P1801A
The Very Beautiful Blanket
|
0 / 0 |
5 |
|
|
938 |
P1801B
Buying gifts
|
0 / 0 |
6 |
|
|
937 |
P1801C
Music Festival
|
0 / 0 |
6 |
|
|
936 |
P1801D
The way home
|
0 / 0 |
7 |
|
|
935 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
|
934 |
P1801F
Another n-dimensional chocolate bar
|
0 / 0 |
10 |
|
|
933 |
P1801G
A task for substrings
|
0 / 0 |
10 |
|
|
932 |
P1802A
Likes
|
0 / 0 |
3 |
|
|
931 |
P1802B
Settlement of Guinea Pigs
|
0 / 0 |
3 |
|
|
930 |
P1804A
Lame King
|
0 / 0 |
3 |
|
|
929 |
P1804B
Vaccination
|
0 / 0 |
3 |
|
|
928 |
P1804C
Pull Your Luck
|
0 / 0 |
5 |
|
|
927 |
P1804D
Accommodation
|
0 / 0 |
7 |
|
|
926 |
P1804E
Routing
|
0 / 0 |
9 |
|
|
925 |
P1804F
Approximate Diameter
|
0 / 0 |
10 |
|
|
924 |
P1804G
Flow Control
|
0 / 0 |
10 |
|
|
923 |
P1804H
Code Lock
|
0 / 0 |
10 |
|
|
922 |
P1805A
We Need the Zero
|
0 / 0 |
3 |
|
|
921 |
P1805B
The String Has a Target
|
0 / 0 |
3 |
|
|
920 |
P1805C
Place for a Selfie
|
0 / 0 |
4 |
|
|
919 |
P1805D
A Wide, Wide Graph
|
0 / 0 |
6 |
|
|
918 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
|
917 |
P1805F1
Survival of the Weakest (easy version)
|
0 / 0 |
10 |
|
|
916 |
P1805F2
Survival of the Weakest (hard version)
|
0 / 0 |
10 |
|
|
915 |
P1806A
Walking Master
|
0 / 0 |
3 |
|
|
914 |
P1806B
Mex Master
|
0 / 0 |
3 |
|
|
913 |
P1806C
Sequence Master
|
0 / 0 |
5 |
|
|
912 |
P1806D
DSU Master
|
0 / 0 |
9 |
|
|
911 |
P1806E
Tree Master
|
0 / 0 |
8 |
|
|
910 |
P1806F1
GCD Master (easy version)
|
0 / 0 |
10 |
|
|
909 |
P1806F2
GCD Master (hard version)
|
0 / 0 |
10 |
|
|
908 |
P1807A
Plus or Minus
|
0 / 0 |
3 |
|
|
907 |
P1807B
Grab the Candies
|
0 / 0 |
3 |
|
|
906 |
P1807C
Find and Replace
|
0 / 0 |
3 |
|
|
905 |
P1807D
Odd Queries
|
0 / 0 |
3 |
