|
|
3080 |
codeforces#P926E Merge Equal Elements
|
0 / 0 |
6 |
|
|
3075 |
codeforces#P926J Segments
|
0 / 0 |
7 |
|
|
3063 |
codeforces#P930C Teodor is not a liar!
|
0 / 0 |
6 |
|
|
3062 |
codeforces#P930D Game with Tokens
|
0 / 0 |
9 |
|
|
3061 |
codeforces#P930E Coins Exhibition
|
0 / 0 |
10 |
|
|
3056 |
codeforces#P932B Recursive Queries
|
0 / 0 |
4 |
|
|
3052 |
codeforces#P932F Escape Through Leaf
|
1 / 2 |
10 |
|
|
3038 |
codeforces#P935F Fafa and Array
|
0 / 0 |
10 |
|
|
3028 |
codeforces#P938D Buy a Ticket
|
1 / 1 |
7 |
|
|
3025 |
codeforces#P938G Shortest Path Queries
|
2 / 8 |
10 |
|
|
3019 |
codeforces#P939F Cutlet
|
1 / 2 |
9 |
|
|
3014 |
codeforces#P940E Cashback
|
2 / 3 |
7 |
|
|
3013 |
codeforces#P940F Machine Learning
|
0 / 1 |
10 |
|
|
3006 |
codeforces#P946G Almost Increasing Array
|
0 / 0 |
9 |
|
|
2983 |
codeforces#P954G Castle Defense
|
0 / 0 |
7 |
|
|
2970 |
codeforces#P958B2 Maximum Control (medium)
|
0 / 0 |
8 |
|
|
2967 |
codeforces#P958C3 Encryption (hard)
|
0 / 0 |
9 |
|
|
2951 |
codeforces#P960B Minimize the error
|
0 / 0 |
5 |
|
|
2947 |
codeforces#P960F Pathwalks
|
0 / 0 |
7 |
|
|
2944 |
codeforces#P960H Santa's Gift
|
0 / 0 |
10 |
|
|
2942 |
codeforces#P961B Lecture Sleep
|
0 / 0 |
4 |
|
|
2939 |
codeforces#P961E Tufurama
|
2 / 2 |
6 |
|
|
2933 |
codeforces#P962D Merge Equals
|
1 / 1 |
5 |
|
|
2931 |
codeforces#P962G Visible Black Areas
|
0 / 0 |
10 |
|
|
2918 |
codeforces#P965E Short Code
|
0 / 0 |
8 |
|
|
2893 |
codeforces#P978F Mentors
|
0 / 0 |
5 |
|
|
2888 |
codeforces#P979D Kuro and GCD and XOR and SUM
|
0 / 0 |
8 |
|
|
2882 |
codeforces#P980E The Number Games
|
0 / 0 |
8 |
|
|
2876 |
codeforces#P981E Addition on Segments
|
0 / 0 |
8 |
|
|
2874 |
codeforces#P981G Magic multisets
|
0 / 0 |
9 |
|
|
2873 |
codeforces#P981H K Paths
|
0 / 0 |
10 |
|
|
2871 |
codeforces#P982B Bus of Characters
|
0 / 0 |
4 |
|
|
2869 |
codeforces#P982D Shark
|
0 / 0 |
6 |
|
|
2863 |
codeforces#P983D Arkady and Rectangles
|
0 / 0 |
10 |
|
|
2862 |
codeforces#P983E NN country
|
1 / 1 |
10 |
|
|
2855 |
codeforces#P985E Pencils and Boxes
|
0 / 0 |
7 |
|
|
2848 |
codeforces#P986E Prince's Problem
|
0 / 0 |
10 |
|
|
2815 |
codeforces#P992E Nastya and King-Shamans
|
0 / 0 |
9 |
|
|
2804 |
codeforces#P995C Leaving the Bar
|
0 / 1 |
8 |
|
|
2794 |
codeforces#P997E Good Subsegments
|
1 / 1 |
10 |
|
|
2788 |
codeforces#P999D Equalize the Remainders
|
0 / 0 |
6 |
|
|
2783 |
codeforces#P1000C Covered Points Count
|
1 / 3 |
5 |
|
|
2780 |
codeforces#P1000F One Occurrence
|
3 / 6 |
9 |
|
|
2779 |
codeforces#P1000G Two-Paths
|
0 / 0 |
10 |
|
|
2742 |
codeforces#P1004E Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
2743 |
codeforces#P1004F Sonya and Bitwise OR
|
0 / 1 |
10 |
|
|
2732 |
codeforces#P1006C Three Parts of the Array
|
0 / 0 |
4 |
|
|
2728 |
codeforces#P1007A Reorder the Array
|
0 / 0 |
4 |
|
|
2725 |
codeforces#P1007D Ants
|
0 / 0 |
10 |
|
|
2715 |
codeforces#P1009F Dominant Indices
|
3 / 7 |
8 |
