|
|
2869 |
2869
Coins Respawn
|
0 / 0 |
4 |
|
|
2881 |
2881
League
|
0 / 0 |
4 |
|
|
2900 |
2900
Pure
|
0 / 0 |
4 |
|
|
2905 |
2905
Travel by Car
|
0 / 0 |
4 |
|
|
3052 |
3052
.. (Double Dots)
|
0 / 0 |
3 |
|
|
3228 |
3228
Construct a Palindrome
|
0 / 0 |
6 |
|
|
3267 |
3267
Tour
|
0 / 0 |
2 |
|
|
3430 |
3430
Number of Shortest paths
|
0 / 0 |
3 |
|
|
3437 |
3437
Safety Journey
|
0 / 0 |
4 |
|
|
3533 |
3533
Just one
|
0 / 0 |
4 |
|
|
3567 |
3567
Neighbors
|
0 / 0 |
3 |
|
|
3583 |
3583
Swap and Sort
|
0 / 0 |
6 |
|
|
3616 |
3616
Range Sums
|
0 / 0 |
4 |
|
|
4266 |
4266
Endless Walk
|
0 / 0 |
4 |
|
|
4273 |
4273
typewriter
|
0 / 0 |
4 |
|
|
4342 |
4342
Takahashi's Anguish
|
0 / 0 |
3 |
|
|
4460 |
4460
Crystal Switches
|
0 / 0 |
4 |
|
|
4494 |
4494
Make Bipartite 2
|
0 / 0 |
4 |
|
|
4508 |
4508
Happy New Year 2023
|
0 / 0 |
2 |
|
|
4509 |
4509
Count Simple Paths
|
0 / 0 |
6 |
|
|
4515 |
4515
Change Usernames
|
0 / 0 |
3 |
|
|
4524 |
4524
Guess The Number 2
|
0 / 0 |
6 |
|
|
4525 |
4525
Unique Walk
|
0 / 0 |
4 |
|
|
4535 |
4535
Don’t be cycle
|
0 / 0 |
2 |
|
|
4544 |
4544
Swap Places
|
0 / 0 |
3 |
|
|
4579 |
4579
Circumferences
|
0 / 0 |
3 |
|
|
4628 |
4628
Well-defined Path Queries on a Namori
|
0 / 0 |
4 |
|
|
4647 |
4647
Do use hexagon grid
|
0 / 0 |
2 |
|
|
4661 |
4661
Subsequence Path
|
0 / 0 |
4 |
|
|
4670 |
4670
Unicyclic Components
|
0 / 0 |
2 |
|
|
4677 |
4677
Tying Rope
|
0 / 0 |
3 |
|
|
4699 |
4699
Transition Game
|
0 / 0 |
3 |
|
|
4700 |
4700
Simultaneous Swap
|
0 / 0 |
4 |
|
|
4720 |
4720
Nearest Black Vertex
|
0 / 0 |
3 |
|
|
4741 |
4741
Isolation
|
0 / 0 |
3 |
|
|
4742 |
4742
Merge Set
|
0 / 0 |
4 |
|
|
4755 |
4755
Good Graph
|
0 / 0 |
3 |
|
|
4762 |
4762
Art Gallery on Graph
|
0 / 0 |
3 |
|
|
4906 |
4906
Good Tuple Problem
|
0 / 0 |
3 |
|
|
4997 |
4997
Super Takahashi Bros.
|
0 / 0 |
3 |
|
|
5012 |
5012
Last Train
|
0 / 0 |
4 |
|
|
5033 |
5033
Many Lamps
|
0 / 0 |
6 |
|
|
5069 |
5069
Mediator
|
0 / 0 |
6 |
|
|
5082 |
5082
Estimate Order
|
0 / 0 |
6 |
|
|
5102 |
5102
Guess the Sum
|
0 / 0 |
6 |
|
|
5115 |
5115
Reachability in Functional Graph
|
0 / 0 |
4 |
|
|
5185 |
5185
Permute K times
|
0 / 0 |
3 |
|
|
5192 |
5192
Train Delay
|
0 / 0 |
6 |
|
|
5198 |
5198
Sightseeing Tour
|
0 / 0 |
4 |
|
|
5220 |
5220
Teleporting Takahashi 2
|
0 / 0 |
6 |
|
|
5242 |
5242
Road Blocked 2
|
0 / 0 |
6 |
|
|
5246 |
5246
Cycle
|
0 / 0 |
3 |
