Elics的博客

1001Cut The Wire Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 10125Accepted Submission(s): 2502 Problem Description In the country ofInfinity, there is a strange road. This road onl...

VC Is All You Need Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 2033Accepted Submission(s): 845 Problem Description Three points example. Four points example. In this pictu...

License Plate Recognition Calculus

I love 114514 Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1410Accepted Submission(s): 1098 Problem Description Mr.I loves 114514 very much. Now Mr.I has a string, if "114514" is a substr...

I love string Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 2070Accepted Submission(s): 965 Problem Description Mr X likes to play string games. Mr X has an operation sequence. This oper...

I love cube Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 2805Accepted Submission(s): 770 Problem Description Give you a cube with a side length of n-1. Find the number of equilateral tr...

Problem Description Given n-1 points, numbered from 2 to n, the edge weight between the two points a and b is lcm(a, b). Please find the minimum spanning tree formed by them. A minimum spanning tree is a subset of the edges of a connected, edge-weighted u

Problem Description You are given an integern. You are required to calculate (n mod 1) or (n mod 2) or ... or (n mod (n - 1)) or (n mod n). The "or" operation means "bitwise OR". Input The first line contains an integerT(1≤T≤5000)representing the numb..