Galaxy_Engineer的博客

CF 2022寒假练习

Galaxy_Engineer — Fri, 25 Feb 2022 17:33:26 +0800

CF 2022寒假练习 CF_2A Winner 链接 CF_2A Winner 题目大意有一个游戏，由nnn个玩家参与，每一轮会有一个玩家获得sss点数。游戏最后一轮结束后，点数最多的玩家获胜。如果游戏结束后，由多个玩家获得最多点数mmm，则他们当中最先获得至少mmm点的玩家获胜。解析进行两遍模拟，第一遍求出所有点数最多的玩家，第二遍求出最终获胜者。代码 #include #include #include #in

Luogu_P1879 [USACO06NOV]Corn Fields G

Galaxy_Engineer — Wed, 18 Aug 2021 21:01:59 +0800

Corn Fields G 链接 Luogu_P1879 [USACO06NOV]Corn Fields G 题目描述 Farmer John has purchased a lush new rectangular pasture composed of MMM by N(1≤M≤12;1≤N≤12)N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12)N(1≤M≤12;1≤N≤12) square parcels. He wants to grow some yummy corn for the cows

HDU_1811 Rank of Tetris

Galaxy_Engineer — Wed, 18 Aug 2021 20:33:34 +0800

Rank of Tetris 链接 HDU_1811 Rank of Tetris Description 自从Lele开发了Rating系统，他的Tetris事业更是如虎添翼，不久他遍把这个游戏推向了全球。为了更好的符合那些爱好者的喜好，Lele又想了一个新点子：他将制作一个全球Tetris高手排行榜，定时更新，名堂要比福布斯富豪榜还响。关于如何排名，这个不用说都知道是根据Rating从高到低来排，如果两个人具有相同的Rating，那就按这几个人的RP从高到低来排。终于，Lele要开始行动了，对N个人

CF_1506C Double-ended Strings（双头字符串）

Galaxy_Engineer — Tue, 17 Aug 2021 19:19:32 +0800

Double-ended Strings（双头字符串）链接 CF_1506C Double-ended Strings（双头字符串） Description if ∣a∣>0|a|>0∣a∣>0 (the length of the string aaa is greater than zero), delete the first character of the string aaa, that is, replace aaa with a2a3…ana2a3…ana2a3…an;

CF_91B Queue

Galaxy_Engineer — Mon, 16 Aug 2021 21:01:04 +0800

Queue 链接 CF_91B Queue Description There are n walruses standing in a queue in an airport. They are numbered starting from the queue’s tail: the 1-st walrus stands at the end of the queue and the n-th walrus stands at the beginning of the queue. The i-th wa

POJ_1182 食物链

Galaxy_Engineer — Mon, 16 Aug 2021 20:41:27 +0800

食物链链接 POJ_1182 食物链 Description 动物王国中有三类动物 A,B,CA,B,CA,B,C，这三类动物的食物链构成了有趣的环形。AAA 吃 BBB，BBB 吃 CCC，CCC 吃 AAA。现有 NNN 个动物，以 1－N1－N1－N 编号。每个动物都是 A,B,CA,B,CA,B,C 中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这 NNN 个动物所构成的食物链关系进行描述：第一种说法是 "1 X Y""1\ X\ Y""1 X&nb

POJ_2492 A Bug‘s Life

Galaxy_Engineer — Fri, 13 Aug 2021 23:36:16 +0800

A Bug’s Life 链接 POJ_2492 A Bug’s Life Description Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In

POJ_2031 Building a Space Station

Galaxy_Engineer — Tue, 10 Aug 2021 20:07:41 +0800

Building a Space Station 链接 Vjudge_452122C Building a Space Station Describe You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write a computer program to complet

POJ_1014 Dividing

Galaxy_Engineer — Tue, 10 Aug 2021 19:50:46 +0800

Dividing 链接 Vjudge_451992F Dividing Describe Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, becau

AcWing_105 七夕祭

Galaxy_Engineer — Tue, 10 Aug 2021 19:32:15 +0800

七夕祭题目链接 AcWing_105 七夕祭题目描述七夕节因牛郎织女的传说而被扣上了「情人节」的帽子。于是 TYVJTYVJTYVJ 今年举办了一次线下七夕祭。 VaniVaniVani 同学今年成功邀请到了 clclcl 同学陪他来共度七夕，于是他们决定去 TYVJTYVJTYVJ 七夕祭游玩。 TYVJTYVJTYVJ 七夕祭和 111111 区的夏祭的形式很像。矩形的祭典会场由 NNN 排 MMM 列共计 N×MN×MN×M 个摊点组成。虽然摊点种类繁多，不过 clclcl 只对其中的一部

HDU_1535 Invitation Cards （邀请卡片）

Galaxy_Engineer — Tue, 10 Aug 2021 16:24:50 +0800

邀请卡片链接 Vjudge_452077E 邀请卡片 Describe In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They have printed invita

HDU_2955 Robberies

Galaxy_Engineer — Sun, 08 Aug 2021 21:00:03 +0800

Robberies 链接 Robberies Description The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative business of bank rob

HDU_3085 Nightmare Ⅱ（噩梦）

Galaxy_Engineer — Fri, 06 Aug 2021 22:53:41 +0800

噩梦链接 Vjudge_451317D 噩梦 Description Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze. They will kill the people. Now little er

HDU_1560 DNA sequence（DNA序列）

Galaxy_Engineer — Fri, 06 Aug 2021 22:06:03 +0800

Vjudge_451160D DNA序列链接 Vjudge_451160D DNA序列 Description The twenty-first century is a biology-technology developing century. We know that a gene is made of DNA. The nucleotide bases from which DNA is built are A(adenine), C(cytosine), G(guanine), and T(th

POJ_1661 Help Jimmy

Galaxy_Engineer — Fri, 06 Aug 2021 16:42:53 +0800

Help Jimmy 链接 POJ_1661 Help Jimmy Description "Help"Help"Help Jimmy"Jimmy"Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。 JimmyJimmyJimmy 老鼠在时刻 000 从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当 JimmyJimmyJimmy 落到某个平台上时，游戏者选择让它向左还是向右跑，它跑动的速度也是 111 米/秒。当Ji

HDU_1873 看病要排队

Galaxy_Engineer — Tue, 03 Aug 2021 19:28:26 +0800

看病要排队题目链接 Vjudge_450970A 看病要排队 Description 看病要排队这个是地球人都知道的常识。不过经过细心的0068的观察，他发现了医院里排队还是有讲究的。0068所去的医院有三个医生（汗，这么少）同时看病。而看病的人病情有轻重，所以不能根据简单的先来先服务的原则。所以医院对每种病情规定了10种不同的优先级。级别为10的优先权最高，级别为1的优先权最低。医生在看病时，则会在他的队伍里面选择一个优先权最高的人进行诊治。如果遇到两个优先权一样的病人的话，则选择最早来排队的病人。

POJ_3122 Pie

Galaxy_Engineer — Tue, 03 Aug 2021 19:15:30 +0800

Pie 题目链接 POJ_3122 Pie Description My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number NNN of them, of various tastes and of various sizes. FFF of my friends are coming to my party and each of them gets a piece

POJ_3519 Median

Galaxy_Engineer — Tue, 03 Aug 2021 19:04:37 +0800

Median 题目链接 POJ_3519 Median Description Given NNN numbers, X1,X2,...,XNX1, X2, ... , XNX1,X2,...,XN, let us calculate the difference of every pair of numbers: ∣Xi−Xj∣(1≤i＜j≤N)|Xi - Xj| (1 ≤ i ＜ j ≤ N)∣Xi−Xj∣(1≤i＜j≤N). We can get C(N,2)C(N,2)C(N,2) differen

AcWing_97 约数之和

Galaxy_Engineer — Thu, 15 Jul 2021 16:42:47 +0800

约数之和链接 AcWing_97 约数之和题目描述假设现在有两个自然数 AAA 和 BBB，SSS 是 ABA^BAB 的所有约数之和。请你求出 S mod 9901S\bmod9901Smod9901 的值是多少。输入格式在一行中输入用空格隔开的两个整数 AAA 和 BBB。输出格式输出一个整数，代表 S mod 9901S\bmod9901Smod9901 的值。数据范围 0≤A,B≤5×1070≤A,B≤5×10^70≤A,B≤5×107 输入样例： 2 3 输出样例： 15 注

AcWing_91 最短Hamilton路径

Galaxy_Engineer — Thu, 15 Jul 2021 15:49:10 +0800

最短Hamilton路径链接 AcWing_91 最短Hamilton路径题目给定一张 nnn 个点的带权无向图，点从 0∼n−10∼n−10∼n−1 标号，求起点 000 到终点 n−1n−1n−1 的最短 HamiltonHamiltonHamilton 路径。 HamiltonHamiltonHamilton 路径的定义是从 000 到 n−1n−1n−1 不重不漏地经过每个点恰好一次。输入格式第一行输入整数 nnn。接下来 nnn 行每行 nnn 个整数，其中第 iii 行第 jjj 个