## 2021/11/21, Swordfinger offer--Simulation

JZ29 Clockwise Print Matrix Title Address describe Enter a matrix to print out each number in clockwise order from outside to inside, for example, if you enter the following 4 X 4 matrix: [[1,2,3,4], [5,6,7,8], [9,10,11,12], [13,14,15,16]] Print out the numbers in turn [1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10] Data Range: 0 <= matrix.len ...

Posted by kettle_drum on Sat, 20 Nov 2021 09:37:42 -0800

## The second "intelligence Cup" National College Students' IT skills competition (synchronized with the final)

T130013 garden party seal Title Description The College held a garden tour, in which a very important link is to collect seals. The stamp collection card is a piece of white paper with height and width of \ (h,w(20\le h \le 1000,50\le w \le 2000) \). Initially, each unit pixel is filled with (representing white). Now little A is stamping on A b ...

Posted by tentaguasu on Tue, 02 Nov 2021 14:05:16 -0700

## csp-s2020 T1 Julian day

Title: [CSP-S2020] Julian day - Valleyhttps://www.luogu.com.cn/problem/P7075 After reading the question, we can see that this question is a simulation question about time. According to the meaning of the question: The time is divided into two periods: the Julian calendar from January 1, 4713 BC to October 4, 1582 ad (inclusive); October 15 ...

Posted by tmswenson on Tue, 19 Oct 2021 19:02:08 -0700

## [CCO 2019]Sirtet - parallel heap + lazy mark acceleration simulation

[CCO 2019]Sirtet preface I don't understand. This problem is completely done according to the idea of simulation. Why does someone say that its essence is Dijkstra with differential constraints? The essence of Dijkstra is to do simulation, right? Problem solution First, consider how to simulate violence. The normal idea should be to let all ...

Posted by argoSquirrel on Fri, 15 Oct 2021 17:24:27 -0700

## Large simulated duck chess (250 lines of ultra short practice, easy to understand)

Title Description: Luogu Title portal pokes him!!! Problem solving ideas: Algorithm Introduction: The algorithm label clearly says that this problem is a proper big simulation. We can stabilize this problem without any algorithm optimization in the program. Don't ask me how I know As we all know, the topic of large-scale simulation is ...

Posted by ckdoublenecks on Sat, 02 Oct 2021 18:46:29 -0700

## PAT (Grade A) 2019 autumn test 7-2 Merging Linked Lists (25 points) Ling Chen 1642

PAT (Grade A) 2019 autumn test 7-2 Merging Linked Lists (25 points) Title Description: Given two singly linked lists L1=a1→a2→⋯→an−1→an and L2=b1→b2→⋯→bm−1→bm. If n≥2m, you are supposed to reverse and merge the shorter one into the longer one to obtain a list like a1→a2→bm→a3→a4→bm−1⋯. For example, given one list being 6→7 and the other one 1 ...

Posted by jwinn on Sat, 04 Sep 2021 13:38:14 -0700