，M-CSDN博客

原创 LDU 2020级国庆七天乐第1天部分题解

LDU 2020级国庆七天乐第1天部分题解F . Figure SkatingG . Group ProjectH . Human PyramidI . In-place SortingJ . Jam-packedK . Kangaroo Commotion F . Figure Skating 题目描述：给出预测排名和最终排名，如果最终没有人比预测排名好，则输出“suspicious”；否则打印最终排名比预测排名上升最多的选手的名字思路：这题没什么难度，主要是结构体的简单应用：n1记录预测，n2记录

2021-10-08 21:37:40 130

原创 Ldu 1824. G . Petri Net Simulation

题目描述：你的任务是模拟Petri网的变迁。Petri 网包含NP个库所(用P1，P2…表示) 和NT个变迁(用T1, T2…表示)。0<NP, NT<100。当每个变迁的每个输入库所都至少有一个 token时，变迁是允许的。变迁发生的结果是每个输入库所减少一个 token, 每个输出库所增加一个token。变迁的发生是原子性的，即所有token 的增加和减少应同时进行。注意，一个变迁可能有多个相同的输入或者输出。如果一个库所在变迁的输入库所列表中出现了两次，则token会减少两个。输出库

2021-07-25 15:37:12 119

原创 Ldu 1824 I. “Accordian“ Patience

ldu 1824 I. ‘‘Accordian’’ Patience 题目描述：把52张牌从左到右排好，每张牌自成一个牌堆 (pile)。当某张牌与它左边那张牌或者左边第3张牌“match" (花色suit或者点数rank相同)时，就把这张牌移到那张牌上面。移动之后还要查看是否可以进行其他移动。只有位于牌堆顶部的牌才能移动或者参与match.当牌堆之间出现空隙时要立刻把右边的所有牌堆左移格来填补空隙。如果有多张牌可以移动，先移动最左边的那张牌;如果既可以移一格也可以移3格时，移3格。按顺序输入52

2021-07-25 15:15:47 80

原创 LDUOJ 1586. 【吴永辉】程序设计基础实践7-9 P. Primed Subsequence

P. Primed Subsequence 题目描述 Given a sequence of positive integers of length n, we define a primed subsequence as a consecutive subsequence of length at least two that sums to a prime number greater than or equal to two. For example, given the sequence: 3 5

2021-04-08 00:07:00 320

原创 LDUOJ 1586. 【吴永辉】程序设计基础实践7-9 N. Dollar Dayz

N. Dollar Dayz 题目描述： Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer John has exactly $5 to spend. He can buy 5 tools at

2021-04-07 21:42:38 254 1

原创 LDUOJ 1586. 【吴永辉】程序设计基础实践7-9 O. Summation of Four Primes

O. Summation of Four Primes 题目描述 Euler proved in one of his classic theorems that prime numbers are infinite in number. But can every number be expressed as a summation of four positive primes? I don’t know the answer. May be you can help!!! I want your so

2021-03-29 00:20:13 175

原创 LDUOJ 1586. 【吴永辉】程序设计基础实践7-9 M. Charm Bracelet

M. Charm Bracelet 问题描述 Bessie has gone to the mall’s jewelry store and spies a charm bracelet. Of course, she’d like to fill it with the best charms possible from the N (1≤N≤3402) available charms. Each charm i in the supplied list has a weight Wi (1≤Wi≤40

2021-03-28 23:41:36 153

qq_51064901的博客