|
3316 |
codeforces#P877D Olya and Energy Drinks
|
0 / 0 |
7 |
|
3300 |
codeforces#P883G Orientation of Edges
|
0 / 0 |
6 |
|
3291 |
codeforces#P884C Bertown Subway
|
0 / 0 |
5 |
|
3264 |
codeforces#P891D Sloth
|
0 / 0 |
10 |
|
3258 |
codeforces#P893C Rumor
|
0 / 0 |
4 |
|
3244 |
codeforces#P896A Nephren gives a riddle
|
0 / 0 |
5 |
|
3218 |
codeforces#P901C Bipartite Segments
|
0 / 0 |
8 |
|
3217 |
codeforces#P901D Weighting a Tree
|
0 / 0 |
10 |
|
3214 |
codeforces#P902B Coloring a Tree
|
0 / 0 |
4 |
|
3187 |
codeforces#P909E Coprocessor
|
0 / 0 |
6 |
|
3185 |
codeforces#P910A The Way to Home
|
0 / 0 |
3 |
|
3177 |
codeforces#P911F Tree Destruction
|
0 / 0 |
9 |
|
3171 |
codeforces#P912E Prime Gift
|
0 / 0 |
9 |
|
3151 |
codeforces#P915D Almost Acyclic Graph
|
0 / 0 |
8 |
|
3141 |
codeforces#P917B MADMAX
|
0 / 0 |
5 |
|
3132 |
codeforces#P919D Substring
|
0 / 0 |
5 |
|
3127 |
codeforces#P920C Swap Adjacent Elements
|
0 / 0 |
4 |
|
3125 |
codeforces#P920E Connected Components?
|
1 / 1 |
7 |
|
3065 |
codeforces#P930A Peculiar apple-tree
|
0 / 0 |
5 |
|
3056 |
codeforces#P932B Recursive Queries
|
0 / 0 |
4 |
|
3039 |
codeforces#P935E Fafa and Ancient Mathematics
|
0 / 0 |
8 |
|
3036 |
codeforces#P936B Sleepy Game
|
0 / 0 |
7 |
|
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 |
|
2948 |
codeforces#P960E Alternating Tree
|
0 / 0 |
8 |
|
2930 |
codeforces#P962F Simple Cycles Edges
|
0 / 0 |
9 |
|
2928 |
codeforces#P963B Destruction of a Tree
|
0 / 0 |
7 |
|
2901 |
codeforces#P977D Divide by three, multiply by two
|
0 / 0 |
4 |
|
2900 |
codeforces#P977E Cyclic Components
|
0 / 0 |
5 |
|
2889 |
codeforces#P979C Kuro and Walking Route
|
0 / 0 |
5 |
|
2870 |
codeforces#P982C Cut 'em all!
|
0 / 0 |
5 |
|
2867 |
codeforces#P982F The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
2850 |
codeforces#P986C AND Graph
|
0 / 0 |
9 |
|
2827 |
codeforces#P990F Flow Control
|
0 / 0 |
9 |
|
2787 |
codeforces#P999E Reachability from the Capital
|
1 / 1 |
7 |
|
2781 |
codeforces#P1000E We Need More Bosses
|
0 / 0 |
7 |
|
2735 |
codeforces#P1005F Berland and the Shortest Paths
|
0 / 0 |
7 |
|
2730 |
codeforces#P1006E Military Problem
|
0 / 0 |
5 |
|
2711 |
codeforces#P1010D Mars rover
|
0 / 0 |
7 |
|
2705 |
codeforces#P1012B Chemical table
|
0 / 0 |
6 |
|
2686 |
codeforces#P1016F Road Projects
|
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 |
|
2650 |
codeforces#P1027F Session in BSU
|
0 / 0 |
9 |
|
2614 |
codeforces#P1033A King Escape
|
0 / 0 |
3 |
|
2610 |
codeforces#P1033E Hidden Bipartite Graph
|
0 / 0 |
10 |