CSP2025 JS 迷惑行为大赏（上）
lklklklklkl · · 休闲·娱乐
免责声明：以下代码不代表作者本人观点。
由于本人空闲时间较少且比较碎片化，本系列将分为上、中、下三个部分。本部分包括准考证号在 JS-S00001 和 JS-S00600 的考生代码。（JS 考生实在太多了 QWQ）
示例
以下是一个代码展示格式的示例。
JS-S00000
（以上为选手的准考证号。）
[T1 T2] 你 被 骗 了
（以上表示以下代码段出现在了哪些程序中，和作者对其的评价。）
//freopen("input.txt","r",stdin);（以上表示代码片段。）
选手
JS-S00001
[T1] 比赛在凌晨结束这一块
//competition ends at 02:33[T1 T3] 激动的心
//!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!JS-S00015
[T2] 对的，然而颤抖的手
//zui xiao sheng cheng shu(此处省略一些代码)
tot+=2JS-S00020
[T3] 最没有任何意义的一集
int main()
{
;;;
}
/*
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
It's of no meaning, just to fulfill the code.
*/JS-S00021
[T1] 累 加 器
int g(int r){
r ++;
r ++;
r ++;
(此处省略另外36个 r ++;)
r ++;
r += 10;
}JS-S00039
[T1] 宇 宙 魔 方
else if(n == 4) cout << max({
a[1].x + a[2].x + a[3].y + a[4].y,
a[1].x + a[2].y + a[3].x + a[4].y,
a[1].y + a[2].x + a[3].y + a[4].x,
a[1].y + a[2].y + a[3].x + a[4].x,
a[1].x + a[2].x + a[3].z + a[4].z,
a[1].x + a[2].z + a[3].x + a[4].z,
a[1].z + a[2].x + a[3].z + a[4].x,
a[1].z + a[2].z + a[3].x + a[4].x,
a[1].z + a[2].z + a[3].y + a[4].y,
a[1].z + a[2].y + a[3].z + a[4].y,
a[1].y + a[2].z + a[3].y + a[4].z,
a[1].y + a[2].y + a[3].z + a[4].z,
a[1].x + a[2].x + a[3].y + a[4].z,
a[1].x + a[2].x + a[3].z + a[4].y,
a[1].x + a[3].x + a[2].y + a[4].z,
a[1].x + a[3].x + a[2].z + a[4].y,
a[1].x + a[4].x + a[2].y + a[3].z,
a[1].x + a[4].x + a[2].z + a[3].y,
a[2].x + a[3].x + a[1].y + a[4].z,
a[2].x + a[3].x + a[1].z + a[4].y,
a[2].x + a[4].x + a[1].y + a[3].z,
a[2].x + a[4].x + a[1].z + a[3].y,
a[3].x + a[4].x + a[1].y + a[2].z,
a[3].x + a[4].x + a[1].z + a[2].y,
a[1].y + a[2].x + a[3].y + a[4].z,
a[1].y + a[2].x + a[3].z + a[4].y,
a[1].y + a[3].x + a[2].y + a[4].z,
a[1].y + a[3].x + a[2].z + a[4].y,
a[1].y + a[4].x + a[2].y + a[3].z,
a[1].y + a[4].x + a[2].z + a[3].y,
a[2].y + a[3].x + a[1].y + a[4].z,
a[2].y + a[3].x + a[1].z + a[4].y,
a[2].y + a[4].x + a[1].y + a[3].z,
a[2].y + a[4].x + a[1].z + a[3].y,
a[3].y + a[4].x + a[1].y + a[2].z,
a[3].y + a[4].x + a[1].z + a[2].y,
a[1].x + a[2].z + a[3].y + a[4].z,
a[1].x + a[2].z + a[3].z + a[4].y,
a[1].x + a[3].z + a[2].y + a[4].z,
a[1].x + a[3].z + a[2].z + a[4].y,
a[1].x + a[4].z + a[2].y + a[3].z,
a[1].x + a[4].z + a[2].z + a[3].y,
a[2].x + a[3].z + a[1].y + a[4].z,
a[2].x + a[3].z + a[1].z + a[4].y,
a[2].x + a[4].z + a[1].y + a[3].z,
a[2].x + a[4].z + a[1].z + a[3].y,
a[3].x + a[4].z + a[1].y + a[2].z,
a[3].x + a[4].z + a[1].z + a[2].y}) << '\n';JS-S00047
[T4] 血海深仇
//shi nian qian de chou nan dao bu bao le me?（翻译：十年前的仇难道不报了么？）
JS-S00050
[T1 T2 T3 T4] 意义不明的结尾
/*z*//*i*//*n*//*g*/[T1] 游记人&表白人
/*
17:45 死了，T1 T2 T3 T4 都不会做。。。懒得打暴搜了，估计也是最后一场考试了，随便写点吧，巧了可能能得到几分。。。
感谢陪伴我度过初中快乐的三年的所有人，陪我一起学 OI 的所有同学，以及每一位帮助过我的人。
我太菜了，什么都不会，不过感谢zy最后一天的鼓励。
实在不知道该写什么了，就这样吧。
哦哦，I love you!
名字一个代码放一个字母吧，缀在最后。
*/JS-S00054
[T1 T2 T3 T4] 吟游诗人
/*
naxie yiyiguxingde guocuo haiqing yuanliang wo
miandui xiongxiande jinhou bie likai wo
*/（翻译：那些一意孤行的过错/还请原谅我/面对凶险的今后/别离开我）
JS-S00060
[T1] 报时人&密码人
// Ren5Jie4Di4Ling5%, 30th, Oct. 2025
// 14:40 passed[T2] 咋办？
// ducuotile xianzai 16:33 zaban（翻译：读错题了/现在16：33/咋办）
[T3] 求放过
// 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
[T2] 条条大路通罗马
/*
* Q: All r..ds l..d wh.r.?
* A: Rome.
*/[T2] 如果早知道考CSP-S也会被...
/*
I should have reviewed 最小生成树...
*/[T3] 细腻的心理描写
/*
* os:希望数据也能这么水
*/[T4] 重要的数字
const int IMPORTANT_NUMBER = 947, MOD = 998244353;[T4] 细致的难度划分
#define ASSERT_EXIT(condition) \
if (!(condition)) \
{ \
printf(" 难、较难、困难 \n"); \
return 0; \
}JS-S00074
[T3 T4] 不要嘲笑我www
//bie xiao wo wo shi zai bu hui le!!!（翻译：别笑我我实在不会了）
JS-S00076
[T2 T3 T4] 最辛苦的一集&你不编译的吗
cout << "辛苦了！"<< endlJS-S00090
[T1 T2 T4] 注意事项人
/*
Things to check:
1. if MOD-ed / negative MODs
2. if overflow(long long)
3. if there is Undefined Behaviour(yuejie / no return value)
4. don't use 'auto'
5. filename / FileIO
6. move the cpp to folder 'JS-S00090'
CSP-S 2025 RP++!
*/JS-S00094
[T1 T2 T3 T4] 怎么两个注意事项人连在一起啊
/*
- check int and long long
- check mod (+mod)%mod
- check the return value
- think carefully then code
- do not overkill
- be patient (i.e. constructive)
- freopen
- the memory limit and the size of arrays
- corner cases (obj <0 : max(0,x))
*/JS-S00098
[T4] 奇妙的不等式&胜利宣言
//T2 > t4JS-S00103
[T3] 游记人&祝好
/*
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-S00104
[T3 T4] 你好，世界！
#include <iostream>
using namespace std;
int main()
{
cout << "Hello world!" << endl;
return 0;
}JS-S00109
[T1] 诈骗人
// assert(freopen("club5.in","r",stdin));
// assert(freopen("club.out","w",stdout));[T2] 保佑我 QWQ
//chennie bless meJS-S00112
[T1 T2 T3 T4] 你是分割我人生的线/又将它们相连
//---------------------------------------------------------------------------------------JS-S00117
[T4] 于是我放弃了输出
for(int i=1;i<=n;i++)
cin>>c[i];
for(int i=1;i<=n;i++)
{
}JS-S00127
[T1] 你在往哪里输出
for (int i=0;i<3;i++){
cout<<s[i]<<endl;
}
freopen("club.out","w",stdout);JS-S00151
[T4] 拼 写 大 师
freopen("emplpoy.in", "r", stdin);
freopen("emplpoy.out", "w", stdout);JS-S00154
[T1] 意义不明的拼音
//zhikuai tangjiatuo-tiaocheng（翻译失败）
[T1 T2 T3 T4] 意义不明的签名
//CRH2C CRH-0507JS-S00160
[T2] 长大以后/我只能睡觉
//I cannot do anything besides sleeping.
//I spend about two hours on a foolish dfs.
//It's funny.
//By the side, about the thing.
//I can't hate anyone, it's all my mistake.
//Kill the world, ans kill me by the side.[T3] 诗人+1
/*
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-S00163
[T1 T2 T3 T4] 游记人 += 2
- 14:28
The password was down, but it's the morning's(wrong password), which means all the students can't read the problem on time...
-----Dividing Line-----
- 14:40
Finish reading.
I have totally no idea...
- 14:45
Maybe it's fan_hui_tan_xin?
Just try it, the time is rich but also rich.
(xiao_dian_jie_xi: rich -> zhen_gui/fu_zu)
- 15:02
Oh my godddddd!
The five given examples all AC!!!
Yes I know I can do it!
You're the best, just believe in your self.
Have a half of SNICKERS first(not an ad).
----- Dividing Line-----
- 18:25
Every thing is ready, gonna be end.
CSP-S 2025 JS-S00163 rp+=inf!!!!!
*//*
- 15:09
Finish reading and eating()
It's like MST problem, but with more complex choices.
(btw the volunteer in the room has got a chao_long_shan_tu_de badge(Amiya) on his shirt, surprising though.)
Well I don't know the solution in such a short time, but maybe the features can help get at least 16 points?
- 15:18
Go to see T3&T4 first, later try T2.
- 15:28
OK I'm back, I think it'll spend too much time to write bao_li on T3&T4.
- 15:40
Here's my bao_li:
Since k=10,2^k to mei_ju all the possibilities, and use Kruskal (MlogM) to get the MST.
But for every possibilities, M=m+k*n=1.1e6, O(2^k MlogM) is unacceptable, what a pity.
RP+=inf, hope the data won't be too big...
- 16:04
Oh no, data2 used 1.5s, data3/4 more longer...(70s)
at least the answer is correct.
By using Fast IO, data2 1.3s...
Was it because I use Kruskal? But I don't know how to write Prim...
Just go to T3, time might not be enough.
- 17:55
change vector into priority_queue, data2 -> 1.1s ~ 1.2s
Why so close to the TLE line?
I think I've got all the pts I can, hope everything being great.
- 18:00
100+32+15+12=157...
WAIT I think I can get more points(by T2 for sure)!!!
- 18:04
YES I'VE DONE IT!!!
Well, don't be so exciting first.
Actually it less than 24 more pts.
Let's calculate the sum:100+56+15+12=183
Well, lower than my target......
But I think I may get the 1=.
Hope for the best, prepare for the worst.
*//*
- 16:16
Starting bao_li.
Wow the memory limit is 2048Mib ???
- 16:28
Finish the bao_li.
data3/4 is too big...
Bro I thought the program was O(qn^2m) but it's O(q2^n).
- 16:34
Correction.(Restart actually)
Hopefully, after the correction it is O(qn^3) now.(but only 10pts...)
- 16:49
Now think of how feature B works.
Oh the feature B seem to be easy but I only have O(nq), which is 5 more pts.
(neng_xie_yi_dian_shi_yi_dian_le.)
It seems that I'm in deep depression.
No worries, think of you've already finish T1 and some T2, It's OK.
Oh I can't even get 5 pts...
any way, go to T4.
No, I found the mistake
- 17:17
I know that I was wrong, and I thought I've got the 5 pts.
*//*
- 17:25
Finish reading.
OMG I think I don't have enough time, I would only try to get the highest pts if I can.
- 17:34
8pts got.
- 17:37
4pts got.
- 17:40
No any ideas.
I have to look back to T2, even T4 seems to be approachable to get more pts.
*/[T4] 不可以，总司令
printf("0");//No, sir.[T1] 肺腑之言
/*
How to find me(JS-S00163):
Bilibili & Luogu: JQKLUMARKAR
I'd like to write a few words, but I don't know how to type Chinese ans due to my bad English, so maybe I'll use some 'Chinglish' words.
(If you don't make sure what I'm saying, welcome to @JQKLUMARKAR on Luogu, and I'm glad to be shown on posts like'JS mi huo xing wei da shang'.)
(This is not a English writing.XD)
The third year in S, and first year as a senior high school student, I'm feeling very anxious and having a really hard time.
My target this year is to have 1= in both CSP-S & NOIp, but I think it was difficult.
I'm not good at competitions...since I've got 3*CSP-J 2= & 2*CSP-S 2=
And it's likely to be my last year in OI, which may could be called as 'AFO'.
I'll never forget the best time with OI, and the classmates with me.
It's 14:25 and it's time to start.
I'll also write the you_ji under each problem's code.
Even forgot to introduce myself...
Maybe I'll complete it if time is enough.JS-S00166
[T1 T2 T4] 暴戾语言这一块(代码经过处理)
/*F**k!
My logic is well, but the results are just like poos!!!
How can it be wrong......(*n)
*//*
F**k!
Good for small data, but s**t-like for big data!!!
How can it be like this...(*n)
*//*
F**k!
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...
*/[T3] 这只是个玩笑
/*
I'm just joking......
*/JS-S00170
[T2] 欲言又止
long long n,m,k;
for(int a=)JS-S00173
[T1] sto 物竞佬 orz & 祝好
//away from oi eventually, hoping for CPhO Au
//by kenery(lhp) from jyzx in JS ,2025/11/01 18:35JS-S00175
[T1 T2 T3 T4] 您在向哪里输出？
freopen("club.in","r",stdin);
freopen("club.ans","w",stdout);JS-S00176
[T1 T3] 求求了，给点分数吧
//40ptsPlease!!//4ptsPlease!!JS-S00180
[T1 T2 T3 T4] OI，我错了
//To OI:I'm sorry, don't leave me.JS-S00190
[T1] 为何生活总是这样&祝好
/*
Maybe life is just like this
Nothing to surprise about and nothing to relax
But keep going
Though I may not get 1= in CSP-S
But life needs to be continued
AFO if I did not get 1=
However, the most important thing is
Just enjoy life and just keep stepping towards a better world built up by effort
*/JS-S00191
[T1] 掷！地！有！声！
// 多！测！要！清！空！
// 记！得！初！始！化！
// std::array 不会全赋 0.[T2] 不会卡我吧，不会吧
// bu hui ka wo bing cha ji de log ba.（翻译：不会卡我并查集的 log 吧）
[T1 T2 T3 T4] 解题笔记这一块(由于过长，仅粘贴 T1 结尾的)
/**
* 就是你要最大化，保证没有一个社团人数大于一半。
* 而且是严格大于。
*
* 首先你不能直接记录三个社团的最大值。显然状态数就爆炸了。
*
* 考虑钦定最大值。对于每个社团，钦定最其为最大值。
*
* 跑一个 dp？
*
* 呃呃。先看看 t2。
*
* 保持冷静。很神秘感觉。
*
* 首先没有 n / 2 是显然的。就是直接取 max 即可。
* 考虑加上了这个限制有什么性质。
*
* （emiya 家今天的饭里面是不是有这个限制来着。
* （但是那时计数题。可以容斥。
*
* 最大值怎么办。就是，如果不存在大于一半的，那么显然就直接输出这个答案即可。
*
* 否则要调剂。
*
* 对于每个在最大组的人，记录调剂到另外两个组的最小代价。然后排序调剂最小的几个。
*
* 这个是最优的感觉。一方面调剂之后最大组人数是 n / 2。所以是满足题目要求的。
*
* 哎哎下次不能 dp 起手了。
*
* cur time: start + 75min
*
* 我是不是应该在开 c 之前先写个对拍。
*
* note:
* - 头文件
* - 文件输入输出
* - 局部变量的初始化
* - 多测清空
* - 隐式转化(ull to ll etc.)
* - etc
*
* 保持冷静。不要死于迭代加深深度过小。
*
* 别放弃呀。
*/JS-S00199
[T2] 五年啊五年
//five years, finally.JS-S00201
[T1 T2 T3 T4] 时间换算
//now:22:26->real:14:25[T1] 大样例这一块
3
4
4 2 1
3 2 4
5 3 4
3 5 1
4
0 1 0
0 1 0
0 2 0
0 2 0
2
10 9 8
4 0 0
(省略 215 行大样例)JS-S00203
[T1] 默哀
// freopen("club.in","r",stdin);
// freopen("club.out","w",stdout);JS-S00204
[T3] 继续默哀
//freopen("replace.in","r",stdin);
//freopen("replace.out","w",stdout);JS-S00206
[T1] 如你所愿
//freopen("replace.in","r",stdin);
//freopen("replace.out","w",stdout);JS-S00208
[T2] 疑似有点太城市化了
//urbanlizationJS-S00213
[T1] 优美的代码
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;
}[T1 T2 T3 T4] 你这freopen保熟吗
freopen("club.in","r","std.in");
freopen("club.out","w","std.out");JS-S00215
[T4] 珂学家
//Chtholly_NotaJS-S00216
[T1] 行为艺术这一块
if(n == 30){
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 ++){
for(int k = 1;k <= 3;k ++){
for(int l = 1;l <= 3;l ++){
for(int m = 1;m <= 3;m ++){
for(int n = 1;n <= 3;n ++){
for(int o = 1;o <= 3;o ++){
for(int p = 1;p <= 3;p ++){
for(int q = 1;q <= 3;q ++){
for(int r = 1;r <= 3;r ++){
for(int s = 1;s <= 3;s ++){
for(int t = 1;t <= 3;t ++){
for(int u = 1;u <= 3;u ++){
for(int v = 1;v <= 3;v ++){
for(int w = 1;w <= 3;w ++){
for(int x = 1;x <= 3;x ++){
for(int y = 1;y <= 3;y ++){
for(int z = 1;z <= 3;z ++){
for(int aa = 1;aa <= 3;aa ++){
for(int bb = 1;bb <= 3;bb ++){
for(int cc = 1;cc <= 3;cc ++){
for(int dd = 1;dd <= 3;dd ++){
tong[a] ++;
tong[b] ++;
tong[c] ++;
tong[d] ++;
tong[e] ++;
tong[f] ++;
tong[g] ++;
tong[h] ++;
tong[i] ++;
tong[j] ++;
tong[k] ++;
tong[l] ++;
tong[m] ++;
tong[n] ++;
tong[o] ++;
tong[p] ++;
tong[q] ++;
tong[r] ++;
tong[s] ++;
tong[t] ++;
tong[u] ++;
tong[v] ++;
tong[w] ++;
tong[x] ++;
tong[y] ++;
tong[z] ++;
tong[aa] ++;
tong[bb] ++;
tong[cc] ++;
tong[dd] ++;
if(max(tong[1], max(tong[2], tong[3])) <= 15){
ans = max(ans, cnt[1][a] + cnt[2][b] + cnt[3][c] + cnt[4][d] + cnt[5][e] + cnt[6][f] + cnt[7][g] + cnt[8][h] + cnt[9][i] + cnt[10][j] + cnt[11][k] + cnt[12][l] + cnt[13][m] + cnt[14][n] + cnt[15][o] + cnt[16][p] + cnt[17][q] + cnt[18][r] + cnt[19][s] + cnt[20][t] + cnt[21][u] + cnt[22][v] + cnt[23][w] + cnt[24][x] + cnt[25][y] + cnt[26][z] + cnt[27][aa] + cnt[28][bb] + cnt[29][cc] + cnt[30][dd]);
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}JS-S00223
[T2] 意义不明的文字
//xutailingzhileidi
//xutailingzhileidi
//xutailingzhileidi
(省略 56 行相同内容)（翻译失败）
JS-S00226
[T1 T2 T3 T4] 最后一吻&扩列
//my last kiss for OI | 551870JS-S00227
[T3] 目的明确
//This question is too hard.
//I love CCF.
//Please give me some points.
//Please!!!
//rp++[T4] 我不明白
//I can't understand this question.JS-S00233
[T3] 我不管我只要rp
cout<<"rp++"<<endl; cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
cout<<"rp++"<<endl;
(省略将近 20 个相似代码块)JS-S00237
[T1] 丑陋的代码
//an ugly code[T2] 另一个丑陋的代码
//another ugly code[QAQ][T2] 意义不明的数组长度
int f[11];
int ff[11];
int fff[11];
int fa[11234];
struct roads{
int fromu,tov,costw,realcost;
int iscoun;
}r[1100456];[T4] sto 数竞佬 orz
#define CMO 998244353[T4] 真是失败
//failedJS-S00247
[T1] 你在从哪里读入
freopen("club.out","r",stdin);JS-S00254
[T1 T2 T3 T4] 似曾相识的一幕
freopen("club.in","r","std.in");
freopen("club.out","w","std.out");JS-S00264
[T1 T2 T3 T4] 思路人
//other club isn't full ,not to care where they go
//15:02 ac T1//pay attention to long long
//w can reach 1e9
//may be we can kuskal first and try to ease the cost
//mlogm + kn^2 is to large and hard to acheive
//choose some towns and kuskal 2^k*(kn+m)log 45pts?
//if we try to ease the cost,then most edges are useless
// 2^k*kn log(kn)
// that's it ,we can have a try
//15:36
//it passed all examples
//but I didn't know if it is truly right
//and if it will take much time
//it seems that the road04 takes it 2s or more//it seems to be hash
//it's hard to find exactly a part
//find that t1 and t2 must have a long pre and nxt
//unused
//why can't I write Chinese!
//I still have 3h to deal with it
//last year I spent the whole hours on T2
//but this year's problems seems to be easier (what if I get 0 pts on T2 ?
// (can I get 1= with 200pts ? seems impossible
//must O n or nlog
//binary search + hash?
//T3 is usually a ds
//hash on segment tree?
//it can't be ACAM or SA ,too difficulty for S-T3
//to much memory for a problem
//turn to T4 on 15:51
//after baoliT4,turn back on 16:22
//there's a great number of '0' in the ans
//i have a good idea
//17:43 dbg over
//luan gao guo yang li da fa
//qi wang shi jian fu za du O(sumlen) zen me map you ge log
//mei you te pan s1=s2 de qing kuang
//shang mian de ke yi ACAM dan shi wo lan de xie
//ji zhi de sui ji yu bao li//17:51 finished T3,come to T4 again
//30 minute to get 400pts(doge)
//score:208~308JS-S00278
[T2] 一场空&祝好
/*
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
[T2 T4] 宽 体 代 码
// # i n c l u d e < b i t s / s t d c + + . h >
// u s i n g n a m e s p a c e s t d ;
// p r i o r i t y _ q u e u e < i n t > p ;
// i n t m a i n ( )
// {
// i o s : : s y n c _ w i t h _ s t d i o ( 0 ) ;
// c i n . t i e ( 0 ) ; c o u t . t i e ( 0 ) ;
// 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 ) ;
// i n t n , m , k ;
// c i n > > n > > m > > k ;
// f o r ( i n t i = 1 ; i < = m ; i + + )
// {
// c i n > > a [ i ] ;
// }
// }
//JS-S00293
[T1] 暴力出奇迹
//真cs的题
//暴力出奇迹!!!(这位考生写下了 696 行长的代码并在洛谷评测中取得了 0 分的好成绩)
JS-S00296
[T1] 中 二 少 年
//two to two to two two 1:58-2:00[doge][T2] 牢大这一块
//MAN!What Can I Say?MANBA OUT!JS-S00299
[T1] 这是在干什么
//////////////////////////////////////////////////////////////////////////////JS-S00305
[T3] 拜谢 bx
//Thanks CCF qwq;JS-S00306
[T1] 拜托了给我一个好的结局吧
//Hope to have a good ending.
//Please.JS-S00311
[T2] 自我介绍这一块
// Name: XK
// Identity: XXXXXXKKKKKKKK-xk-XXX-KKK-XKXKXKXKXKXKXK123456789X[T3] 狂野的签名
//XKXKXKXKXKXKXKXKKXKXKXKXKKXKX
//XKXKXKXKKXKXKXKXKKXKXKXKKXKXK
//XKXKXKXKXKXKXKKXKXKXKXKXKKXKXJS-S00313
[T2] 特殊性质A
//special quality AJS-S00319
[T1] 分割线+1
//-----------------------------------------------JS-S00323
[T2] 斜杠青年
/////////////////[T3] 亲爱的 CCF
//dear CCF,please give me 5 pointsJS-S00324
[T1] 这是什么头文件
#include cstdio[T2 T3 T4] 你在写些什么啊
//#include cstdio
#include <bits/stdc++.h>
using namespace std;
int main(){
//freopen("club.in","r",stdin);
//freopen("club.out","w",stdout);
int m,n,k;
cin>>m>>n>>k;
cin>>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
cout<<13;
return 0;
}//#include cstdio
#include <bits/stdc++.h>
using namespace std;
int main(){
//freopen("club.in","r",stdin);
//freopen("club.out","w",stdout);
int m,n;
string a=xabcx;
string b=xadex;
string c=ab;
string d=cd;
string e=bc;
string f=de;
string g=aa;
string h=bb;
string i=aaaa;
string l=bbbb;
cin>>a>>" ">>b>>/n>>c>>" ">>d>>/n>>e>>" ">>f>>/n>>g>>" " >>h>>/n>>a>>" ">>b>>/n>>i>>" "<<l;
cout<<"2"<<endl<<"0";
return 0;
}
```cpp
//#include cstdio
#include <bits/stdc++.h>
using namespace std;
int a[100];
int main(){
//freopen("club.in","r",stdin);
//freopen("club.out","w",stdout);
int m,n;
cin>>m>>n;
string s.length()=n;
cin>>s;JS-S00326
[T1] 神秘中文注释
struct Node
{
int val;//zhi
int num;//man yi du pai ming 1 shi di yi 0 shi di er -1 shi di san
}a[MAXN][3];（翻译：值；满意度排行/1是第一/0是第二/-1是第三） [T1] 默哀
//freopen("club.in","r",stdin);
//freopen("club.out","w",stdout);[T2] 于是我放弃了读入
for(int j = 1;j <= n;j++)
{
cin >> a[i][j]
}[T4] RP++
//
// || |||||||||| |||||||||||
// || || || ||
// || || || || || ||
// |||| || || || ||
// || ||||||||||| |||||||||| ||||||||||
// || || || ||
// || || || ||
// || ||
// || ||
// || ||
//
//project Moon StartJS-S00330
[T1 T2 T3 T4] 意义不明的结尾
//tefosi//jpqIlu//dududuDu//sacT4JS-S00331
[T1 T2 T3 T4] 优美的童话故事
//Try to take Zhong1 Chen2xi1 & Lu2 Guo3 to every contest.
//Wish Zhong1&Lu2 forever,till the end!
//Zhong1&Lu2 99.
//0232 is the best pair in the world!
//Little Pigeon is so beautiful, thanks to Little Pigeon.
//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
[T1 T2 T4] 斜杠青年+1
/////////////////////////////////////////1111111[T1] 不读题这一块
/*/
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
[T1] 还有珂学家
/*
置身天上之森
*/JS-S00340
[T4] 你是 0 还是 1
//0 hard 1 easyJS-S00346
[T4] 二次函数大题(选手使用了 MD，所以我没有用代码的形式粘贴)
/
25（本题满分16分）.
如图（没有），在抛物线
JS-S00351
[T4] 你在从哪里读入
freopen("employ3.in","r",stdin);JS-S00356
[T1] 应该不是诈骗吧
//freopen("club2.in", "r", stdin);JS-S00360
[T2] 怎么突然出错了
freopen("road.out", "out", stdout);JS-S00367
[T2] 默哀
//freopen("road.in","r",stdin);
//freopen("road.out","w",stdout);JS-S00369
[T2] 女娲造人 (我也不知道怎么打码)
/* for(int i=0;i<1000;i++)
{
cout<<"CCF I made you mom!!!";
}
(省略约 10000 个相同代码块)JS-S00374
[T1] 真的是记搜吗
// let me try force(dfs)!!!
// then write ji yi hua sou suoJS-S00378
[T1 T2 T3 T4] 记得文件 long long（意义不明）
//memory file long longJS-S00380
[T1 T2 T3 T4] 空气质量真热啊
// The air-condition is so hot!（猜你想看：air conditioner）
JS-S00389
[T1 T2 T3 T4] 自我介绍 + 注意事项人
// xiaruize
...
/*
Things you should definitely check:
1. file operation
2. memory limit
3. debugging lines
*/JS-S00391
[T1] 拼写大师 + 你在往哪里输出
freopen("club.in","r",stdin);
freopen("culb.ans","w",stdout);JS-S00396
[T1] 我知道，所以呢
//JS-S00396JS-S00400
[T3 T4] 我不到啊
for(int i=1;i<=117;i++){
printf("😡👎I don't know👎😡\n");
}JS-S00403
[T2] 我不会啊
//prim?
//wo bu hui a wwwww
//yao afo lJS-S00408
[T2] 拼写大师 & homo 特有的 32 甚至 24 分
kruskra(); //32 - 24 pts[T4] 没分
//0ptsJS-S00415
[T2] 烧香拜佛
/*
~ ~ ~
| | |
| | |
___|___|___|___
/ \
\ /
\_____________/*/
JS-S00417
[T2] 诈骗的怎么这么多啊
// freopen("road3.in","r",stdin);
freopen("road.in","r",stdin);
freopen("road.out","w",stdout);JS-S00419
[T1 T2 T3 T4] 细致的心理描写 & 会的会的
//rp++++++++
//why t1 so difficult
//or i am too sweet
//ganjue you 1.4 le
//xiaoduiliyou nianlingbiwoxiao shilibiwoqiang deren
//woshibushiyaobeitanchudandiaoduiliele
//huashuojinnian demihuoxingweidashanghuibuhuiyouwo?（翻译：校队里有年龄比我小实力比我强的人/我是不是要被弹出单调队列了/话说今年的迷惑行为大赏会不会有我）
//rp++;//ahhhhhh
//ccfnengduogeiwoyidianfenma（翻译：CCF 能不能给我一点分啊）
//baolimaosifenhaitingduode
//suijishusuanfa!!（翻译：暴力貌似分还挺多的/随机数算法！）
JS-S00425
[T2] 卧龙凤雏这一块
kruscal();JS-S00429
[T1 T2] 优美的特判
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";
}if(n==2){
int ans=0,sum=0;
sum=a[1][1]+a[2][1];
ans=max(sum,ans);
sum=a[1][1]+a[2][2];
ans=max(sum,ans);
sum=a[1][1]+a[2][3];
ans=max(sum,ans);
sum=a[1][2]+a[2][1];
ans=max(sum,ans);
sum=a[1][2]+a[2][2];
ans=max(sum,ans);
sum=a[1][2]+a[2][3];
ans=max(sum,ans);
sum=a[1][3]+a[2][1];
ans=max(sum,ans);
sum=a[1][3]+a[2][2];
ans=max(sum,ans);
sum=a[1][3]+a[2][3];
ans=max(sum,ans);
cout<<ans;
return 0;
}JS-S00444
[T3] 这是什么语言
q2qq（以上为代码全文）
JS-S00447
[T4] 默哀
//freopen("employ.in","r",stdin);
//freopen("employ.out","w",stdout);[T3] 有什么用吗
#include <bits/stdc++.h>
using namespace std;
int main(){
int a;
cin>>a;
cout<<2<<"\n"<<0;
}
JS-S00449
[T1] 暴力白写了
#include<bits/stdc++.h>
using namespace std;
int t,n,a[114514],maxx=INT_MIN;
void dfs(int i)
{
if(i==n+1)
{
for(int j=1;j<=n;j++)
{
cout<<a[j]<<" ";
}
cout<<endl;
return;
}
for(int j=1;j<=n;j++)
{
a[i]=j;
dfs(i+1);
}
}
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin>>n;
dfs(1);
return 0;
}JS-S00452
[T3] *暴语言**
//f**k c*f（未经过打码处理）
JS-S00454
[T3] 默哀
//freopen("replace.in","r",stdin);
//freopen("replace.out","w",stdout);JS-S00455
[T1] 神秘表情人
//(QWQ) (^_^) =) =( (qwq) (QAQ) ( !&@#!& )( !&)!!& ) (*_*) (*o*) (^o^) ($o$) ($_$)JS-S00456
[T1 T2 T3 T4] 注意事项人 + 回望过去
/*
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-S00463
[T2] 黑衣
freopen("road.in","r",stdin);
//freopen("road.out","w",stdout);JS-S00467
[T1] 哭哭
// 15pts cryJS-S00469
[T1 T2 T3 T4] 膜拜 + 自信 + 密码
//mo bai xst dalao
//mo bai wyx dalao
//mo bai cyh dalao
//I AK IOI
//Ren5Jie4Di4Ling5%JS-S00471
[T1 T2 T3 T4] 师出同门
//file memory long longJS-S00479
[T1] T2 炸了关我 T1 什么事
//t2 zhale.
//ready for afo.JS-S00492
[T3] 飞流直下三千尺
int n,m,a[]={44,0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1,
4,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1,
1,
0,
1,
0,
0,
2,
0,
0,
1,
0,
0,
0,（这个数组大约有1000行那么长）
JS-S00493
[T1] 楼梯 +1
}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-S00494
[T4] 输出样例，但是默哀
// freopen("employ.in","r",stdin);
// freopen("employ.out","w",stdout);JS-S00498
[T3] 暗藏玄机
// #include <functional>I
// #include <cstring>the
// #include <iostream>two
// #include <algorithm>horses
// #include <cstdio>in
// #include <vector>the
// #include <random>supermarket
// #include <queue>and
// #include <unordered_map>cpp
// #include <cstdio>codeforcesJS-S00500
[T1 T2 T3 T4] 回望历史 展望将来
//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(T1)
//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(T2 ~ T4)
JS-S00503
[T1] 怎么这么多楼梯啊
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
[T1 T2] 你膜对人了吗
// rto kkksc03 orz/*
kkksc03 orz orz orz Orz Orz Orz Orz Orz Orz
999ms 998ms
*/JS-S00513
[T2] PDF 人
/*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（省略整个 PDF）
JS-S00522
[T1 T2 T3 T4] 奇迹再现
//AD ASTRA PER ASPERA
//i wanna ak
...
//What's meant by miracle, a word outside my days?[T2] 奇怪的语言
//zvzdoy po imeni solntse......[T3] 思路 + 字节数
/*
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+.
*/
//5k byte/fn[T4] 我要去厕所！
//i want 332
//oh no
//i have only 320
//please let me go to WCJS-S00528
[T1 T2 T3 T4] 报时人 & 99
//14:33 begin
//14:42 finished//T2 is easier than T1.
//14:44 begin
//15:01 finished//15:17 begin
//it's too hard.
//17:25 maybe get 70 pts.//17:27 begin
//Devil_donna plz give me power to fight against evil Chi-Chi-Fan Chi-Shu_Pian contest.
//yzy&myh 99 hzc&gjh 99 wjh&bubble fish 99 gtl&??? 99
//A: people that not come equals to ???.
//s[i]==0 equals to force a[i]=0.
//wo zhi neng yong yuan du zhe dui baiJS-S00532
[T1 T2 T3 T4] 不会溢出吗
//RP+=INFJS-S00546
[T2 T4] 不用默哀了，反正也没有输出
//freopen("employ.in","r",stdin);
//freopen("employ.out","w",stdout);JS-S00552
[T2 T4] 第几个斜杠青年了
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////JS-S00556
[T1] 末日五问
// long? file? memory? time?
// Problem 1: Multiple case->clear!JS-S00560
[T1] 懒得手造数据了
// All big testcases are randomly gen'd, no 'over half' situation will exist
// I don't want to make testcases myself lol[T2] 梅开二度
// Big testcase may be too weak, passed 1e9 smh[T3] 这大样例怎么回事啊
// no big testcase for O(nq)
// probably choked 70pts bruh[T1 T2 T3 T4] 我看不懂但大为震撼
/*
000000000 000000000 000000000 0 *
0 0 0 0 0 0 *
0 0 0 0 0 0 *
0 0 0 0 0 0 *
000000000 000000000 0 0 0 *
0 0 0 0 0 *
0 0 0 0 0 *
0 0 0 0 0 *
000000000 000000000 000000000 0 *
*
*****************************************************************************************************
*
* 0 000000000 000000000 000000000
* 0 0 0 0 0
* 0 0 0 0 0
* 0 0 0 0 0
* 0 0 0 000000000 000000000
* 0 0 0 0 0 0
* 0 0 0 0 0 0
* 0 0 0 0 0 0
* 0 000000000 000000000 000000000
1,267,650,600,228,229,401,496,703,205,376
S
JJJ I SS ZZ;;;xIJJJ T I
L ZZJS ILJ ...S TZZ;xxIOOJ ZZ TTTSSI
L...ZZSSOO ILJJJZZ.OO TTSSx.IOOL JZZOOSSLI
LL.IIIISOO ILL ZZOO TSS...ILLL JJJOOLLLI
Do NOT put this into compilation stuff.
Screw anyone who does that.
For those willing to ban me for swearing, 'screw' IS considered family-friendly.
*/JS-S00566
[T1] 理直气壮
//wo zhen bu hui!!! zhi neng yong bao mei le...（翻译：我真不会！只能用暴力了...）
[T2 T4] 召唤神明
srand(time(0));//xing yun zhi shen juan gu wo baJS-S00571
[T3 T4] 特判不是这么用的啊
cin>>"4 2
xabcx xadex
ab cd
bc de
aa bb
xabcx xadex "
cout<<"2
0" cin>>"3 2
101
1 1 2";
cout<<"2";JS-S00574
[T1 T2 T3 T4] 声名远扬的 CCF 少爷机
//running time limit 1e9JS-S00575
[T3] 祝好
/*
60 + 48 = 108
hai mei qu nian gao
gan jue yao AFO le
t2 xie le yi ge xiao shi de jia zuo fa
zhen fu le
t3 lain bao li dou bu hui da
ben lai yi wei zhe ci neng 1= de
*/（翻译：还没去年高/感觉要 AFO 了/t2 写了一个小时的假做法/真服了/t3 连暴力都不会打/本还以为这次能 1= 的）
[T4] 书读百遍 & 怎么又是你
for (int i = 1; i <= 114514; i++) {
cout << "CSP-S AK me again\n";
}//CSP-S2024 JS-S00574 is meJS-S00579
[T2] 机智过人
//T1 xiang le 3h,zui hou hai shi da le bao li,ji zhi ru wo（翻译：T1 想了 3h，最后还是打了暴力，机智如我） [T3] 算是暴戾语言吗
//I hate CCF!!![T4] 求 rp
//hou mian 3 ti quan da sui ji han shu,qiu rp++（翻译：后面 3 题全打随机函数，求 rp++）
JS-S00592
[T4] 默哀
//freopen("employ.in","r",stdin);
//freopen("employ.out","w",stdout);JS-S00593
[T4] 拼音大师 + 诈骗
//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.
*/（翻译：不会英语，就用拼音吧。可能是最后一次csp了，noip 2025 rp++；wmyr很漂亮。2025.11.01 17:30 伟大的 hyzx，除了食堂难吃到爆。这里应该有一个jixueli（翻译失败）表情包之类的，但是显然赛场上没有这玩意）
JS-S00595
[T4] 又是牢大
/*
see you again
*/