|
3151 |
codeforces#P915D Almost Acyclic Graph
|
0 / 0 |
8 |
|
3149 |
codeforces#P915F Imbalance Value of a Tree
|
0 / 0 |
9 |
|
3145 |
codeforces#P916C Jamie and Interesting Graph
|
0 / 0 |
5 |
|
3141 |
codeforces#P917B MADMAX
|
0 / 0 |
5 |
|
3132 |
codeforces#P919D Substring
|
0 / 0 |
5 |
|
3130 |
codeforces#P919F A Game With Numbers
|
0 / 0 |
10 |
|
3125 |
codeforces#P920E Connected Components?
|
1 / 1 |
7 |
|
3097 |
codeforces#P923F Public Service
|
0 / 0 |
10 |
|
3071 |
codeforces#P928C Dependency management
|
0 / 0 |
6 |
|
3065 |
codeforces#P930A Peculiar apple-tree
|
0 / 0 |
5 |
|
3048 |
codeforces#P933C A Colourful Prospect
|
0 / 0 |
10 |
|
3036 |
codeforces#P936B Sleepy Game
|
0 / 0 |
7 |
|
3028 |
codeforces#P938D Buy a Ticket
|
1 / 1 |
7 |
|
3025 |
codeforces#P938G Shortest Path Queries
|
2 / 8 |
10 |
|
3024 |
codeforces#P939A Love Triangle
|
2 / 2 |
3 |
|
3021 |
codeforces#P939D Love Rescue
|
0 / 0 |
5 |
|
3005 |
codeforces#P948A Protect Sheep
|
1 / 1 |
3 |
|
3003 |
codeforces#P949C Data Center Maintenance
|
0 / 0 |
6 |
|
2987 |
codeforces#P954D Fight Against Traffic
|
1 / 2 |
5 |
|
2970 |
codeforces#P958B2 Maximum Control (medium)
|
0 / 0 |
8 |
|
2954 |
codeforces#P959E Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
2947 |
codeforces#P960F Pathwalks
|
0 / 0 |
7 |
|
2930 |
codeforces#P962F Simple Cycles Edges
|
0 / 0 |
9 |
|
2907 |
codeforces#P976D Degree Set
|
0 / 0 |
9 |
|
2905 |
codeforces#P976F Minimal k-covering
|
1 / 1 |
9 |
|
2900 |
codeforces#P977E Cyclic Components
|
0 / 0 |
5 |
|
2881 |
codeforces#P980F Cactus to Tree
|
0 / 0 |
10 |
|
2870 |
codeforces#P982C Cut 'em all!
|
0 / 0 |
5 |
|
2867 |
codeforces#P982F The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
2864 |
codeforces#P983C Elevator
|
0 / 0 |
9 |
|
2852 |
codeforces#P986A Fair
|
0 / 0 |
5 |
|
2850 |
codeforces#P986C AND Graph
|
0 / 0 |
9 |
|
2847 |
codeforces#P986F Oppa Funcan Style Remastered
|
0 / 0 |
10 |
|
2835 |
codeforces#P989C A Mist of Florescence
|
0 / 0 |
6 |
|
2829 |
codeforces#P990D Graph And Its Complement
|
0 / 0 |
5 |
|
2802 |
codeforces#P995E Number Clicker
|
0 / 0 |
10 |
|
2787 |
codeforces#P999E Reachability from the Capital
|
1 / 1 |
7 |
|
2781 |
codeforces#P1000E We Need More Bosses
|
0 / 0 |
7 |
|
2749 |
codeforces#P1003E Tree Constructing
|
1 / 2 |
7 |
|
2735 |
codeforces#P1005F Berland and the Shortest Paths
|
0 / 0 |
7 |
|
2730 |
codeforces#P1006E Military Problem
|
0 / 0 |
5 |
|
2718 |
codeforces#P1009D Relatively Prime Graph
|
0 / 0 |
5 |
|
2716 |
codeforces#P1009G Allowed Letters
|
0 / 0 |
9 |
|
2711 |
codeforces#P1010D Mars rover
|
0 / 0 |
7 |
|
2709 |
codeforces#P1010F Tree
|
0 / 0 |
10 |
|
2705 |
codeforces#P1012B Chemical table
|
0 / 0 |
6 |
|
2674 |
codeforces#P1019C Sergey's problem
|
0 / 0 |
10 |
|
2669 |
codeforces#P1020B Badge
|
0 / 0 |
3 |
|
2664 |
codeforces#P1023F Mobile Phone Network
|
1 / 1 |
10 |
|
2652 |
codeforces#P1027D Mouse Hunt
|
0 / 0 |
5 |