题目

切换题单

黄金

模式串替换

2人提交

小码哥在玩字符串。小码哥有两个由小写字母组成的模板串$$s_0,s_1$$，还有一个由0和1组成的模式串$$T$$，和小写字母组成的目标串$$S$$。小码哥想知道，他有多少种模板串组合$$s_0,s_1$$，且$$s_0$$和$$s_1$$不同，可以在将模式串中所有的0都换成$$s_0$$，所有的1都换成$$s_1$$之后，形成目标串。

青铜

偶数还是奇数

选择结构｜7836人提交

请编写一个简单程序，检查一个正整数是偶数还是奇数，如果是偶数输出Y，否则输出N。（不考虑0）

Intro: Dawn of a New Era

36人提交

Dear friends from across China, welcome to Shenyang! As the problem setters, along with the entire staff, we are deeply honored to have all of you here to enjoy a well-prepared event and witness the ninth consecutive year that Northeastern University (NEU) has hosted the ICPC Shenyang Regional Contest. The past years have been challenging for most individuals. Human society underwent the COVID-19 pandemic, yet we fought against it and triumphed. Humanity continues to be tested when it seems like the Night Howlers have eroded some people's minds. And for the lovely university where we are currently situated, it has just successfully concluded its centennial celebration, turning over a new page for the next century. So, those are what inspired us to name this intro problem. We sincerely hope one can strive constantly for dreams rather than being willing to become the tears of the times. We also hope one can heal the world with new-age technologies, not to steer our civilization to a sunset! As an integral part of Northeastern University's centennial celebration, the drone display utilized various colors to illuminate the night sky, creating pieces of stunning aerial artwork. In the intro problem, you are going to meet with a seemingly NP-hard task related to it. ![](/img/2024-03-18/f4TE6EXQapCbzAt2b1GkGbbjNPRyJNee.png "") Drone Display by Northeastern University Suppose that there are $$n$$ scenes in the drone display. The palette of each scene can be described by a set of integers identifying different colors, and we say the $$\textit{main color}$$ of a scene is the color with the largest integer in its palette. The drone operator intends to arrange the orders of the scenes. For each pair of $$\textbf{adjacent}$$ scenes after the reordering, if the main color of the previous scene is one of the colors present in the palette of the following scene, a $$\textit{transition}$$ will be contributed. Can you help construct an arrangement of scenes such that the number of transitions is maximized? More formally, let $$S_i$$ be the set of integers which describes the palette of the $$i$$-th scene. You need to construct a permutation $$p_1,p_2,\ldots,p_n$$ such that $$\sum_{i=1}^{n-1}{\left[\max\lbrace S_{p_{i}}\rbrace \in S_{p_{i+1}}\right]}$$ is maximized among all the permutations of length $$n$$, where $$\left[\max\lbrace S_{p_{i}}\rbrace \in S_{p_{i+1}}\right]$$ is $$1$$ when $$\max\lbrace S_{p_{i}}\rbrace \in S_{p_{i+1}}$$ and $$0$$ when $$\max\lbrace S_{p_{i}}\rbrace \notin S_{p_{i+1}}$$. Recall that a permutation of length $$n$$ is a sequence of $$n$$ integers in which every integer from $$1$$ to $$n$$ appears exactly once.

钻石

安全验证

6542人提交

小码哥是一名密码学专家，一天他的朋友拜托他设计一个简单的标识验证程序，用于服务器安全验证。小码哥答应了朋友的请求，设计了一个简单的标识验证方法。服务器会自带一个安全标识串 $$S$$，每隔一段时间会自动更新，客户端的每次请求都会先收到服务器的标识串，然后在下一次更新前需要找出 $$S$$ 中的一个真子串 $$T$$，满足既是 $$S$$ 的前后缀，又在 $$S$$ 中出现至少一次的最长串，找到后才能正常与服务器交互。小码哥虽然精通密码学，但对开发一窍不通，于是找到了你，希望你能协助他完成程序开发环节。

黄金

祖玛

5人提交

小码哥在玩祖玛。众所周知，祖玛消除是3连消除的。但是小码哥觉得这种三连消除祖玛太简单了，于是玩起了回文消除祖玛。现在小码哥有一串长度为 $$n$$ 的祖玛串，每次小码哥会选择一串连续回文子串进行消除，消除后子串前后的串会连在一起。问小码哥最快几次能消除掉整串祖玛串。

青铜

计算表达式的值

公式与计算｜16625人提交

请编写一个简单程序，计算45除以2再加上43.41592，然后减去36除以7的商，输出运算结果。

青铜

字母统计

循环结构｜1859人提交

请编写一个简单程序，从键盘输入一行字符，直到输入回车时结束。统计其中的字母个数。

钻石

中位数

2人提交

小码哥非常喜欢吃糖果，他有$$n$$个糖果罐编号为$$1\sim n$$，每个糖果罐有一个甜度标签，第$$i$$个罐子中的有无数颗甜度为$$a_i$$的糖果。尽管小码哥喜欢吃糖果，但为了保护牙齿，他约定自己每天只吃一颗糖果。每天小码哥都会从编号在$$[l,r]$$之间的糖果罐中选择一个罐中的一颗糖果。他既害怕选择的糖果太甜会损害牙齿，又不想吃太不甜的糖果，所以每天他会选择甜度为这些罐子甜度的中位数的那个罐子(如果有偶数个罐子，假设为$$2x$$个，则选择从小到大甜度排名为$$x$$的罐子)，然后取一颗糖果吃掉。由于小码哥只想吃糖果并不想计算哪个罐子会被他选中，所以他将这个问题交给你，你需要计算出小码哥每天选择的罐子编号以便他能开心地品尝糖果。

换一批

教材题库

官方正版 · 作者授权 · 专业能力提升平台

在线编程

题目

教材题库

热门题目

镇站之宝