|
|
1974 |
codeforces#P1167B Lost Numbers
|
0 / 0 |
4 |
|
|
1975 |
codeforces#P1167C News Distribution
|
0 / 0 |
4 |
|
|
1973 |
codeforces#P1167D Bicolored RBS
|
0 / 0 |
5 |
|
|
1972 |
codeforces#P1167E Range Deleting
|
0 / 0 |
7 |
|
|
1971 |
codeforces#P1167F Scalar Queries
|
2 / 10 |
8 |
|
|
1969 |
codeforces#P1167G Low Budget Inception
|
0 / 0 |
10 |
|
|
1970 |
codeforces#P1168A Increasing by Modulo
|
0 / 0 |
5 |
|
|
1968 |
codeforces#P1168B Good Triple
|
0 / 0 |
6 |
|
|
1967 |
codeforces#P1168C And Reachability
|
0 / 0 |
8 |
|
|
1966 |
codeforces#P1168D Anagram Paths
|
0 / 0 |
10 |
|
|
1965 |
codeforces#P1168E Xor Permutations
|
0 / 0 |
10 |
|
|
1964 |
codeforces#P1169A Circle Metro
|
1 / 1 |
3 |
|
|
1963 |
codeforces#P1169B Pairs
|
0 / 0 |
5 |
|
|
1962 |
codeforces#P1170A Three Integers Again
|
0 / 0 |
(无) |
|
|
1961 |
codeforces#P1170B Bad Days
|
0 / 0 |
(无) |
|
|
1960 |
codeforces#P1170C Minus and Minus Give Plus
|
0 / 0 |
(无) |
|
|
1959 |
codeforces#P1170D Decoding of Integer Sequences
|
0 / 0 |
(无) |
|
|
1958 |
codeforces#P1170E Sliding Doors
|
0 / 0 |
(无) |
|
|
1957 |
codeforces#P1170F Wheels
|
0 / 0 |
(无) |
|
|
1956 |
codeforces#P1170G Graph Decomposition
|
0 / 0 |
(无) |
|
|
1955 |
codeforces#P1170H Longest Saw
|
0 / 0 |
(无) |
|
|
1954 |
codeforces#P1170I Good Subsets
|
0 / 0 |
(无) |
|
|
1953 |
codeforces#P1172A Nauuo and Cards
|
0 / 2 |
6 |
|
|
1952 |
codeforces#P1172B Nauuo and Circle
|
0 / 0 |
6 |
|
|
1951 |
codeforces#P1172C1 Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
1949 |
codeforces#P1172C2 Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
1950 |
codeforces#P1172D Nauuo and Portals
|
0 / 0 |
10 |
|
|
1947 |
codeforces#P1172E Nauuo and ODT
|
0 / 0 |
10 |
|
|
1948 |
codeforces#P1172F Nauuo and Bug
|
0 / 0 |
10 |
|
|
1946 |
codeforces#P1173A Nauuo and Votes
|
1 / 1 |
3 |
|
|
1945 |
codeforces#P1173B Nauuo and Chess
|
0 / 0 |
3 |
|
|
1944 |
codeforces#P1174A Ehab Fails to Be Thanos
|
0 / 0 |
3 |
|
|
1943 |
codeforces#P1174B Ehab Is an Odd Person
|
0 / 0 |
4 |
|
|
1942 |
codeforces#P1174C Ehab and a Special Coloring Problem
|
0 / 0 |
4 |
|
|
1941 |
codeforces#P1174D Ehab and the Expected XOR Problem
|
1 / 1 |
6 |
|
|
1940 |
codeforces#P1174E Ehab and the Expected GCD Problem
|
1 / 6 |
9 |
|
|
1939 |
codeforces#P1174F Ehab and the Big Finale
|
0 / 0 |
9 |
|
|
1938 |
codeforces#P1175A From Hero to Zero
|
0 / 0 |
3 |
|
|
1937 |
codeforces#P1175B Catch Overflow!
|
0 / 0 |
5 |
|
|
1936 |
codeforces#P1175C Electrification
|
0 / 0 |
5 |
|
|
1935 |
codeforces#P1175D Array Splitting
|
0 / 0 |
6 |
|
|
1934 |
codeforces#P1175E Minimal Segment Cover
|
1 / 1 |
8 |
|
|
1933 |
codeforces#P1175F The Number of Subpermutations
|
1 / 2 |
9 |
|
|
1932 |
codeforces#P1175G Yet Another Partiton Problem
|
0 / 0 |
10 |
|
|
1931 |
codeforces#P1176A Divide it!
|
1 / 1 |
3 |
|
|
1930 |
codeforces#P1176B Merge it!
|
0 / 0 |
3 |
|
|
1929 |
codeforces#P1176C Lose it!
|
0 / 0 |
4 |
|
|
1928 |
codeforces#P1176D Recover it!
|
0 / 0 |
6 |
|
|
1927 |
codeforces#P1176E Cover it!
|
0 / 0 |
5 |
|
|
1926 |
codeforces#P1176F Destroy it!
|
0 / 0 |
7 |
