11D_Beyonder's Blog

Problem Description Two people face two piles of stones and make a game. They take turns to take stones. As game rules, there are two different methods of taking stones: One scheme is that you can take any number of stones in any one pile while the alternative is to take the same amount of stones at the same time in two piles. In the end, the first person taking all the stones is winner. Now,giving the initial number of two stones, can you win this game if you are the first to take stones and bo ...

A. Portal ↬\looparrowright↬ 题目描述 You are now in a big factory. The factory could be recognized as a graph with n vertices and m edges. Every edge has its length. You have kkk missions to do. The iii-th mission is going to vertex aia_iai​, picking a block and then sending it to vertex bib_ibi​. You should complete the missions in the order from 111-st to kkk-th. Initially you are standing at vertex 111. You have a gun in your hand. When you are at some vertex uuu, you could shoot the gun at the ...

B. Basic Gcd Problem ↬\looparrowright↬ 题目描述 As a great ACMer, ZYB is also good at math and number theory. ZYB constructs a function f_c(x) such that: $$ f_c(x)=\left\{\begin{matrix} \max\limits_{1\leqslant i\leqslant x-1}cf_c(\gcd(i,x)) &x>1\\ 1&x=1 \end{matrix}\right. $$ Give some positive integer pairs (ni,ci)(n_i, c_i)(ni​,ci​), ZYB wants to know fci(ni) mod (109+7)f_{c_i}(n_i)\bmod (10^9+7)fci​​(ni​)mod(109+7). 输入描述 The input contains multiple test cases. The first line of input contains one ...

A. Clam and Fish ↬\looparrowright↬ 题目描述 There is a fishing game as following. The game contains nnn stages, numbered from 111 to nnn. There are four types of stages (numbered from 000 to 333). Type 000: There are no fish and no clam in this stage. Type 111: There are no fish and one clam in this stage. Type 222: There are one fish and no clam in this stage. Type 333: There are one fish and one clam in this stage. In each stage, you can do exactly one of the following four actions. If there is a ...

Problem Description Let’s define the Fibonacci Sequence f1,f2,⋯f_1,f_2,\cdotsf1​,f2​,⋯ as f1=1,f2=2,fi=fi−1+f_1=1,f_2=2,f_i=f_{i−1}+f1​=1,f2​=2,fi​=fi−1​+fi−2(i⩾3)f_{i−2} (i\geqslant3)fi−2​(i⩾3). It’s well known that every positive integer xxx has its unique Fibonacci representation b1,b2,⋯ ,bnb_1,b_2,\cdots,b_nb1​,b2​,⋯,bn​ such that: b1×f1+b2×f2+⋯+bn×fn=xb_1×f_1+b_2×f_2+⋯+b_n×f_n=xb1​×f1​+b2​×f2​+⋯+bn​×fn​=x; bn=1b_n=1bn​=1, and for each 1⩽i<n1\leqslant i<n1⩽i<n, $b_i∈\{0,1\}$ always ...

传送门 ↬\looparrowright↬ Problem Description Little Q’s factory recently purchased mmm pieces of new equipment, labeled by 1,2,⋯ ,m1,2,\cdots,m1,2,⋯,m. There are nnn workers in the factory, labeled by 1,2,⋯ ,n1,2,\cdots,n1,2,⋯,n. Each worker can be assigned to no more than one piece of equipment, and no piece of equipment can be assigned to multiple workers. If little Q assigns the iii-th worker to the jjj-th piece of equipment, he will need to pay aij2+bij+cia_ij^2+b_ij+c_iai​j2+bi​j+ci​ dollars ...

题目描述 深海资源考察探险队的潜艇将到达深海的海底进行科学考察。 潜艇内有多个深海机器人。潜艇到达深海海底后，深海机器人将离开潜艇向预定目标移动。 深海机器人在移动中还必须沿途采集海底生物标本。沿途生物标本由最先遇到它的深海机器人完成采集。 每条预定路径上的生物标本的价值是已知的，而且生物标本只能被采集一次。 本题限定深海机器人只能从其出发位置沿着向北或向东的方向移动，而且多个深海机器人可以在同一时间占据同一位置。 用一个 p×qp\times qp×q 网格表示深海机器人的可移动位置。西南角的坐标为 (0,0)(0,0)(0,0)，东北角的坐标为 (p,q)(p,q)(p,q)。 给定每个深海机器人的出发位置和目标位置，以及每条网格边上生物标本的价值。 计算深海机器人的最优移动方案， 使深海机器人到达目的地后，采集到的生物标本的总价值最高。 输入格式 文件的第 111 行为深海机器人的出发位置数 aaa,和目的地数 bbb 。 第 222 行为 ppp 和 qqq 的值。 接下来的 p+1p+1p+1 行,每行有 qqq 个正整数,表示向东移动路径上生物标本的价值,行数据依从南到北 ...

题目描述 给定一个由 nnn 行数字组成的数字梯形如下图所示。 梯形的第一行有 mmm 个数字。从梯形的顶部的 mmm 个数字开始，在每个数字处可以沿左下或右下方向移动，形成一条从梯形的顶至底的路径。 分别遵守以下规则： 从梯形的顶至底的 mmm 条路径互不相交； 从梯形的顶至底的 mmm 条路径仅在数字结点处相交； 从梯形的顶至底的 mmm 条路径允许在数字结点相交或边相交。 输入格式 第 111 行中有 222 个正整数 mmm 和 nnn，分别表示数字梯形的第一行有 mmm 个数字，共有 nnn 行。接下来的 nnn 行是数字梯形中各行的数字。 第 111 行有 mmm 个数字，第 222 行有 m+1m+1m+1 个数字，以此类推。 输出格式 将按照规则 111，规则 222，和规则 333 计算出的最大数字总和并输出，每行一个最大总和。 输入输出样例 输入 #1 2 5 2 3 3 4 5 9 10 9 1 1 1 10 1 1 1 1 10 12 1 1 输出 #1 66 75 77 说明/提示 1⩽m,n⩽201\leqslant m,n \leqslant 2 ...

开发环境 使用 Visual Studio 2019\text{Visual Studio 2019}Visual Studio 2019 开发，程序直接在 cmd\text{cmd}cmd 界面运行。 题目 应用场景 一车站每天有 nnn 个发车班次，每个班次都有一班次号 1,2,3⋯n1,2,3\cdots n1,2,3⋯n，固定发车时间，固定的路线（起始站、终点站），大致的行车时间、固定的额定载客量。 某一天得车次如下表所述。 班次 发车时间 起点站 终点站 行车时间（小时） 额定载量（人） 已订票人数（人） 1 8:00 郫县 广汉 2 45 30 2 6:30 郫县 成都 0.5 40 40 3 7:00 郫县 成都 0.5 40 20 4 10:00 郫县 成都 0.5 40 2 功能要求 用 C/C++\text{C/C++}C/C++设计一系统，能提供下列服务： （1）录入班次信息（信息用文件保存），可不定时地增加班次数据； （2）浏览班次信息，即显示所有班次当前状况。 视频演示 车票管理系统（BV1Qp4y1i76Q）演示，有录入班次信 ...

A. All with Pairs ↬\looparrowright↬ 题目描述 Given nnn strings s1,s2,⋯ ,sns_1, s_2, \cdots, s_ns1​,s2​,⋯,sn​. Now define f(s,t)f(s,t)f(s,t) as the maximum iii that satisfy s1⋯i=t∣t∣−i+1⋯∣t∣s_{1\cdots i} = t_{|t|-i+1 \cdots |t|}s1⋯i​=t∣t∣−i+1⋯∣t∣​, and if such iii doesn’t exist, f(s,t)=0f(s, t) = 0f(s,t)=0. The Problem is to calculate: \sum_{i=1}^{n}\sum_{j=1}^{n}f(s_i, s_j)^2 \pmod{998244353}∑ i=1 n ​ ∑ j=1 n ​ f(s i ​ ,s j ​ ) 2 (mod998244353) 输入描述: The first line contains one integer n~(1 \le ...