Problem Description Let’s call a weighted connected undirected graph of n vertices and m edges KD-G ...
Problem Description Let’s call a weighted connected undirected graph of n vertices and m edges KD-G ...
Problem Description Given a sequence of integers of length n, find the shortest consecutive subsequ ...
Problem Description Given n-1 points, numbered from 2 to n, the edge weight between the two points ...
Problem Description Give you a cube with a side length of n-1. Find the number of equilateral trian ...
Problem Description You are required to put n straight lines on a plane, guaranteeing no three line ...
Problem Description One day, a zombie came to the Lawn of the Dead, which can be seen as an n×m gri ...
Problem Description Alice and Bob are playing a game. They take turns to operate. There are n numb ...
Problem Description Given a matrix of n rows and m columns,find the largest area submatrix which is ...
Banzhuan *Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total ...