## JS-S00020
:::info[[replace.cpp]**神秘no meaning**]
```cpp
#include<iostream>
using namespace std;
int main()
{
;;;
}
/*
It's of no meaning, just to fulfill the code.
```
:::
## JS-S00047
:::info[[employ.cpp]**十年前的仇难道不报了吗？**]
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("employ.in","r",stdin);
freopen("employ.out","w",stdout);
cout<<114514<<endl;
return 0;
}
//shi nian qian de chou nan dao bu bao le me?
```
:::
## JS-S00050
:::info[[club.cpp]**感谢这三年来属于你的戏份**]
```cpp
/*
17:45 死了，T1 T2 T3 T4 都不会做。。。懒得打暴搜了，估计也是最后一场考试了，随便写点吧，巧了可能能得到几分。。。
感谢陪伴我度过初中快乐的三年的所有人，陪我一起学 OI 的所有同学，以及每一位帮助过我的人。
我太菜了，什么都不会，不过感谢zy最后一天的鼓励。
实在不知道该写什么了，就这样吧。
哦哦，I love you!
名字一个代码放一个字母吧，缀在最后。
*/
/*z*/
```
:::
## JS-S00060
:::info[[replace.cpp]**没骂人，求放过**]
```cpp
// O(q*B^2 + q*(S/2*B ... meimaren))
// ccf qiufangguo
// dayangli ruocheng shenme yangzi le aaaaaa....
// ??? weishenme guandiao fsanitize 3s -> 0.5s ?
```
:::
## JS-S00071
:::info[[replace.cpp]**如你所愿** （我承认说话有点大声了）]
```cpp
* os:希望数据也能这么水
```
:::
:::info[[employ.cpp]**947这一块**]
```cpp
const int IMPORTANT_NUMBER = 947
```
:::
## JS-S00074
:::info[[employ.cpp]**不嘻嘻**]
```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("employ.in","r",stdin);
freopen("employ.out","w",stdout);
//bie xiao wo wo shi zai bu hui le!!!
}
```
:::
## JS-S00103
:::info[[replace.cpp]**考场追忆大蛇** 你怎么知道我两抽出银灰了]
```cpp
/*
CSP游记
2025年10月31日
第二天要去南外考场参加CSP-S第二轮，学校为了准备同考今天不布置作业，晚自习在教室里，去机房练习。
这还是我这一学期第一次去机房。。。步入高三之后就没有去过了。
generals好玩
2025年11月1日
今天不用上课，这两周起得最晚的一次。到学校的时候已经没有人了，学校大道上一个人都没有；
中午吃饭的时候正好12点，明日方舟更新了。没有抽出银灰，不过有初雪
13:55
考场里有一个人敲击键盘的声音特别大。。。。。
14:05
这个中文输入法真难用。。。
一年没写代码了，这几天临时突击了一下，还是没有恢复到去年的水平。
试机的时间就写了快速幂和线段树，不知道能不能用的上；
14:23
试机时间好长，写了一个lca
18:17
拼尽全力无法战胜，第二题最后还是没写出来，
一共做了不到200题，高中2年，在学校学信息竞赛，还没摸鱼时间多。。最终只做出第一题，第二题的k=0，第四题的暴力。。。；
不过我不后悔摸鱼的时间，也正是这些时间让我在高二找到了梦想中的专业；
快结束了，学校的同学们也都放假了，除了几个班级强制自愿留在学校的。。。
想想我来竞赛是干什么的，是来陪跑的？还是给CCF捐款560的？
在过210天就要高考了。结束这一次南京之行，又要回到高中学校生活了，有点绝望。
这样的日子里，即使知道为什么而活，也很难忍受这中生活
还有5分钟就结束了
再见，信息竞赛
*/
```
:::
## JS-S00127
:::info[[club.cpp]**freopen(分头行动版)**]
```cpp
freopen("club.in","r",stdin);
………………
for (int i=0;i<3;i++){
cout<<s[i]<<endl;
}
freopen("club.out","w",stdout);
```
:::
## JS-S00160
:::info[[replace.cpp]**疑似仙家对话**]
```cpp
/*
Why are there still millions of mountains out of millions of mountains?
Whose light boat lost its way?
The thing I see, is a dream from start to the end.
I am very foolish that I believe it is a truth.
Let's see the people, the people that seems always happy,
Who had a true smile when they turn around?
Practise day and night, hope to get a good score,
I even dreamed to get a full mark at CSP-S!
But it's a dream, they are all dreams.
So Is the pain I am feeling now a dream?
God, please tell me it's a dream too!
After I get up, I will be a child that full of hopeness and energy again!
Please, please.
But it doesn't happen.
okay, I know that.
It is NOT A DREAM.
But I don't like it!
I have said that I will show my success to them, they laughed to me,they hated me!
But have I do anything wrong?
Why am I be hated?
Why am i be LAUGHED??
I am just, just fighting for my dream, I am just a person that hope to use my skill enstrong my motherland!
What, what had I do.
Some years ago, they called me "the man with many talents", they fighted to be closer to me.
But I am a foolish man now.
After they hurt me, at the age of eleven.
I can't do any thing.
I am a foolish man.
I even can't tell them I am not bad as they think.
But I can't get over 100 points now.
So, laughed at me!
I am so foolish.
I don't have the talent to be a OIer.
I am so foolish that spend years in OI;
I should regret.
Yes.
It's not a brave choose, but I choose it, but I am a foolish man.
It's time to get up.
*/
```
:::
## JS-S00166
:::info[[除了club.cpp]**素质在线**]
```cpp
/*
Fuck!
I have no way but to output zero...
Wasting time...
F............CCF
So, that's all.
I'm in 9th Grade now.
See you later...
LATER...
or NEVER
*/
/*
Fuck!
Good for small data, but shit-like for big data!!!
How can it be like this...(*n)VER...
*/
/*Fuck!
My logic is well, but the results are just like poos!!!
How can it be wrong......(*n)
*/
```
:::
## JS-S00171
:::info[[club.cpp]**撞大运了**]
```cpp
freopen("road.in","r",stdin);
freopen("road.out","w",stdout);
```
:::
## JS-S00203
:::info[[club.cpp]**年年考年年错**]
```cpp
// freopen("club.in","r",stdin);
// freopen("club.out","w",stdout);
```
:::
## JS-S00206
:::info[[club.cpp]**Clannad老师晚上好** ]
```cpp
//要开longlong，多测要清空
//想上电视qwq
//也许从今天后我就要告别OI了
//whk才是最终的出路
//luogu:__Clannad__
//祝伊蕾娜9天前生日快乐
```
:::
## JS-S00213
:::info[[club.cpp]**天梯大蛇**]
**建议复制至本地观赏。**
```cpp
#include<bits/stdc++.h>
using namespace std;
bool cmp(int x,int y){
return x>y;
}
int main(){
freopen("club.in","r","std.in");
freopen("club.out","w","std.out");
long long t,n,a1[10005],a2[10005],a3[10005];
cin>>t;
int cnt;
for (int i=1;i<=t;i++){
cin>>n;
int sum=0,sum1=0,sum2=0;
int cnt=0;
for (int j=1;j<=n;j++){
cin>>a1[j]>>a2[j]>>a3[j];
if (a1[j]>a2[j]&&a1[j]>a3[j]){
sum++;
cnt+=a1[j];
} if (a2[j]>a1[j]&&a2[j]>a3[j]){
sum1++;
cnt+=a2[j];
} if (a3[j]>a1[j]&&a3[j]>a2[j]){
sum2++;
cnt+=a3[j];
}
if (sum>(n/2)){
sort(a2,a2+n,cmp);
sort(a1,a1+n,cmp);
sort(a3,a3+n,cmp);
if (a2[j]>a3[j]){
sum1++;
cnt+=a2[j];
}else {
sum2++;
cnt+=a3[j];
}
sum--;
cnt-=a1[j];
}
if (sum>(n/2)){
sort(a2,a2+n);
sort(a1,a1+n);
sort(a3,a3+n);
if (a2[j]>a3[j]){
sum1++;
cnt+=a2[j];
}else {
sum2++;
cnt+=a3[j];
}
sum--;
cnt-=a1[j];
}
if (sum1>(n/2)){
sort(a2,a2+n,cmp);
sort(a1,a1+n,cmp);
sort(a3,a3+n,cmp);
if (a1[j]>a3[j]){
sum++;
cnt+=a1[j];
}else {
sum2++;
cnt+=a3[j];
}
sum1--;
cnt-=a2[j];
} if (sum1>(n/2)){
sort(a2,a2+n);
sort(a1,a1+n);
sort(a3,a3+n);
if (a1[j]>a3[j]){
sum++;
cnt+=a1[j];
}else {
sum2++;
cnt+=a3[j];
}
sum1--;
cnt-=a2[j];
}
if(sum2>(n/2)){
sort(a2,a2+n,cmp);
sort(a1,a1+n,cmp);
sort(a3,a3+n,cmp);
if (a1[j]>a2[j]){
cnt+=a1[j];
}else {
sum1++;
cnt+=a2[j];
}
sum2--;
cnt-=a3[j];
}
if(sum2>(n/2)){
sort(a2,a2+n);
sort(a1,a1+n);
sort(a3,a3+n);
if (a1[j]>a2[j]){
sum++;
cnt+=a1[j];
}else {
sum1++;
cnt+=a2[j];
}
sum2--;
cnt-=a3[j];
}
}
if(cnt==10){
cout<<"13"<<endl;
}else {
cout<<cnt<<endl;
}
}
return 0;
}
```
:::
## JS-S00227 / JS-S00233
:::info[[replace.cpp]**rp++**]
```cpp
//This question is too hard.
//I love CCF.
//Please give me some points.
//Please!!!
//rp++
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
省略inf行
```
:::
## JS-S00278
:::info[[road.cpp]**manba out**]
```cpp
/*
two years' OI equals zero
what a hard thing I can say
just two minutes left
ans a person staying in the same position
*/
```
:::
## JS-S00284
:::info[[employ.cpp]**你被骗了**]
```cpp
// f r e o p e n ( " c l u b . i n " , " r " , s t d i n ) ;
// f r e o p e n ( " c l u b . o u t " , " w " , s t d o u t ) ;
```
:::
------------
$301\sim 600$ author：[\_qwerty\_](https://www.luogu.com.cn/user/905744)
## JS-S00302
:::info[[club/road/replace/employ.cpp] **惊世智慧**]
```cpp
#define x0 ak_cspj
#define x1 ak_csps
#define y0 ak_noi
#define y1 ak_noi
```
:::
## JS-S00305
:::info[[replace.cpp] **听我说谢谢你**]
```cpp
//Thanks CCF qwq;
```
:::
## JS-S00311
:::info[[road.cpp] **匿名这一块**]
```cpp
// Name: XK
// Identity: XXXXXXKKKKKKKK-xk-XXX-KKK-XKXKXKXKXKXKXK123456789X
```
:::
:::info[[replace.cpp] **同上**]
```cpp
//XKXKXKXKXKXKXKXKKXKXKXKXKKXKX
//XKXKXKXKKXKXKXKXKKXKXKXKKXKXK
//XKXKXKXKXKXKXKKXKXKXKXKXKKXKX
```
:::
## JS-S00320
:::info[[road/replace/employ] **砖 业 片 分，三题都在骗分但是没写文件**]
```cpp
int main()
{
int n,m;
string s;
int c[1000001];
cin>>n>>m;
cin>>s;
for(int i=0;i<n;i++)
{
cin>>c[i];
}
cout<<2;
}
```
:::
## JS-S00323
:::info[[employ.cpp] **西西艾副亦有情，给我五分行不行**]
```cpp
//dear CCF,please give me 5 points
```
:::
## JS-S00324
:::info[[road/replace/employ.cpp] **和 00320 坐一桌**]
```cpp
//freopen("club.in","r",stdin);
//freopen("club.out","w",stdout);
```
:::
## JS-S00326
:::info[[employ.cpp] **rp++**]
```cpp
//
// || |||||||||| |||||||||||
// || || || ||
// || || || || || ||
// |||| || || || ||
// || ||||||||||| |||||||||| ||||||||||
// || || || ||
// || || || ||
// || ||
// || ||
// || ||
//
//project Moon Start
```
:::
## JS-S00330
:::info[[club.cpp] **这也有车迷**]
```cpp
//tefosi
```
:::
:::info[[replace.cpp] **嘟嘟嘟嘟~**]
```cpp
//dududuDu
```
:::
## JS-S00331
:::info[[club/road/replace/employ.cpp] **小剧场+1**]
```cpp
//Try to take Zhong Chenxi & Lu Guo to every contest.
//Wish Zhong&Lu forever,till the end!
//0232 is the best pair in the world!
//Little Pigeon is the most beautiful, most adorable creature all over the world!
//I love Little Pigeon!
//Little Pigeon is the best!
/*
There once was a kingdom named "Pigeoland". The king of the kingdom Chuanshang was very old but wise. He only had a beautiful daughter, whose name was
Zhong1 Guo3. The old king thought, "I need to find a man, who is kind, thoughtful and intelligent to be the new king, or my daughter will too buzy to live
a happy life." So he said to his daughter, "Oh, my dear daughter, you are old enough to travel around the world like I did in a young age. It's the time
to leave home and get more hands-on experience."
Zhong1 Guo3 was very glad to have a look at the outer part of the world, so she left the capital with a guide and three whole chests of gold coins
happily. She spent one chest of coins quickly in the first month. She decided to go home, but on the way home, the guide robbed all her money and escaped.
The princess walked home tiredly and hungrily, surprised with the attitude of her friends before, when she is still rich. Hearing her story, the old king
smiled and said, "This is the first class, people's attitude to you depends on the interest they can make from you."
The princess left again with little money at the second time. She found a boyfriend and they loved each other deeply. But one day, she found that
her boyfriend had another "only"! She was angry and went back home. "This is the second class, don't be the doll to love.", the old king said with a
cough.
The princess travelled the third time. This time she brought some money and a pair o rings. She soon found her love, who was kind, thoughtful and
clever, called Lu2 Chen2xi1. They got married, lived happily owning a farm.
But soon the bad news come. The old king had a bad ill suddenly. The princess told her husband her true name and information, and they went back
quickly. The old king laid on the bed, smiling weakly, "This is the last class, my daughter. You are a good leader now, and the class is over."
The king dead in a few weeks, and the new king Lu2 Chen2xi1 worked hard and loved his queen very much. They also had a daughter.
Years passed. The little princess growed up, and the old king and queen are both old. One day, the old queen said to the little princess, "Oh, my
dear daughter..."
*/
```
:::
## JS-S00335
:::info[[club.cpp] **邮寄+1**]
```cpp
/*
I thought T1 for 1.5h and puzzled with "n".
Beacuse if n%2==1,it might be too hard for me to come up with the right alogithm
Finally......
When I looked the content above the requires again,
I had found that was impoosible in this task......
*/
```
:::
## JS-S00338
:::info[[club.cpp] **你说的对，但是研究科学的最佳方式是（逃**]
```cpp
/*
置身天上之森
*/
```
:::
## JS-S00346
:::info[[employ.cpp] **数学大手子（初中版）**]
```cpp
/*
25（本题满分16分）.
如图（没有），在抛物线 $y_1=ax^2+bx+3$ 上有一动点 $P$。抛物线交 y 轴于 $C\text{(0,3)}$，交 x 轴与 $A,B\text{(3,0)}$。$y_2=kx+m$ 交抛物线于 $A,C$ 两点，交抛物线的对称轴于 $E$。
(1) 求 $y_1,y_2$ 的解析式。（3分）
(2) A(_,_),E(_,_)。（2分）
(3) 当 $P$ 在直线 $BC$ 上方时（不与 $B,C$ 重合），求 $\triangle PBC$ 面积最大值以及此时 $P$ 点坐标。（3分）
(4) 求出当 $\triangle ACP$ 为等腰三角形时 $P$ 的坐标。（4分）
(5) 在 $x$ 轴上是否存在一点 $Q$，使 $P,Q,A,E$ 构成的四边形是平行四边形？如果存在，直接写出 $P$ 点的坐标。（4分）
*/
```
:::
## JS-S00351
:::info[[club.cpp] **不写文件+1**]
[employ.cpp] **神秘文件+1**
```cpp
freopen("employ3.in","r",stdin);
```
:::
## JS-S00362
:::info[[employ.cpp] **自信骗分**]
```cpp
cout<<rand()%mod<<"\n";
```
:::
## JS-S00367
:::info[[road.cpp] **文件+1**]
```cpp
//freopen("road.in","r",stdin);
//freopen("road.out","w",stdout);
```
:::
## JS-S00369
:::info[[road.cpp] **made mom $\times \infty$**]
```cpp
/* for(int i=0;i<1000;i++)
{
cout<<"CCF I made you mom!!!";
}
*/
```
:::
## JS-S00374
:::info[[club.cpp] **大法师来了**]
```cpp
// let me try force(dfs)!!!
// then write ji yi hua sou suo
```
:::
## JS-S00391
:::info[[club/road/replace/employ.cpp] **逆天文件，club甚至连文件名都是错的**]
```cpp
freopen("culb.ans","w",stdout);
```
```cpp
freopen("road.ans","w",stdout);
```
:::
## JS-S00400
:::info[[replace/employ.cpp] **I don't know**]
```cpp
printf("😡👎I don't know👎😡\n");
```
:::
## JS-S00403
:::info[[road.cpp] **wo bu hui a**]
```cpp
//prim?
//wo bu hui a wwwww
//yao afo l
```
:::
## JS-S00415
:::info[[road.cpp] **美术家+1**]
```cpp
/*
~ ~ ~
| | |
| | |
___|___|___|___
/ \
\ /
\_____________/*/
```
:::
## JS-S00419
:::info[[club.cpp] **如你所愿**]
```cpp
//rp++++++++
//why t1 so difficult
//or i am too sweet
//ganjue you 1.4 le
//xiaoduiliyou nianlingbiwoxiao shilibiwoqiang deren
//woshibushiyaobeitanchudandiaoduiliele
//huashuojinnian demihuoxingweidashanghuibuhuiyouwo?
```
[replace.cpp] **许愿+1**
```cpp
//ahhhhhh
//ccfnengduogeiwoyidianfenma
```
[employ.cpp] **自信随机**
```cpp
//baolimaosifenhaitingduode
//suijishusuanfa!!
```
:::
## JS-S00429
:::info[[club.cpp] **循环展开？？？**]
```cpp
if(n==4){
int ans=0,sum=0;
sum=a[1][1]+a[2][1]+a[3][2]+a[4][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][1]+a[3][2]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][1]+a[3][3]+a[4][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][1]+a[3][3]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][1]+a[4][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][1]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][1]+a[3][3]+a[4][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][1]+a[3][3]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][1]+a[3][3]+a[4][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][1]+a[3][3]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][1]+a[4][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][1]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][2]+a[4][1];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][2]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][2]+a[4][1];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][2]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][3]+a[4][1];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][3]+a[4][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][2]+a[3][3]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][3]+a[3][1]+a[4][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][3]+a[3][1]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][3]+a[3][2]+a[4][1];
ans=max(sum,ans);
sum=a[1][1]+a[2][3]+a[3][2]+a[4][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][3]+a[3][2]+a[4][3];
ans=max(sum,ans);
sum=a[1][1]+a[2][3]+a[3][3]+a[4][1];
ans=max(sum,ans);
sum=a[1][1]+a[2][3]+a[3][3]+a[4][2];
ans=max(sum,ans);
sum=a[1][2]+a[2][1]+a[3][1]+a[4][1];
ans=max(sum,ans);
sum=a[1][2]+a[2][1]+a[3][1]+a[4][2];
ans=max(sum,ans);
sum=a[1][2]+a[2][1]+a[3][1]+a[4][3];
ans=max(sum,ans);
sum=a[1][2]+a[2][1]+a[3][2]+a[4][1];
ans=max(sum,ans);
sum=a[1][2]+a[2][1]+a[3][2]+a[4][3];
ans=max(sum,ans);
sum=a[1][2]+a[2][1]+a[3][3]+a[4][1];
ans=max(sum,ans);
sum=a[1][2]+a[2][1]+a[3][3]+a[4][2];
ans=max(sum,ans);
sum=a[1][2]+a[2][1]+a[3][3]+a[4][3];
ans=max(sum,ans);
sum=a[1][2]+a[2][2]+a[3][1]+a[4][1];
ans=max(sum,ans);
sum=a[1][2]+a[2][2]+a[3][1]+a[4][3];
ans=max(sum,ans);
sum=a[1][2]+a[2][2]+a[3][3]+a[4][1];
ans=max(sum,ans);
sum=a[1][2]+a[2][2]+a[3][3]+a[4][3];
ans=max(sum,ans);
sum=a[1][2]+a[2][3]+a[3][1]+a[4][1];
ans=max(sum,ans);
sum=a[1][2]+a[2][3]+a[3][1]+a[4][2];
ans=max(sum,ans);
sum=a[1][2]+a[2][3]+a[3][1]+a[4][3];
ans=max(sum,ans);
sum=a[1][2]+a[2][3]+a[3][2]+a[4][1];
ans=max(sum,ans);
sum=a[1][2]+a[2][3]+a[3][2]+a[4][3];
ans=max(sum,ans);
sum=a[1][2]+a[2][3]+a[3][3]+a[4][1];
ans=max(sum,ans);
sum=a[1][2]+a[2][3]+a[3][3]+a[4][2];
ans=max(sum,ans);
sum=a[1][3]+a[2][1]+a[3][1]+a[4][2];
ans=max(sum,ans);
sum=a[1][3]+a[2][1]+a[3][1]+a[4][3];
ans=max(sum,ans);
sum=a[1][3]+a[2][1]+a[3][2]+a[4][1];
ans=max(sum,ans);
sum=a[1][3]+a[2][1]+a[3][2]+a[4][2];
ans=max(sum,ans);
sum=a[1][3]+a[2][1]+a[3][2]+a[4][3];
ans=max(sum,ans);
sum=a[1][3]+a[2][1]+a[3][3]+a[4][1];
ans=max(sum,ans);
sum=a[1][3]+a[2][1]+a[3][3]+a[4][2];
ans=max(sum,ans);
sum=a[1][3]+a[2][2]+a[3][1]+a[4][1];
ans=max(sum,ans);
sum=a[1][3]+a[2][2]+a[3][1]+a[4][2];
ans=max(sum,ans);
sum=a[1][3]+a[2][2]+a[3][1]+a[4][3];
ans=max(sum,ans);
sum=a[1][3]+a[2][2]+a[3][2]+a[4][1];
ans=max(sum,ans);
sum=a[1][3]+a[2][2]+a[3][2]+a[4][3];
ans=max(sum,ans);
sum=a[1][3]+a[2][2]+a[3][3]+a[4][1];
ans=max(sum,ans);
sum=a[1][3]+a[2][2]+a[3][3]+a[4][2];
ans=max(sum,ans);
sum=a[1][3]+a[2][3]+a[3][1]+a[4][1];
ans=max(sum,ans);
sum=a[1][3]+a[2][3]+a[3][1]+a[4][2];
ans=max(sum,ans);
sum=a[1][3]+a[2][3]+a[3][2]+a[4][1];
ans=max(sum,ans);
sum=a[1][3]+a[2][3]+a[3][2]+a[4][1];
ans=max(sum,ans);
sum=a[1][3]+a[2][3]+a[3][2]+a[4][2];
ans=max(sum,ans);
cout<<ans<<"\n";
}
```
:::
## JS-S00433
:::info[[road.cpp] **road1.in**]
```cpp
freopen("road1.in","r",stdin);
```
:::
## JS-S00447
:::info[[road/replace/employ.cpp] **默哀**]
```cpp
//freopen("road.in","w",stdin);
```
:::
## JS-S00454
:::info[[replace.cpp] **默哀+1**]
```cpp
//freopen("replace.in","r",stdin);
```
:::
## JS-S00455
:::info[[club.cpp] **卡哇伊**]
```cpp
//(QWQ) (^_^) =) =( (qwq) (QAQ) ( !&@#!& )( !&)!!& ) (*_*) (*o*) (^o^) ($o$) ($_$)
```
:::
## JS-S00456
:::info[[club/road/replace/employ.cpp] 六条戒律哪够，来个 $93$ 条]
```cpp
/*
1. keep calm, one mistake can't ruin ur test, but mental breakdown can
2. read the problem carefully, at least twice
3. think calmly: think twice code once, think once code forever
4. check freopen and filename
5. array limits, corner cases(0), int/long long overflow, init if multicases
6. trust urself, u r the best version of urself, don't compare with others
that one day, when we look back, we will be amazed by how far we've comed!
*/
```
:::
## JS-S00468
:::info[[club.cpp] 密码锁这一块]
```cpp
if(n == 2)
for(int i = 1;i <= 3;i++)
for(int j = 1;j <= 3;j++){
if(i == j) continue;
ans = max(a[1][i] + a[2][j],ans);
}
else if(n == 4)
for(int i = 1;i <= 3;i++)
for(int j = 1;j <= 3;j++)
for(int k = 1;k <= 3;k++)
for(int l = 1;l <= 3;l++){
memset(x,0,sizeof x);
x[i]++,x[j]++,x[k]++,x[l]++;
if(x[1] > n / 2 || x[2] > n / 2 || x[3] > n / 2) continue;
ans = max(ans,a[1][i] + a[2][j] + a[3][k] + a[4][l]);
}
else if(n == 10)
for(int q = 1;q <= 3;q++)
for(int w = 1;w <= 3;w++)
for(int e = 1;e <= 3;e++)
for(int r = 1;r <= 3;r++)
for(int t = 1;t <= 3;t++)
for(int yy = 1;yy <= 3;yy++)
for(int u = 1;u <= 3;u++)
for(int i = 1;i <= 3;i++)
for(int o = 1;o <= 3;o++)
for(int p = 1;p <= 3;p++){
memset(x,0,sizeof x);
x[q]++,x[w]++,x[e]++,x[r]++,x[t]++,x[yy]++,x[u]++,x[i]++,x[o]++,x[p]++;
if(x[1] > n / 2 || x[2] > n / 2 || x[3] > n / 2) continue;
ans = max(ans,a[1][q] + a[2][w] + a[3][e] + a[4][r] + a[5][t] + a[6][yy] + a[7][u] + a[8][i] + a[9][o] + a[10][p]);
}
```
:::
## JS-S00469
:::info[[club/road/replace/employ.cpp] 膜拜来了]
```cpp
//mo bai xst dalao
//mo bai wyx dalao
//mo bai cyh dalao
//I AK IOI
//Ren5Jie4Di4Ling5%
```
:::
## JS-S00479
:::info[[club.cpp] ready for afo]
```cpp
//t2 zhale.
//ready for afo.
```
:::
## JS-S00493
:::info[[club.cpp] 循环展开喜加一]
```cpp
if(n==2){
for(int i=1;i<=3;i++){
cnt[i]++;
sum+=a[1][i];
for(int i2=1;i2<=3;i2++){
cnt[i2]++;
sum+=a[2][i2];
if(judge(n) && maxn<sum){
maxn=sum;
}
cnt[i2]--;
sum-=a[2][i2];
}
cnt[i]--;
sum-=a[1][i];
}
}else if(n==4){
for(int i=1;i<=3;i++){
cnt[i]++;
sum+=a[1][i];
for(int i2=1;i2<=3;i2++){
cnt[i2]++;
sum+=a[2][i2];
for(int i3=1;i3<=3;i3++){
cnt[i3]++;
sum+=a[3][i3];
for(int i4=1;i4<=3;i4++){
cnt[i4]++;
sum+=a[4][i4];
if(judge(n) && maxn<sum){
maxn=sum;
}
cnt[i4]--;
sum-=a[4][i4];
}
cnt[i3]--;
sum-=a[3][i3];
}
cnt[i2]--;
sum-=a[2][i2];
}
cnt[i]--;
sum-=a[1][i];
}
}else if(n==10){
for(int i=1;i<=3;i++){
cnt[i]++;
sum+=a[1][i];
for(int i2=1;i2<=3;i2++){
cnt[i2]++;
sum+=a[2][i2];
for(int i3=1;i3<=3;i3++){
cnt[i3]++;
sum+=a[3][i3];
for(int i4=1;i4<=3;i4++){
cnt[i4]++;
sum+=a[4][i4];
for(int i5=1;i5<=3;i++){
cnt[i5]++;
sum+=a[5][i5];
for(int i6=1;i6<=3;i6++){
cnt[i6]++;
sum+=a[6][i6];
for(int i7=1;i7<=3;i7++){
cnt[i7]++;
sum+=a[7][i7];
for(int i8=1;i8<=3;i8++){
cnt[i8]++;
sum+=a[8][i8];
for(int i9=1;i9<=3;i9++){
cnt[i9]++;
sum+=a[9][i9];
for(int ix=1;ix<=3;ix++){
cnt[ix]++;
sum+=a[10][ix];
if(judge(n) && maxn<sum){
maxn=sum;
}
cnt[ix]--;
sum-=a[10][ix];
}
cnt[i9]--;
sum-=a[9][i9];
}
cnt[i8]--;
sum-=a[8][i8];
}
cnt[i7]--;
sum-=a[7][i7];
}
cnt[i6]--;
sum-=a[6][i6];
}
cnt[i5]--;
sum-=a[5][i5];
}
cnt[i4]--;
sum-=a[4][i4];
}
cnt[i3]--;
sum-=a[3][i3];
}
cnt[i2]--;
sum-=a[2][i2];
}
cnt[i]--;
sum-=a[1][i];
}
}
:::
## JS-S00500
:::info[[club.cpp] 给初赛 $98$ pts 的卡头了]
```cpp
//luogu914813 Undercraft
//acta est fabula,plaudite
//vivid/stasis
//fu sai JS-J00492 JS-S00500
//chu sai -j 98 -s 72
//csp-s
//xi wang neng jin noip
//15:07 fa xian bu shi tan xin,zai xie fen zu bei bao
```
:::
## JS-S00503
:::info[[club.cpp] 密码锁+1]
```cpp
if(n>10){
if(cmp(n)){
sort(a+1,a+n+1,cm);
for(int i=1;i<=n/2;i++){
ans+=a[i];
}
}
else{
cout<<1876432;
}
}
else if(n==2){
for(int i=1;i<=3;i++){
for(int j=1;j<=3 && j!=i;j++){
ans=max(ans,de(i,1)+de(j,2));
}
}
}
else if(n==4){
for(int a=1;a<=3;a++){
for(int b=1;b<=3;b++){
for(int c=1;c<=3;c++){
for(int d=1;d<=3;d++){
df(a);
df(b);
df(c);
df(d);
if(k>n/2 || l>n/2 || m>n/2) continue;
ans=max(ans,de(a,1)+de(b,2)+de(c,3)+de(d,4));
}
}
}
}
}
else{
for(int a=1;a<=3;a++){
for(int b=1;b<=3;b++){
for(int c=1;c<=3;c++){
for(int d=1;d<=3;d++){
for(int e=1;e<=3;e++){
for(int f=1;f<=3;f++){
for(int g=1;g<=3;g++){
for(int h=1;h<=3;h++){
for(int i=1;i<=3;i++){
for(int j=1;j<=3;j++){
df(a);
df(b);
df(c);
df(d);
df(e);
df(f);
df(g);
df(h);
df(i);
df(j);
if(k>n/2 || l>n/2 || m>n/2) continue;
ans=max(ans,de(a,1)+de(b,2)+de(c,3)+de(d,4)+de(e,5)+de(f,6)+de(g,7)+de(h,8)+de(i,9)+de(j,10));
}
}
}
}
}
}
}
}
}
}
}
```
:::
## JS-S00504
:::info[[road.cpp] 卡常大师]
看到回复一下，好奇过没过orz
```cpp
/*
kkksc03 orz orz orz Orz Orz Orz Orz Orz Orz
999ms 998ms
*/
```
:::
## JS-S00513
:::info[[road.cpp] pdf大手子]
**部分与原题面不符的为lg关键字屏蔽，与作者无关**
```cpp
/*2025 CCF 非专业级软件能力认证
CSP-J/S 2025 第二轮认证
提高级
时间:2025 年 11 月 1 日 14:30 ∼ 18:30
题目名称 社团招新 道路修复 谐音替换 员工招聘
题目类型 传统型 传统型 传统型 传统型
目录 club road replace employ
可执行文件名 club road replace employ
输入文件名 club.in road.in replace.in employ.in
输出文件名 club.out road.out replace.out employ.out
每个测试点时限 1.0 秒 1.0 秒 1.0 秒 1.0 秒
内存限制 512 MiB 512 MiB 2048 MiB 512 MiB
测试点数目 20 25 20 25
测试点是否等分 是 是 是 是
road.cpp replace.cpp employ.cpp
提交源程序文件名
对于 C++ 语言
club.cpp
编译选项
对于 C++ 语言
‐O2 ‐std=c++14 ‐static
注
. 意
. 事
. 项(
. 请
. 仔
. 细
. 阅
. 读)
.
1. 文件名(程序名和输入输出文件名)必须使用英文小写。
2. main 函数的返回值类型必须是 int,程序正常结束时的返回值必须是 0。
3. 若无特殊说明,结果的比较方式为全文比较(过滤行末空格及文末换行)。
4. 选手提交的程序源文件大小不得超过 100 KiB。
5. 提交的程序源文件的放置位置请参考各省的具体要求。
6. 程序可使用的栈空间内存限制与题目的内存限制一致。
7. 禁止在源代码中改变编译器参数(如使用 #pragma 命令)
,禁止使用系统结构相
关指令(如内联汇编)或其他可能造成不公平的方法。
8. 因违反上述规定而出现的问题,申诉时一律不予受理。
9. 只提供 Linux 格式附加样例文件。
10. 全国统一评测时采用的机器配置为:Intel Core Ultra 9 285K CPU @ 3.70 GHz
(关闭睿频与能效核),内存 96 GB。上述时限以此配置为准。
11. 评测在当前最新公布的 NOI Linux 下进行,各语言的编译器版本以此为准。2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
提高级 社团招新(club)
社团招新(club)
【题目描述】
小 L 是学校算法协会的成员。在今年的学校社团招新中,小 L 一共招收了 n 个新
成员,其中 n 为 偶
L 希望将他们分到协会不同的部门。
. 数。现在小
.
算法协会共设有三个部门,其中第 i (1 ≤ i ≤ n) 个新成员对第 j (1 ≤ j ≤ 3) 个部
门的满意度为 a i,j 。定义一个分配方案的满意度为所有新成员对分配到的部门的满意度
之和,也就是说,若将第 i (1 ≤ i ≤ n) 个新成员分配到了第 d i ∈ {1, 2, 3} 个部门,则该
∑
分配方案的满意度为 ni=1 a i,d i 。
小 L 不希望某一个部门的新成员数量过多。具体地,他要求在分配方案中, 不
. 存
. 在
.
n
一个部门被分配 多
. 于
. 2 个新成员。你需要帮助小 L 求出,满足他要求的分配方案的满
意度的最大值。
【输入格式】
从文件 club.in 中读入数据。
本
. 题
. 包
. 含
. 多
. 组
. 测
. 试
. 数
. 据。
.
输入的第一行包含一个正整数 t,表示测试数据组数。
接下来依次输入每组测试数据,对于每组测试数据:
• 第一行包含一个正整数 n,表示新成员的数量。
• 第 i + 1 (1 ≤ i ≤ n) 行包含三个非负整数 a i,1 , a i,2 , a i,3 ,分别表示第 i 个新成员对
第 1, 2, 3 个部门的满意度。
【输出格式】
输出到文件 club.out 中。
对于每组测试数据,输出一行一个非负整数,表示满足小 L 要求的分配方案的满意
度的最大值。
【样例 1 输入】
1 3
2 4
3 4 2 1
4 3 2 4
5 5 3 4
6 3 5 1
7 4
第 2 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
8 0 1 0
9 0 1 0
10 0 2 0
11 0 2 0
12 2
13 10 9 8
14 4 0 0
提高级 社团招新(club)
【样例 1 输出】
1 18
2 4
3 13
【样例 1 解释】
该样例共包含三组测试数据。
对于第一组测试数据,可以将四个新成员分别分配到第 1, 3, 1, 2 个部门,则三个部
门的新成员数量分别为 2, 1, 1,均不超过
4
2
= 2,满意度为 4 + 4 + 5 + 5 = 18。
对于第二组测试数据,可以将四个新成员分别分配到第 1, 1, 2, 2 个部门,则三个部
门的新成员数量分别为 2, 2, 0,均不超过
4
2
= 2,满意度为 0 + 0 + 2 + 2 = 4。
对于第三组测试数据,可以将两个新成员分别分配到第 2, 1 个部门,则三个部门的
新成员数量分别为 1, 1, 0,均不超过
2
2
= 1,满意度为 9 + 4 = 13。
【样例 2】
见选手目录下的 club/club2.in 与 club/club2.ans。
该样例满足测试点 3, 4 的约束条件。
【样例 3】
见选手目录下的 club/club3.in 与 club/club3.ans。
该样例满足测试点 5 ∼ 8 的约束条件。
【样例 4】
见选手目录下的 club/club4.in 与 club/club4.ans。
该样例满足测试点 9 的约束条件。
第 3 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
提高级 社团招新(club)
【样例 5】
见选手目录下的 club/club5.in 与 club/club5.ans。
该样例满足测试点 15, 16 的约束条件。
【数据范围】
对于所有测试数据,保证:
• 1 ≤ t ≤ 5;
• 2 ≤ n ≤ 10 5 ,且 n 为偶数;
• 对于所有 1 ≤ i ≤ n,1 ≤ j ≤ 3,均有 0 ≤ a i,j ≤ 2 × 10 4 。
测试点编号 n =
1 2
2 4
3, 4 10
5 ∼ 8 30
9
10, 11
特殊性质
200
15, 16
B
无
A
12
13, 14
无
10 5
17 ∼ 20
B
C
无
特殊性质 A:对于所有 1 ≤ i ≤ n,均有 a i,2 = a i,3 = 0。
特殊性质 B:对于所有 1 ≤ i ≤ n,均有 a i,3 = 0。
特殊性质 C:对于所有 1 ≤ i ≤ n,1 ≤ j ≤ 3,a i,j 均在 [0, 2 × 10 4 ] 中 独
. 立
. 均
. 匀
. 随
. 机
.
生成。
第 4 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
提高级 道路修复(road)
道路修复(road)
【题目描述】
C 国的交通系统由 n 座城市与 m 条连接两座城市的双向道路构成,第 i (1 ≤ i ≤ m)
条道路连接城市 u i 和 v i 。 任
. 意
. 两
. 座
. 城
. 市
. 都
. 能
. 通
. 过
. 若
. 干
. 条
. 道
. 路
. 相
. 互
. 到
. 达。
.
然而,
近期由于一场大地震,
所有 m 条道路都被破坏了,
修复第 i (1 ≤ i ≤ m) 条道路
的费用为 w i 。与此同时, C 国还有 k 个准备进行城市化改造的乡镇。对于第 j (1 ≤ j ≤ k)
个乡镇, C 国对其进行城市化改造的费用为 c j 。在城市化改造完第 j (1 ≤ j ≤ k) 个乡镇
后,可以在这个乡镇与原来的 n 座城市间建造若干条道路,其中在它与第 i (1 ≤ i ≤ n)
座城市间建造一条道路的费用为 a j,i 。C 国可以在这 k 个乡镇中选择 任
. 意
. 多
. 个进行城市
.
化改造,也可以不选择任何乡镇进行城市化改造。
n 座城市两两连
为尽快恢复城市间的交通,C 国政zheng府fu希望以最低的费用将 原
. 有的
.
通,也即任意两座原有的城市都能通过若干条修复或新建造的道路相互到达。你需要帮
助他们求出,将原有的 n 座城市两两连通的最小费用。
【输入格式】
从文件 road.in 中读入数据。
输入的第一行包含三个非负整数 n, m, k,分别表示原有的城市数量、道路数量和准
备进行城市化改造的乡镇数量。
输入的第 i + 1 (1 ≤ i ≤ m) 行包含三个非负整数 u i , v i , w i ,表示第 i 条道路连接的
两座城市与修复该道路的费用。
输入的第 j + m + 1 (1 ≤ j ≤ k) 行包含 n + 1 个非负整数 c j , a j,1 , a j,2 , . . . , a j,n ,分别
表示将第 j 个乡镇进行城市化改造的费用与在该乡镇与原有的城市间建造道路的费用。
【输出格式】
输出到文件 road.out 中。
输出一行一个非负整数,表示将原有的 n 座城市两两连通的最小费用。
【样例 1 输入】
1 4 4 2
2 1 4 6
3 2 3 7
4 4 2 5
5 4 3 4
6 1 1 8 2 4
第 5 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
7
提高级 道路修复(road)
100 1 3 2 4
【样例 1 输出】
1
13
【样例 1 解释】
C 国政zheng府fu可以选择修复第 3 条和第 4 条道路,然后将第 1 个乡镇进行城市化改造,
并建造它与第 1, 3 座城市间的道路,总费用为 5 + 4 + 1 + 1 + 2 = 13。可以证明,不存
在比 13 更小的费用能使原有的 4 座城市两两连通。
【样例 2】
见选手目录下的 road/road2.in 与 road/road2.ans。
该样例满足测试点 11, 12 的约束条件。
【样例 3】
见选手目录下的 road/road3.in 与 road/road3.ans。
该样例满足测试点 13, 14 的约束条件。
【样例 4】
见选手目录下的 road/road4.in 与 road/road4.ans。
该样例满足测试点 15, 16 的约束条件。
【数据范围】
对于所有测试数据,保证:
• 1 ≤ n ≤ 10 4 ,1 ≤ m ≤ 10 6 ,0 ≤ k ≤ 10;
• 对于所有 1 ≤ i ≤ m,均有 1 ≤ u i , v i ≤ n,u i ̸ = v i 且 0 ≤ w i ≤ 10 9 ;
• 对于所有 1 ≤ j ≤ k,均有 0 ≤ c j ≤ 10 9 ;
• 对于所有 1 ≤ j ≤ k,1 ≤ i ≤ n,均有 0 ≤ a j,i ≤ 10 9 ;
• 任意两座原有的城市都能通过若干条原有的道路相互到达。
第 6 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
提高级 道路修复(road)
测试点编号 n ≤ m ≤ k ≤ 特殊性质
1 ∼ 4 10 4 10 6 0 无
5, 6
7, 8
9, 10
11, 12
5
10 3
10 6
15, 16
17, 18
10
4
21 ∼ 25
无
A
无
13, 14
19, 20
A
10 5
10
5
10
A
无
A
无
特殊性质 A:对于所有 1 ≤ j ≤ k,均有 c j = 0 且均存在 1 ≤ i ≤ n 满足 a j,i = 0。
第 7 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
提高级 谐音替换(replace)
谐音替换(replace)
【题目描述】
小 W 是一名喜欢语言学的算法竞赛选手。在语言学中,谐音替换是指将原有的字
词替换为读音相同或相近的字词。小 W 发现,谐音替换的过程可以用字符串来进行描
述。具体地,小 W 将谐音替换定义为以下字符串问题:
给定 n 个字符串二元组,第 i (1 ≤ i ≤ n) 个字符串二元组为 (s i,1 , s i,2 ),满足
|s i,1 | = |s i,2 |,其中 |s| 表示字符串 s 的长度。
对于字符串 s,定义 s 的 替
. 换如下:
.
• 对于 s 的某个子串 y,若存在 1 ≤ i ≤ n 满足 y = s i,1 ,则将 y 替换为 y ′ = s i,2 。
具体地,设 s = x + y + z,其中 x 和 z 可以为空,“+”表示字符串拼接,则 s
的替换将得到字符串 s ′ = x + y ′ + z。
t j,1 , t j,2 ,
小 W 提出了 q 个问题,第 j (1 ≤ j ≤ m) 个问题会给定两个 不
. 同的字符串
.
她想知道有多少种字符串 t j,1 的替换能够得到字符串 t j,2 。两种 s 的替换不同当且仅当
子
x, z 不同或 i 不同。你需要
. 串
. y 的
. 位
. 置
. 不
. 同
. 或
. 用
. 于
. 替
. 换
. 的
. 二
. 元
. 组
. (s i,1 , s i,2 ) 不
. 同,即
.
回答小 W 提出的所有问题。
【输入格式】
从文件 replace.in 中读入数据。
输入的第一行包含两个正整数 n, q,分别表示字符串二元组的数量和小 W 提出的
问题的数量。
输入的第 i + 1 (1 ≤ i ≤ n) 行包含两个字符串 s i,1 , s i,2 ,表示第 i 个字符串二元组。
输入的第 j + n + 1 (1 ≤ j ≤ q) 行包含两个字符串 t j,1 , t j,2 ,表示小 W 提出的第 j
个问题。
【输出格式】
输出到文件 replace.out 中。
输出 q 行,其中第 j (1 ≤ j ≤ q) 行包含一个非负整数,表示替换后得到字符串 t j,2
的字符串 t j,1 的替换的数量。
【样例 1 输入】
1 4 2
2 xabcx xadex
3 ab cd
4 bc de
第 8 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
5 aa bb
6 xabcx xadex
7 aaaa bbbb
提高级 谐音替换(replace)
【样例 1 输出】
1 2
2 0
【样例 1 解释】
对于小 W 的第一个询问,共有 2 种 t 1,1 的替换能够得到 t 1,2 :
1. 令 x, z 均为空串,y = xabcx,i = 1,则 y ′ = xadex,替换后得到 xadex;
2. 令 x = xa,y = bc,z = x,i = 3,则 y ′ = de,替换后得到 xadex。
【样例 2 输入】
1 3 4
2 a b
3 b c
4 c d
5 aa bb
6 aa b
7 a c
8 b a
【样例 2 输出】
1 0
2 0
3 0
4 0
【样例 3】
见选手目录下的 replace/replace3.in 与 replace/replace3.ans。
该样例满足测试点 11, 12 的约束条件。
第 9 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
提高级 谐音替换(replace)
【样例 4】
见选手目录下的 replace/replace4.in 与 replace/replace4.ans。
该样例满足测试点 15, 16 的约束条件。
【数据范围】
设 L 1 =
∑ n
i=1 |s i,1 | + |s i,2 |,L 2 =
∑ q
j=1 |t j,1 |
+ |t j,2 |。对于所有测试数据,保证:
• 1 ≤ n, q ≤ 2 × 10 ;
5
• 2 ≤ L 1 , L 2 ≤ 5 × 10 6 ;
• 对于所有 1 ≤ i ≤ n,s i,1 , s i,2 均仅包含小写英文字母,且 |s i,1 | = |s i,2 |;
• 对于所有 1 ≤ j ≤ q,t j,1 , t j,2 均仅包含小写英文字母,且 t j,1 ̸ = t j,2 。
测试点编号
1, 2
3 ∼ 5
6
7, 8
n, q ≤
10
2
10 3
10 4
L 1 , L 2 ≤
200
2, 000
无
AB
10 6
A
B
9, 10
2 × 10 6
11, 12
13, 14
特殊性质
2 × 10 5
A
5 × 10
15, 16
无
6
17 ∼ 20
B
无
特殊性质 A:q = 1。
特殊性质 B:定义字符串 s 为 特
s 仅包含字符 a 和 b,且
. 别
. 的,当且仅当字符串
.
字符 b 在 s 中出现 恰
1 ≤ i ≤ n,s i,1 , s i,2 均为特别的,且对于所有
. 好一次。对于所有
.
1 ≤ j ≤ q,t j,1 , t j,2 均为特别的。
第 10 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
提高级 员工招聘(employ)
员工招聘(employ)
【题目描述】
小 Z 和小 H 想要合伙开一家公司,共有 n 人前来应聘,编号为 1 ∼ n。小 Z 和小
H 希望录用至少 m 人。
小 H 是面试官,将在接下来 n 天每天面试一个人。小 Z 负责决定应聘人前来面试
的顺序。具体地,小 Z 可以选择一个 1 ∼ n 的排列 p,然后在第 i (1 ≤ i ≤ n) 天通知编
号为 p i 的人前来面试。
小 H 准备了 n 套难度不一的面试题。由于 n 个前来应聘的人水平大致相同,因此
对于同一套题,所有人的作答结果是一致的。具体地,第 i (1 ≤ i ≤ n) 天的面试题的难
度为 s i ∈ {0, 1},其中 s i = 0 表示这套题的难度较高,没有人能够做出;s i = 1 表示这
套题的难度较低,所有人均能做出。小 H 会根据面试者的作答结果决定是否录用,即如
果面试者没有做出面试题,则会拒绝,否则会录用。
然而,每个人的耐心都有一定的上限,如果在他面试之前未录用的人数过多,则他
会直接放弃参加面试。具体地,编号为 i (1 ≤ i ≤ n) 的人的耐心上限可以用非负整数 c i
描述,若在他之前已经有 不
. 少
. 于
. c i 人被拒绝或放弃参加面试,则他也将放弃参加面试。
小 Z 想知道一共有多少种面试的顺序 p 能够让他们录用至少 m 人。你需要帮助小
Z 求出,能够录用至少 m 人的排列 p 的数量。由于答案可能较大,你只需要求出答案
对 998, 244, 353 取模后的结果。
【输入格式】
从文件 employ.in 中读入数据。
输入的第一行包含两个正整数 n, m,分别表示前来应聘的人数和希望录用的人数。
输入的第二行包含一个长度为 n 的字符串 s 1 . . . s n ,表示每一天的面试题的难度。
输入的第三行包含 n 个非负整数 c 1 , c 2 , . . . , c n ,表示每个人的耐心上限。
【输出格式】
输出到文件 employ.out 中。
输出一行一个非负整数,表示能够录用至少 m 人的排列 p 的数量对 998, 244, 353
取模后的结果。
【样例 1 输入】
1 3 2
2 101
3 1 1 2
第 11 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
提高级 员工招聘(employ)
【样例 1 输出】
1
2
【样例 1 解释】
共有以下 2 种面试的顺序 p 能够让小 Z 和小 H 录用至少 2 人:
1. p = [1, 2, 3],依次录用编号为 1 的人和编号为 3 的人;
2. p = [2, 1, 3],依次录用编号为 2 的人和编号为 3 的人。
【样例 2 输入】
1 10 5
2 1101111011
3 6 0 4 2 1 2 5 4 3 3
【样例 2 输出】
1
2204128
【样例 3】
见选手目录下的 employ/employ3.in 与 employ/employ3.ans。
该样例满足测试点 6 ∼ 8 的约束条件。
【样例 4】
见选手目录下的 employ/employ4.in 与 employ/employ4.ans。
该样例满足测试点 12 ∼ 14 的约束条件。
【样例 5】
见选手目录下的 employ/employ5.in 与 employ/employ5.ans。
该样例满足测试点 18 ∼ 21 的约束条件。
第 12 页
共 13 页2025 CCF 非专业级软件能力认证 CSP-J/S 2025 第二轮认证
提高级 员工招聘(employ)
【数据范围】
对于所有测试数据,保证:
• 1 ≤ m ≤ n ≤ 500;
• 对于所有 1 ≤ i ≤ n,均有 s i ∈ {0, 1};
• 对于所有 1 ≤ i ≤ n,均有 0 ≤ c i ≤ n。
测试点编号 n ≤
1, 2 10
3 ∼ 5 18
6 ∼ 8 2
9 ∼ 11
10
m
无
≤ n
12 ∼ 14 =1
15 = n
16, 17
特殊性质
无
A
500
18 ∼ 21
A
≤ n
22 ∼ 25
B
无
特殊性质 A:对于所有 1 ≤ i ≤ n,均有 s i = 1。
特殊性质 B:在 s 1 , s 2 , . . . , s n 中最多只有 18 个取值为 1,即
第 13 页
共 13 页
∑ n
i=1
s i ≤ 18。
*/
```
:::
## JS-S00515
:::info[[club.cpp] 密码锁再加一]
```cpp
if(n==2){
for(int i=1;i<=3;i++){
for(int j=1;j<=3;j++){
if(j!=i)ans=max(ans,a[1][i]+a[2][j]);
}
}
cout<<ans<<endl;
}
else if(n==4){
for(int i=1;i<=3;i++){
for(int j=1;j<=3;j++){
for(int k=1;k<=3;k++){
for(int k1=1;k1<=3;k1++){
if((i==j&&j==k)||(i==j&&j==k1)||(i==k&&k==k1)||(j==k&&k==k1))continue;
ans=max(ans,a[1][i]+a[2][j]+a[3][k]+a[4][k1]);
}
}
}
}
cout<<ans<<endl;
}
else{
vector<int>b(n+1,0);
for(int i=1;i<=n;i++)b[i]=a[i][1];
sort(b.begin()+1,b.end(),cmp);
cout<<b[1]+b[2]<<endl;
}
```
:::
## JS-S00516
:::info[[club.cpp] 默哀]
```cpp
freopen("club2.in", "r", stdin);
```
:::
## JS-S00518
:::info[[road.cpp] saki，移动]
```cpp
int main()
{
freopen("road.in","r",stdin);
freopen("road.out","w",stdout);
cout<<10086<<endl;
return 0;
}
```
:::
## JS-S00522
:::info[[club/employ/replace.cpp] woc，铁]
```cpp
//AD ASTRA PER ASPERA
//i wanna ak
```
```cpp
/*
It's not easy so we should think it twice.
We get the different part of each pair of (S1,S2) and (T1,T2)
if a pair of (S1,S2) is the same we should ignore it
Thus, a pair of (T1,T2) can only match the pairs of (S1,S2) with the same difference of it.
We hash the difference and put pairs into buckets by their difference.
Insert the prefixes and suffixes into trie.
3h could be enough for me, so I can get 300+.
*/
```
```cpp
//What's meant by miracle, a word outside my days?
```
:::
## JS-S00593
:::info[[employ.cpp] 焗雪梨好吃吗（&&@[wmyr](luogu://user/616733) is pretty]
```cpp
//ksmksmksmksmksmksm
/*bu hui ying yu , jiu yong pin yin ba.
ke neng shi zui hou yi ci csp le,
noip 2025 rp++;
wmyr is pretty.
2025.11.01 17:30
freopen("employ1.in","r",stdin);
wei da de hyzx , chu le shi tang nan chi dao bao.
zhe li ying gai you yi ge ju xue li biao qing bao zhi lei de ^(=w=^)~ , dan shi xian ran sai chang shang mei you zhe wan yi.
*/
```
你要的，补上。
:::
--------------
$1501\sim 1915$ author：[LuoFeng_Nanami](https://www.luogu.com.cn/user/759710)
## JS-S01504
:::info[[road.cpp] **Gott ist tot!**]
```cpp
/*
* This is the most complex programme i have written,
* so god bless no WA or TLE or MLE or other errors.
*/
```
:::
## JS-S01505
:::info[[replace.cpp] **我打赌 ccf 不会查拼错的暴戾语言**]
```cpp
//songs:
//I F
// F U
// C K
// C F
//I'll AFO
//after this time
```
:::
## JS-S01534
:::info[[replace.cpp] 要 似 一 起 似]
```cpp
//freopen("replace.in","r",stdin);freopen("replace.out","w",stdout);
```
:::
## JS-S01540
:::info[[employ.cpp] **欲言又止**]
```cpp
for(int i=1;i<=n;i++){
ans*=i;
ans%=998244353;
}
printf("%lld",ans);
// printf("%d",rand()%998244353);
return 0;
```
:::
## JS-S01542
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] **Starlight Re:Volver 大蛇啊**]
```cpp
//stuck tight and hard to shake
//you've got too much sugar for my heart to take
//my caramel
//you're too sweet on me
```
:::
## JS-S01551
:::info[[road.cpp/replace.cpp/employ.cpp] **给评测姬的一封信**]
```cpp
/*
My dear PINGCEJI:
I have nothing to write, but I'd like to show off to my
classmates then they will like me.
XXX XXX JJJJJJJJJJJJJJJJJJJJ
XXX XXX JJJJJJJJJJJJJJJJJJJJ
XXX XXX JJJJ
XXX XXX JJJJ
XXX XXX JJJJ
XXXXX JJJJ
XXX JJJJ
XXXXX JJJJ
XXX XXX JJJJ JJJJ
xxx xxx JJJJ JJJJ
xxx xxx JJJJ JJJJ
xxx xxx JJJJJJJJJJJ
xxx xxx JJJJJJJJJ
*/
```
:::
## JS-S01553
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] _istil 老师下午好]
```cpp
// Vanity Overriding Wisdom.
```
我是杏酥桐老师炒粉！！！！！
是这样的，我前几天在 cf 上翻了 xst 的提交记录，发现 Jul/19/2025 22:37（UTC+8）之后的每一发都有这句话，（但是 cp editor 呢？
:::
## JS-S01556
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] **阅前须知**]
```cpp
/*
Above all,my english is not so good,so you may find it like this:something is pin1 yin1 dai4 ti4.
*/
```
:::
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] **AutumnQ 老师好鸭**]
```cpp
/*
luogu_uid=1038710 AutumnQ;
rp=inf;
Plz give me 1=,Let me get into NOIP.
*/
```
:::
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] **仙之人兮列如麻**]
```cpp
/*
STOSTOSTOSTOSTOSTO LXGOD,TheSky233,rym,czy OrzOrzOrzOrzOrzOrzOrz(AFOed)
chennie,Cubber,FlamingBlade,offoff,Sving1024,__vector__,tkhash ls bless me.
*/
```
:::
:::info[[road.cpp] **你 被 骗 了**]
```cpp
//freopen
//freopen
//freopen
//freopen
//freopen
//freopen
```
:::
:::info[[road.cpp] **沉 痛 悼 念**]
```cpp
/*
16:42 2 oiers in our kao3 chang3's computers have been dead.
*/
```
:::
## JS-S01562
:::info[[road.cpp] 你被骗了，666]
```cpp
//I Give Up
//Never Gonna Give You Up
//Never Gonna Get You Down
//So Do I
//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//666
```
:::
## JS-S01569
:::info[[employ.cpp] 小心禁三]
```cpp
//I hate CCF;
//ccf has no parents;
//F^U&C%K ChuShengPlus-Sb and Central City Floor
int main(){
freopen("employ.in","r",stdin);
freopen("employ.out","w",stdout);
while(1) cout<<"\n";
return 0;
}//Bye,my OI career...
```
:::
## JS-S01573
:::info[[employ.cpp] **舰长，这是《因你而在的迷惑行为》**]
```cpp
/*
Say my name when the tree susurrates.
Once again telling the stories lost in time.
The way it starts and the way it ends.
Never again making up stories in dismay
With several starts but just one end.
Ah,how I long to embrace.
The future breaking out of shades.
From the past,still ablaze.
Save your tears for the day so far away.
To irrigate the wildness that still sleep
In the world waiting to be lit,
To spread over the riverbeds so dry and dead.
Let ships that ran around re-launch their sails.
Ah,how I long to embrace.
The future breaking out of shades.
From the past,still ablaze.
Seeds bear new life
When flowers dare to fade.
Petals linger about
Awaiting one last dance.
Shaking off all the dust from the past.
New stories have yet to start.
*/
```
:::
## JS-S01575
:::info[[road.cpp] Liverpool will win!]
```cpp
// YNWA . Liverpool will win tonight
```
:::
## JS-S01580
重点表扬。
:::info[[club.cpp] **面对字符画编程.cpp**]
```cpp
#define ACplzzz \
return 0
int main(){
freopen("club.in","r",stdin);
freopen( "club.out",
"w",stdout); int T;
cin>>T;
while(T
--) {
int n;
cin>>n;
int a[n
+5][4];
for(int
i=1;i<=
n;i++){
cin>>a[
i][1]>>
a[i][2]
>>a[i][3] ; }int
cnt[4]={0 },c[n+1]
,f[n+1];long long tot=0;for(
int i=1;i<=n;i++){int m=max
(a[i][1], max(a[i][
2],a[i][3])); for(int
j=1;j<=
3;j++){
if(a[i]
[j]==m)
{cnt[j]
++;f[i]
=j ; }}
tot+=m;
int x[3
]={a[i]
[1],a[i
][2],a[
i][3]};
sort(x,x+3); c[i]=x
[2]-x[1];} /* for(int
i=1;i<=n;i++){cout<<f[i]<<
ppp;}cout<<endlpp>>>>>>*/for(int i=1;i<=3;i
++){if(cnt[i]>n/2){int cn[cnt[i]+1];for(int
j=1,k=1;
j<=n;j++
){if(f[j
]==i){cn
[k]=c[j]
;k++ ;}}
sort(cn+
1,cn+cnt
[i]+1);for(int j=1;j<=cnt[i]-(n/2);j++){tot
-=cn[j];}/* for(int j=1;j<=cnt[i];j++){cout
<<<<<<<<
cn[j]<<"
";}cout<
<endl;*/
}}cout<<
tot<<"\n"
;}fclose
(stdin);
fclose (
stdout);
ACplzzz;
}
```
获得了 $75$pts。
:::
:::info[[employ.cpp] **I'm so bored**]
```cpp
/*Hello CCF.
WHY is this problem so HARD???
I can't solve it.
-_-
I'm bored....
*/
/*
员工招聘(employ)
【题目描述】
```
（已省略整个题面）
:::
:::info[[employ.cpp] **无法查明成分**]
```cpp
#include <bits/stdc++.h>
using namespace std;
#define NetEase 998244353
int main(){
freopen("employ.in","r",stdin);
freopen("employ.out","w",stdout);
int miHoYo,SEGA;
cin>>miHoYo>>SEGA;
string SONY;
cin>>SONY;
int Disney[miHoYo];
for(int Pigeon_Games=0;Pigeon_Games<miHoYo-1;Pigeon_Games++){
cin>>Disney[Pigeon_Games];
}
long long KONAMI=1;
for(int MOJANG_Studio=1;MOJANG_Studio<=miHoYo;MOJANG_Studio++){
KONAMI=(KONAMI*MOJANG_Studio)%NetEase;
}
cout<<KONAMI<<endl;
fclose(stdin);
fclose(stdout);
return 0;
}
//希望能得到分。。。
```
:::
:::info[[road.cpp] **全文默写 bits/stdc++.h**]
```cpp
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2019 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
/** @file stdc++.h
* This is an implementation file for a precompiled header.
*/
// 17.4.1.2 Headers
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cuchar>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#if __cplusplus >= 201402L
#include <shared_mutex>
#endif
#if __cplusplus >= 201703L
#include <any>
#include <charconv>
// #include <execution>
#include <filesystem>
#include <optional>
#include <memory_resource>
#include <string_view>
#include <variant>
#endif
#if __cplusplus > 201703L
#include <bit>
// #include <compare>
// #include <span>
// #include <syncstream>
#include <version>
#endif
using namespace std;
int main(){
freopen("road.out","w",stdout);
cout<<13<<endl;
fclose(stdout);
return 0;
//Here is nothing more:(
}
```
:::
:::info[[road.cpp] **我再也不会笑了**]
```cpp
/*
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(:(
*/
```
:::
## JS-S01582
:::info[[replace.cpp] **收到，顶你上去**]
```cpp
/*
ten years OI dies in one time ,
if no long long see the ansestors !
wo xiang shang mi huo xing wei da shang.exe!
*/
```
:::
## JS-S01601
:::info[[road.cpp] 悲痛追悼]
```cpp
//freopen("road.in","r",stdin);
//freopen("road.out","w",stdout);
```
:::
## JS-S01606
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] 没有人比我更懂 //freopen ！]
[club.cpp]
```cpp
int main(){
// freopen("club.in","r"stdin);
// freopen("club.out","w"stdout);
cout<<"18"<<endl;
cout<<"4"<<endl;
cout<<"13"<<endl;
return 0;
}
```
[road.cpp]
```cpp
int main(){
// freopen("road.in","r"stdin);
// freopen("road.out","w"stdout);
cout<<"13"<<endl;
return 0;
}
```
[replace.cpp]
```cpp
int main(){
// freopen("replace.in","r"stdin);
// freopen("replace.out","w"stdout);
cout<<"2"<<endl;
cout<<"0"<<endl;
return 0;
}
```
[employ.cpp]
```cpp
int main(){
// freopen("employ.in","r"stdin);
// freopen("employ.out","w"stdout);
cout<<"2"<<endl;
return 0;
}
```
:::
## JS-S01634
:::info[[road.cpp] **想从 ccf 身上捞一笔？**]
```cpp
//csp kao chang yu dao zhe zhong qing kuan ccf huei chu duo shao qian
```
:::
:::info[[road.cpp] **假如评测姬是大语言模型**]
```cpp
if(d==1)cout<<"13";
else if(d==252)cout<<"505585650";
else if(d==709)cout<<"504898585";
else if(d==711)cout<<"5182974424";
else{
cout<<"I forgot code,help me!";
cout<<"how to coding zuei'ziao'ceng'ceng'shu";
}
```
:::
:::info[[road.cpp] **神秘拼读**]
```cpp
/*
ying gai shi zo chu zuei xiao sheng cheng shu de suan fa?
dan wo time dai ma wang zm xei l
kuo ho li d s neng cong 1 dao na de zuei xiao fei yong
*/
```
:::
## JS-S01637
:::info[[replace.cpp] 重排列大师]
```cpp
int main(){
freoprn("repalce.in","r",stdin);
freopen("repalce.out","w",stdout);
```
:::
## JS-S01654
:::info[[replace.cpp] 考场电脑稳定发挥]
```cpp
//中途机器断电，之后时间就不准了T^T
```
:::
## JS-S01655
:::info[[employ.cpp] 好 事 成 双]
```cpp
int main(){
freopen("employ3.in","r",stdin);
// freopen("employ.out","w",stdout);
n=read(), m=read();
```
:::
## JS-S01661
:::info[[road.cpp/replace.cpp/employ.cpp] 何意味？]
```cpp
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
//
return 0;
}
```
三道题的代码都是这个。
:::
## JS-S01671
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] jy 姐姐下午好 /se]
```cpp
// Code by Jorisy. GL & HF.
```
摸摸，联赛加油喵
:::
## JS-S01673
:::info[[road.cpp] **沉 痛 悼 念**]
```cpp
freopen("road1.in","r",stdin);
freopen("road.out","w",stdout);
```
:::
## JS-S01677
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] **CLH & ZXN 9999!**]
```cpp
/*
CLH & ZXN
CSP2025 RP++
*/
```
:::
:::info[[employ.cpp] **你 被 骗 了，但这次是明示**]
```cpp
/*
NEVER GONNA GIVE YOU UP
[2020]
[2021] CSPJ 2= .
[2023] CSPS 2= , NOIP 2= .
[2024] CSPS 1= , NOIP 3= .
[2025] GL&HF .
*/
```
:::
## JS-S01685
:::info[[club.cpp] **心 脏 骤 停**]
```cpp
//T1 yi ding yao A a
```
然后……
```cpp
int main(){
//freopen("club1.in","r",stdin);
//freopen("club1.out","w",stdout);
int t;
cin>>t;
while(t--)solve();
return 0;
}
```
:::
:::info[[road.cpp] chun de hua ke neng 48 fen dou na bu dao]
```cpp
//zui xiao sheng cheng shu,chun de hua neng na 48 fen
//mei ju shi fou cheng shi hua
```
然后……
```cpp
int main(){
//freopen("road.in","r",stdin);
//freopen("road.out","w",stdout);
```
:::
:::info[[replace.cpp] 《we are the champions》]
```cpp
/*
I've paid my dudes.
time after time.
I've done my sentences.
But committed no crime.
And bad mistakes.
I've made a few.
But I have a share of sand kicked in my face, but I come through.
And I need to go on and on and on and on.
We are the champions, my friends.
And we'll keep on fighting till the end.
We are the champions, we are the champions.
No time for losers, 'cause we are the champions,
Of the world.
*/
```
:::
## JS-S01687
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] 你要上电视]
```cpp
//by luogu uid 772909
//wo yao shang dian shi
```
[club.cpp]
```cpp
//youji
//14:22 p.m. zhen fu le jin kao chang kuai wu shi fen zhong le hai mei kai shi
//14:33 p.m. wan le di yi ti mei si lu
//16:22 p.m. xie wan le,ying gai shi dui de,duo ce mei qing kong ka le ban tian
```
[road.cpp]
```cpp
//16:44 p.m. gan jue bi T1 jian dan
//16:46 p.m. kruskal you ma le
//16:48 p.m. bu hui le,xiang cuo le
//16:50 p.m. you gan jue hen jian dan le
//18:08 p.m. gua le,si ding le
```
[replace.cpp]
```cpp
//freopen wo yao shang dian shi
```
[employ.cpp]
```cpp
//16:27 p.m. mu ce ke yi na 8 pts
//16:41 p.m. 8pts dao shou
//18:19 p.m. 12pts,zhui le,yu ji [120,212]pts,T2 xie gua le
```
:::
## JS-S01714
:::info[[employ.cpp] **反 复 提 名**]
```cpp
/*
Oh this is my first time in CSP-S
The tasks are difficult...... >__< >__< >__<
____ ____
/ \ ___ / \
| love you CCF |
\ give me some /
\ score /
\ PLS! /
\ /
\ /
\ /
\/
wo yao shang qi pa he ji!!!!!!!!!!! :(
//freopen()
//freopen()
//freopen()
//freopen()
//freopen()
CCF
CCF
CCF
CCF
CCF
114514
114514
114514
114514
114514
*/
```
:::
## JS-S01723
:::info[[club.cpp] **JS 第 1723 深情**]
```cpp
/*I love hzm 4ever*/
```
:::
## JS-S01728
:::info[[club.cpp -> employ.cpp] 我记得康德没有说过要 //freopen]
[club.cpp]
```cpp
struct Kant{//a respectable philosopher, German
int x,y,max,min,diff;
};
```
[employ.cpp]
```cpp
int main() {
//freopen("employ.in","r",stdin);
//freopen("employ.out","w",stdout);
```
:::
## JS-S01733
:::info[[club.cpp] lbmzxhb 老师好啊]
```cpp
//luogu uid: 688191
//你说的对，但是可以打中文。qwq
```
:::
:::info[[replace.cpp] 怎么有两道卡常题/tuu]
```cpp
//[18:20] 怎么有两道卡常题/tuu
```
:::
## JS-S01737
:::info[[road.cpp] **You have no egg!**]
```cpp
/*
You have no egg!
*/
```
:::
## JS-S01747
:::info[[club.cpp] 考场稳定发挥，那很好了]
```cpp
//Oh my god! I can see the problem only on 14:39!
```
:::
## JS-S01754
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] 炸似你们！！！炸似你们！！！]
```cpp
//we r all gonna die \o/
```
:::
## JS-S01759
:::info[[replace.cpp] **到 站 播 报**]
```cpp
/*
This train is bound for Pingchao, the next station is Nantongxi Railway Station.
We are now at Nantongxi Railway Station. Doors will open on the left. Please mind the steps the gain off.
*/
```
:::
## JS-S01764
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] 求你了 ccf]
```cpp
//CCF gei wo ge AC/10 fen/20 fen/dian fen ba
//wo qiu ni le CCF
```
（用 `/` 隔开的是四道题中间不同的部分。）
:::
## JS-S01772
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] 仙之人兮列如麻]
```cpp
// AC!
// chennie bless me
// Cubber bless me
// AutumeQ bless me
// DTL123 bless me
// xuanxuanni bless me
// lmn bless me
// A_foolish_guy bless me
// cmhcmh bless me
// Richard1211 bless me
// absi2011 bless me
// throw_AC bless me
// Sving1024 bless me
// Zheng_iii bless me
// tourist bless me
// jiangly bless me
```
:::
## JS-S01783
:::info[[club.cpp] **你真的知道 DDLC 的全拼是什么吗**]
```cpp
/*
Doki Doki Language Club
why it's so difficult
last year I got 130
but now I only get 65!!!!!! 2025.11.1-17:14:08
QAQ
xiang bu dao xie fa de t1
bu hui tu lun de t2
bu hui yong han shu de t3(17:48:18 I can use it)
mei you kan de t4
ccf..............................................
xin hao mu biao ming ci qu nian yi jing da dao le
ccf wo da si ni
*/
```
:::
:::info[[club.cpp] **还是月计大蛇**]
```cpp
/*
Fly broken wings
I know you're still with me
*/
```
:::
## JS-S01795
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] 所以我放弃了 stdin/stdout]
[club.cpp]
```cpp
int main(){
freopen("club.in","r");
freopen("club.out","w");
```
[road.cpp]
```cpp
int main(){
freopen("road.in","r");
freopen("road.out","w");
```
[replace.cpp]
```cpp
int main(){
freopen("replace.in","r");
freopen("replace.out","w");
```
[employ.cpp]
```cpp
int main(){
freopen("employ.in","r");
freopen("employ.out","w");
```
:::
## JS-S01801
:::info[[club.cpp/road.cpp/replace.cpp/employ.cpp] gzx 老师你好呀]
```cpp
/*
guzixi
luogu uid:1124559
JS-S01801
Suzhou High School - SIP
Zhang Xiaoli is my best teacher
Li Chang VS. Chen Ying + Meng Yinqiu + You Guangzhe + Liu Huan
CCF is the best
*/
// this is the begin of club/road/replace/employ
```
:::
## JS-S01810
:::info[[road.cpp/replace.cpp/employ.cpp] **Hello, World!**]
```cpp
/*
int main()
{
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
cout<<"Hello World!"<<endl;
for(int i=1;i<=50;i++)cout<<"2025 CSP-S RP++"<<endl;
return 0;
}
*/
```
:::
## JS-S01903
:::info[[club.cpp] 默哀一分钟]
```cpp
freopen("club3.in","r",stdin);
freopen("club.out","w",stdout);
```
:::
:::info[[road.cpp] freopen 虽迟但到]
```cpp
cout<<0<<endl;
freopen("road.in","r",stdin);
freopen("road.out","w",stdout);
```
:::