MatrixGroup
2024-11-05 16:28:24
选手代码下载
免责声明：以下代码不代表作者本人观点。
以下是一个代码展示格式的示例。
（以上为选手的准考证号。）
[arena.cpp/color.cpp] 你 被 骗 了
（以上表示以下代码段出现在了哪些程序中，和作者对其的评价。）
//freopen("input.txt","r",stdin);（以上表示代码片段。）
选手按照准考证号顺序排序。
[arena.cpp/color.cpp/detect.cpp/duel.cpp] 【数据删除】
【此段代码应该代码作者要求删除。】[detect.cpp] 小说默写
/*
<Dragohearted> I have the same name novel in my luogu home page
Lost but marching on, like we've always know the trail
Searching for out ending to the fairy tale
Sometimes even shooting stars
Find wishes but miss their marks
But when the night gets too dark
And the road homeseems too far
We'll see the sun come up again
We'll climb higher than we been
We got a fire that burns within
We are the dragonhearted
We are the dragonhearted
Courage to stop a cannon ball
Together we stand 30 feets tall
We got a fire that burns within
We are the dragonhearted
Fearless we soar, speeding arrows regorshet
Break free, our hearts burn brighter than yesterday
And through the battles we wage
When our shields fall away
The armor cracks and breaks
If ever our torch is fade
We'll see the sun come up again
We'll climb higher than we been
We got a fire that burns within
We are the dragonhearted
We are the dragonhearted
Courage to stop a cannon ball
Together we stand 30 feets tall
We got a fire that burns within
We are the dragonhearted
Standing tall, forever united
We are the dragonhearted
We are the dragonhearted
Oh
We are the dragonhearted
We are the dragonhearted
*/[color.cpp] 另一个默写
/*
<Fated>
We broke the ocean right in half, just to be here
Did you even know, when you looked away
Too scared to leave we can't turn back
Will you let us
Survive
Where are we now
Where are we now
Where are we now
Did we follow a fading light
Where are we now
Will you guide us through the night
Where are we now
We've journeyed
By land and sea
By land and sea
Where are we now
It's not a dream
There's strength that flows between us can't you see
We're fated
We're fated
Not lost
We're fated
We went from lost to feeling found all around us
Our fates intertwind, have pave the way
No longer broken on the ground
We can stand tall
Survive
Where are we now
Where are we now
Where are we now
Did we follow a fading light
Where are we now
Will you guide us through the night
Where are we now
We've journeyed
By land and sea
By land and sea
Where are we now
It's not a dream
There's love that flows between us can't you see
We're fated
We've made it
Never lost
We're fated
*/[arena.cpp] 你在 freopen 什么？
#include<bits/stdc++.h>
using namespace std;
int main(){
//priority_queue(int,vector<int>,greater<int>)q;
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
//freopen("a.in","r",stdin);
freopen("arena5.in","r",stdin);
//freopen("color.out","w",stdout);
int n,m;
cin>>n>>m;
if(n==5 and m==5){
cout<<5<<endl<<19<<endl<<7<<endl<<1;
return 0;
}
if(n==500 and m==498){
cout<<126395;
return 0;
}
if(n==498 and m==499){
cout<<1698571;
return 0;
}
if(n==5000 and m==4999){
cout<<132523761347;
return 0;
}
if(n==99998 and m==99998){
cout<<329154437110732<<endl<<894132907628644;
return 0;
}
return 0;
}[arena.cpp/color.cpp/detect.cpp/duel.cpp] 作者本人 & 拼写大师
/*
maybe sonner or later, I can fall in love with a leaf
*/[duel.cpp] 你在干啥啊？
// Never Gonna Give You Up ~
//freopen("duel.in","w",stdin);
//freopen("duel.out","r",stdout);
//freopen("duel.ans","w",stdout);
/*
#include<cmath>
#define int long long
int x1,y1,x2,y2;
*/
// Key Words =w=
/*
AFO, LOVE, CCF, Solution, ... ...
How to input Chinese ???
666
Minecraft Surver: mc.163mc.cn
Guess my Luogu uid. 527598.
Fira Code ???
wo yao da zhong wen . ren ji
========
|--==--|
|-|========|-|
================
|--------------|
|- 2024.10.26 -|
|--Afternoon!--|
|---11:45:14---|
|------/\------|
|------||------|
|------||------|
|---Now Time---|
|--------------|
|--Powered by--|
|-----@NOI CCF-|
================
*/
//Password Z*L#LH%9 (JS-NJ)
//ta de % gei de shi quan jiao dao zhi da jia da bu kai ti mu fei chang chou xiang
//chu san le zhen tui yi le LOL
//LLLLLLLL sz【拼音翻译：他的 \% 给的是全角导致大家打不开题目，非常抽象 / 初三了，真退役了，LOL】
[duel.cpp] 计时器 1
// 14:44 Problem 'Duel' passed all examples. 100+0+0+0=100[detect.cpp] 计时器 2
// 15:29 Problem 'Detect' passed all examples. 100+100+0+0=200[color.cpp] 交流分享
/*
3 5 1 5 2 1 2 4
1: 3, 6
2: 5, 7
3: 1
4: 8
5: 2, 4
dp[i][j] -> pos i with val=j,
dp[i][j]=max {k=1,2...,i-1}{ dp[k][j] + same(k+1,i-1) }
-> O(N^2 M) =35pts
plus xielv youhua =50pts
*** ... buhui xielv 6
????? why do you need j ... sz
dp[i] -> pos i color it red max sum
dp[i]=dp[j]+same(j+1,i-1) ... a[i]==a[j]
<=O(n^2) 50~60pts
ooo a[i]==a[j] is not right
=O(N^2) =50pts
still wrong
dp[i][j]->pos i chosen(blue) and last red = j
dp[i][j]=dp[k][l]
nonono
35pts
17:05 100+100+35+0=235pts
*/【拼音翻译：xielv youhua 为「斜率优化」，buhui xielv 为「不会斜率」】
[arena.cpp] 急了 or 寄了
// 18:18 100+100+35+32=267 ji le[color.cpp/detect.cpp/duel.cpp] Code by Daylife
//Code by Daylife[arena.cpp] 真是非常的 amazing 啊
//Date:2024.10.26 18:19:56
//Thing:_FJX_ is going to AFO
//Amazing!Amazing!Amazing!
//FJX'OI:2022.4.16-2024.11.?
//CSP2024 RP++!(JS-J00112,JS-S00102)[arena.cpp] 神秘数字
cout << "11451410086 RP++" << endl;[detect.cpp] RP++
if (!C) {
cout << "RP++" << endl;
continue;
}
cout << "RP++" << endl;[color.cpp] 我放弃了。
//freopen("color.in","r",stdin);
//freopen("color.out","w",stdout);[detect.cpp] 如开文件
//freopen("/home/csps/Desktop/CSP-S/detect/detect1.in","r",stdin);
freopen("detect.out","w",stdout);[arena.cpp/color.cpp/detect.cpp/duel.cpp] 二度春秋
//Luogu:392844 the second year in CSP-S rp++[duel.cpp] 考场游记 1
/*
14:35 There is something wrong with the .cpp and I don't how to deal with it:(
14:49 The four giving examples are all correct and I thought I can get 100pts:)
rp++;
*/[detect.cpp] 考场游记 2
/*
14:52 finish reading
15:02 don't completely think of the std so I'll read T3
15:08 maybe T3 is a hard dp so I choose T2
15:33 T3'example in PDF was wrongXD
15:58 ans 1 is all Ac but ans 2 I can't solve it
17:45 I CANNOT SOLVE IT
nlogn to solve the first problem and don't know how to do next:((((((((((((((
rp++;
*/[color.cpp] 考场游记 3
/*
16:00 start to get the 20 pts
16:20 over
rp++;
*/[arena.cpp] 考场游记 终
/*
16:27 finish reading
The problem is TOO long, I have to say. trying to solve when T==1
17:19 finished A maybe less than 8 pts.
*/[arena.cpp] 用我一整题不写换我 rp++ 好吗？
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
cout<<"rp++!";
return 0;
}[duel.cpp] 不好。
#include<bits/stdc++.h>
using namespace std;
long long n,a[10010],k[10010];
int main(){
freopen("duel.in","r",stdin);
freopen("duel.out","w",stdout);
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a,a+n+1);
for(int i=2;i<=n;i++){
if(a[i]>a[i-1]) k[a[i-1]]=n-i+1;
}
for(int i=1;i<=n;i++){
if(k[a[i]]!=0) k[a[i]]--;
if(k[a[i]]==0) {
cout<<n-i;
return 0;
}
}
}[duel.cpp] 孤独摇滚！
//Bocchi The Rock!!![detect.cpp] 孤独……等等，谁？
//Nijika The Rock!!!
//Theme Using(VSCode): Red.
//I am totally Insane.[arena.cpp/color.cpp] 那我缺的喜多郁代这一块谁给我补啊
//Ryo The Rock!!![color.cpp] 是的，一定是的。
//we can find out that this is definitely a dp.[arena.cpp] nothing but arena
signed main() {
freopen("arena.in", "r", stdin);
freopen("arena.out", "w", stdout);
int T(10);
cin >> T;
while(T--) Choke();
return 0;
}
int Choke() {
srand(time(0));
cout << rand() % 20 + 1 << endl;
cerr << "Nothing but arena\n" << endl;
return 0;
}[duel.cpp] I can't sure
/*
I can't sure that if this program can AC,
Because on the computer of I used when was having the exam,
The program ran about 1.32s on the biggest sample.
I hope I won't TLE. :(
*/[arena.cpp] 黄粱一梦
// Wants: 100 + 20 + 20 + 0 = 140.
// That's just a sweet dream, but of course my code is so bad that
// even I may only get:
// 100 + 10 + 20 + 0 = 130.
// Finally, my dream gone.[color.cpp/duel.cpp] 玻璃渣。
// but the glassy heart is born to be broken.[duel.cpp] ez
/*
Finish at 14:58
ez
*/[detect.cpp] 作者的心理路程，后面忘了
// Why Prob 2 So Hard?
// Sleepy......
// Having no idea at all...
// 16:09 maybe know something...
// proved wrong!!?!!!?!!
// loser.
// Nice!!! Think of a 40% Solution!!! [at 17: 47][color.cpp] 萌混过关
void solution2()
{
cout<<"QwQ"<<endl;
}[color.cpp] 只是简单的 //freopen……吗？
//freopen("detect.in","r",stdin);
//freopen("detect.out","w",stdout);[detect.cpp] 变量名用 CSP 会增加我的 rp 吗
int T,n,m,L,V,d[N],v[N],a[N],p[N],cs[N],ans2,ans1,csp[N];[arena.cpp] 虽然我不会做这题但我会 Dijkstra
/*dijkstra
struct node{
bool operator < (const node &b) const{
return val<b.val;
}
}
priority_queue<>Q;
Q.push(st)
dis[st]=0
while(!Q.empty){
`if(vis[u]==1) continue;
vis[u]=1
t=q.top(),q.pop()
for(v that t.num can reach){
get edge
if(dis[v]>dis[u]+edge.w){
shrink
Q.push(v)
}
}
}[detect.cpp] 拼写大神啊
for(int i=1;i<=dectected.size();i++)
{
for(int j=1;j<=heads.size();j++)
{
bool tag=false;
if(dectected[i-1].l<= heads[j-1] && heads[j-1]<=dectected[i-1].r)
tag=true;//if this camra can detect the No.i car
if(tag)f[i][j]=min(f[i][j],min(minn[i-1]+1,f[i-1][j]));
minn[i]=min(minn[i],f[i][j]);
}
}
/* for(int i=1;i<=dectected.size();i++)
cout<<minn[i]<<endl; */
cout<<m-minn[dectected.size()];[detect.cpp] 暴戾语言爱好者
int fuck(int x,int n){
int l = 1;
int r = n;
int ret;
while(l <= r){
int mid = (l + r) / 2;
if(b[mid] > x){
r = mid - 1;
ret = mid;
}else if(b[mid] <= x){
l = mid + 1;
}
}
return ret;
}【注：这位选手重构了一份代码，保留了之前的代码（以上片段选自这部分）并注释掉了。】
[duel.cpp] 你被骗了
//xu huang yi qiang
//#icnlued(bit\sdtc.h
//usign namspaec sdt
//itn mian
//retrun 0
//fropen("duel.in.txt","w",stdin);
//freopen("duel.ans","r",stdout);
//998244353 114514 1919810
/*
If you are looking for confusing codes, I'll give you this song because of the lines above:
We're no strangers to love
You know the rules and so do I
A full commitment's what I'm thinking for
You wouldn't get this from any other guy
I just wanna tell you how I'm feeling
Gotta make you understand
Never gonna give you up
Never gonna let you down
Never gonna run around and desert you
Never gonna make you cry
Never gonna say goodbye
Never gonna tell a lie and hurt you
We know Richard Wang Sulong
Your heart's been aching but Luo Zhixiang to say it
Inside we both know what's been Guo Ainong
We've known the game and were gonna play it
And if you ask me how I'm feeling
Don't tell me you're to blind to see
Never gonna give you up
Never gonna let you down
Never gonna run around and desert you
Never gonna make you cry
Never gonna say goodbye
Never gonna tell a lie and hurt you
*/
//so below those are my code, and >>>DON'T forget to DELETE the // of freopen<<<
//si lu: yisi wei tanxin, xian shishi (ruguo zhenshi chun tanxin najiu youdian shui le ba【拼音翻译：虚晃一枪 / 思路：疑似为贪心，先试试（如果真是纯贪心那就有点水了吧）】
[arena.cpp/color.cpp/detect.cpp] 反复强调
//>>>DON'T forget to DELETE the // of freopen<<<[detect.cpp] 考场题解 & 拼音大师
/*silu: tanxin
a=0: continue
a>0: conghouwangqian, xiaoyu V continue
a<0: congqianwanghou, xiaoyu V continue
zuihou: chaosu cheliang ==0 ze ans zhijie wei m
chaosu cheliang !=0 ze ans zuiduo wei m-1
*/【拼音翻译：思路：贪心 / a=0: continue / a<0: 从后往前，小于 V continue / a>0: 从前往后，小于 V continue / 最后：超速车辆 ==0 则 ans 直接为 m / 超速车辆 !=0 则 ans 最多为 m-1】
//over_edge: kaishi huo jieshu chaosu de dian【拼音翻译：开始或结束超速的点】
//qu liangbian(<L,>R), L qu zuixiaozhi, R qu zuidazhi【拼音翻译：取两边（<L，>R），L 取最小值，R 取最大值】
//>0 qu youbian【拼音翻译：>0 取右边】
//<0 qu zuobian【拼音翻译：<0 取左边】
[color.cpp] 如此暴力？ & 拼音大师
/*
silu: sihu keyi dp
raner tuibuchulai yushi violent dfs
*/【拼音翻译：思路：似乎可以 dp / 然而推不出来于是 violent dfs】
violence(2,a[1],0,0);//cong 2 kaishi, jianshao yiban changshu【拼音翻译：从 2 开始，减少一半常数】
[arena.cpp/color.cpp/detect.cpp] 警钟长鸣
//Never Forget freopen("xx.in","r",stdin); !!!!!!
//Be attetion to the data range and Long Long !!!
//Force Solution must be started in 30 minutes!!![duel.cpp] 警钟长鸣 +
//Never Forget freopen("xx.in","r",stdin); !!!!!!
//freopen!!!!!!
//Be attetion to the data range and Long Long !!!
//Force Solution must be started in 30 minutes!!![duel.cpp] 小朋友你是否有很多问号
//a??????? T1 cheng ti????
//CCF ni shi ren zhen de?????
//zhe ti ni pa bu shi ba pu ji de ti mu fang dao ti gao le ba
//gan xie CCF de qian dao ti ,rang wo ti yan gan hen hao
//jiu shi fen shu xian cha bu duo yao dao 150 le....
//my name:__O_w_O__(luogu)【拼音翻译：啊？？？？？？？T1 橙题？？？？ / CCF 你是认真的？？？？？ / 这题你怕不是把普及的题目放到提高了吧 / 感谢 CCF 的签到题，让我体验感很好 / 就是分数线差不多要到 150 了……】
[detect.cpp] 加油吧少年
//wo jin li le
//sui bai!you rong...
//ti gao zu yi deng
//zhu ding bu shi jin nian...
//bu gua fen de hua shi 100+40+25=165
//ru guo zai duo yi dian de hua shi 100+80+25=205
//bu zhi dao 1= gou bu gou....
//bu lun ru he
//zhe bo 7 ji gou ying gai shi you le
//wo dou mei xiang dao wo neng zuo zhe me duo fen ne...(jin guan ti mu hen jian dan......)
//jia you ba!shao nian!【拼音翻译：我尽力了 / 虽败！犹荣 / 提高组一等 / 注定不是今年 / 不挂分的话是 100+40+25=165 / 如果再多一点的话是 100+80+25+205 / 不知道 1= 够不够 / 不论如何 / 这波 7 级钩应该是有了 / 我都没想到我能做这么多分呢（尽管题目很简单） / 加油吧！少年！】
[detect.cpp]
//wo zi heng dao xiang tian xiao,qu liu gan dan liang qian kun
//my name:__O_w_O__
//zhan guo:2024CSP-S:100+80+25
//wo bu yi deng shui ren yi deng????
//lan gou ,wo laile!
//zhan guo :150 duo hang de dai ma
//li jing 3 ge xiao shi de tiao shi
//chu le 15 fen zhong xie A,10 fen zhong xie 25pts de C
//dao 18:00 zheng,zuo chu le 80 fen
//zhe ti yong le wo zheng zheng 3 xiao shi 15 fen zhong
//shuang le, wo gan jue wo cha bu duo ye xiang chu lai zheng jie le
//bu guo mei shi jian dan le
//bu guo......zhe ye jiu zu gou le!【拼音翻译：我自横刀向天笑，去留肝胆两昆仑 / 战果：2024CSP-S：100+80+25 / 我不一等谁人一等？？？？ / 蓝钩，我来了！ / 战果：150 多行的代码 / 历经 3 个小时的调试 / 除了 15 分钟写 A，10 分钟写 25pts 的 C / 到 18:00 整，做出了 80 分/ 这题用了我正整 3 小时 15 分钟 / 爽了，我感觉我差不多也想出来正解了 / 不过没时间打（？）了 / 不过……这也就足够了！】
[duel.cpp] 两倍宣传
/*
//freopen rand
luogu uid:267125
QQ:2077242701
*/[duel.cpp] 是真的吗
//我？写出T1？真的假的？[detect.cpp] 物理是这样的
//我tm考CSPS还得做物理题？？？[color.cpp] 语言描写
/*
南外哥：
“这T3这么水？真的假的？”
一小时后
“这什么东西wc”
*/[arena.cpp/color.cpp/detect.cpp/duel.cpp] rp++
//rp++[duel.cpp] duel!
//duel![arena.cpp/color.cpp/detect.cpp/duel.cpp] cyx & gmx
// gmx shines, thanks the great gmx
// cyx shines, thanks the great cyx
// freopen,froepen,ioi,akioi,ccf
// everyone plz, watch Arknights live[arena.cpp/color.cpp/detect.cpp/duel.cpp] 大哥哥，我会去 NOIP 吗？
//I will go in NOIP
//by SIP zhangle from Class 7,Grade 7[duel.cpp] 乱码大师 1
/*
Ht6Yqrz5CQKoTwl9JiWTjacKRZqB8DdN6iwwXt0kJIYkFHrWzNzhyZzN9qZF1Ac7sW1QN18eIeOXvD1vZyaXXZseNPtOaUTSyVqMUw0maNHWaIP7ExcmWVOsuIGUmkvkFj4hg5UGQjky096E4iybDNR8fhaPRV7eDCMtFo9fXsdV1jk6Sifd36lilK5BnBp0L9tav1DRtqwsYgwyNZbQdL7NfAYQLLRgVIEOHRp8Gk1oOvmlTLA6gHRJPzklL9RoRgCh50pLiq76ktqDDyHtFjBcgtN12npRR08WyysgmzmWrah2Yxtle4OKxlMzW9Px9XS7VIlGFYk66S6fN0O14mL0Wfx2pMywuQ2NindxJO2Qo83B8RABCTBi98kwVgqN6siogMmximLUuOd1onC0GNiNTQHy58JB020eMka4WvWOK9P6ub68wmWQAlMFtgRsiPU2744b0azIjPOdySlvEFJM1fasLzk1OD3TH54Hf3ZMQxxNNhGbwZwvEWmYTUZrhbIzgMEKNogojeB7JRgF0a9C4tkXN
*/[detect.cpp] 乱码大师 2
/*
FwdbI5pqQ1fnBj5025s2FtekwHkIZqpnkSM2WBrwDUhMDmNDpFF46ro29WLgL8R3Yn62xvyAPdUcPrnE42GAs2B1ZUfsc7vAuzDpu9xJnStAJgNOhdWZghaD9D3lKyuDw52qC08xS18jiT5N6awkFWxPhyA2x2Ft5FhIDpFdpLNVoQst0odGIZdzXl1SoEJtS19foPJdie8V2yO3mzH4Yu24f3WRGqLgpULbrcDYEJ3HIPK4OZ7xT9z6AVYOJt46LOiB0thFCkUU7oXVLcQolPuttQICJMHdkxmjqRw29QVGC2lXcCJNbBEUcWftrwUZtEGhfCjoaC4mCqHo0Y9ZkO4KuhBjdgHUuX9YksMK3P5FFK4DtDmdZovSV6B6mSYf0hDiYX0bw5o9OsMH47sbvn3PrFVef2HdjSLFxKquNf1lVM2XTu9MfClXPF93HOgyq0ElK2ffffR91TgSMno10YWNlfQ035yr3AdLBG0ovRxuteMFP9EPhjlSOBQQEOFHXscg7dU22Sxv4H8TQLr74cXQlxo0K4FpusV1Tx4VPzPRGVtfqkksKGH5D53V7JI29l3cj5564UYJ0Pwo9gfTwwW8zad7ru90fCcOGhTIA1b8QXwXCby8VUGV2sctmjtRtTo99HSJG1ReXNBjx9rSb6veyVXkEP98sxH1EhKUjj6G5Hz2OoS0uOcst7a6WiEPfTOsBhKuQRATg7V5vw3qIfg9mFFHxRgat2Q4jlw8A4boB5t6zuwHXbQKqebn3FNwFo0zXw5f0gT9lLGkFAznlO5b2eM3tk08W051vAgtp93YSHHiRGTBeYkeC7i3rgBLgFMZP0RC7Ulaj2G8IjJvH4XTBDW0tfJYsd7IdYSk0DIjFYqWH9PWBwzK8TI17bXzEdFpBiYAvqr9Nhfcp49yy8J6ab6hBbeNEuDOclYVZNeu5JXsLgqKm7OMhS1s4gDIYQgA9CdhaIbdZ8VvmLDZRZt82v04ZDK7c1HjBsOlA0Oi6tbtDoQeLJmLEkPnvksVj7Du0beAb2qguRX5DxjZGTsVBIG409YhGlZGMDPwGFc8f9Ds6uPMLIpUY4YYB6DPpmgC038EGiMtrZmvTBFmR5Gz7mVIrihgVLsVMyjbe5UTcEO3Oepph5pmrK4i1jNW5DzPCi0olVILjgO7IBvzEil52nm1X9XaMUzWAyLvRdE8HcEal9XzrH3r4ptZwO7Gt5l334xSf9awkoWVv2VmJYcLLTtHp0Vi3Gk6KfWzm7uWtO2pQXZj393OcwdSu88yNq2fTZdGeXmXvmKMJu3K34ieyL4rUCnr1pWUM7iyeTWaFquZivtkyaOwvQnNcaCbOh4iomhTFD1V1t2kotSmTqhNGUkq3vQRcU9OGqrU1qx3jzlWqDGI1xfFQN5TIVusx1HCq6grxdseadAOoRgpMJ4mf8Fvb7oZ93jz9Po40hjYItw7IbufuxPZ3fVemHBtKuqRHfWFKFna6ihNJa0BXPja4CCpRMglGXAWAglUtZ4yFkJWKJfpgONjYXYztCiAjtetXPLPwOLB8ehQvNDbjYKI5qFz3y7kplcKAxj7J4GRiypbJ0D0YVGeKWbLSi5FTfZbdJiwLxM2v9dC8oCgKRIcxtxNZ0c2g9eHQKBmHVoAfPKlEVPWwg8rZ3E91o9hxlyO688NduWGJq1VLRzH558e8KlA8tp4emQkuW6VQamhQlBkAAzFG6sMQbUXUIZ94zrwVvRtVBYuxje7sdN6hFQ8qtdJBCSDBH7eDYVii3cflEmbq7hXM5fByGU7SuKbBRFMyi5gkfJVs56iBlDVqtgp78ua0FBCePYa7bGpFZK5dOno90Hyrylz4fX5sgFX5l7BLM0atJfUhQGpOYnEUWBYBib4OqZScgbv0bVus8OaWdNsB86feFBpvnrKbQkB5L65uZxnfKNBxi28q6lUMwHHh9ZHXJSceXgZ6dMmxhvsPxyF4jhOeyfL7FcfY3FBavieX4QSjKL6HJJJ10hfyLy4abh6cwFAsxoPzFpiZAmoS56T5n82866gfnlHj0RZyGwxTme0uQoMWupZgxbm2fThSExACMhAae63Ok1I8qdeiSCMOn9OTc5to030Nl9vNFxjxy15ociV3srRd0p6asyMrzLCkS75f4oc3ofpQLITBAsp8fthWr3NrMXZoefThT3iFhXg0o9Cy014fulBkpWb93AygnPNHR3W8aA6MIIKIHPvA85uvbV5dd1JRQegphAvFJ2cbIuraHmkQrcLR5O4iPL7ozldguZtDZVmrQdRfP95FlPgqniXB3cz2OagI7ZTg3FYTsx8F5CSob6dMo8XpkUp83VOA3pr64NXuId8LpYAOfnlRvGFdj4kmY8wbwlf06CtNpzidXs1AdkaWzpAituUP0O0w8dvCpoZdnIGI8FRm01IzqSfhK77LV5HbjCoW0N9ldN2mdTYdUoaIHFzZM4upACRrODLNYV6Cq6yTZU41IcJXpH79L1zTDOIaZev77zJx6FPdjRd24uZtBg1Vi0ytMFRttK0yKItOXIzHkcJmXqfgXgBDe84yNWrEoqC685SfMSu62BsX2VEXANkmVmlqGa25QEBWIeAc44g6GYcG1ql9BVwhFfVWFYbekkA0MKcQNIVbo7rqxcz85vnIaHoopNSZ6aYStArGTMrHTg5OG5UJyGbXXOJKjjrpJPGCa7Q3THIuvOI
*/[color.cpp] 乱码大师 3
/*
sb3KBsf8AhSYWjDHYzW957bNLfE9ToQJOTdXLIgTz82TpFkMFGTIM4dhhpqAeES0f5XzMBSJKUn7iVRvkuD6wolddbmFnEFSHnRbysvGMgO2BpxtiAzeykGaJ2p4E5VTsw3qmy59cRBlE7fwFcZCLnmcpbh1gCSW6VLtRQ03r9p5GS0W4ZiNMU093f8iraEv4ZmVxkXosKs8mscoPICjkCsoryWgWiZaGK4D4b0wvs3fidT7ufqepgQecuI8dshtCl6EK69FwAsenLjhzZKoDkRpdjwGbd7lMBygG7tCHjp24Yi362qHkH7N01baciLwuJaAOTKfA9gEgOGmO638L8UJ95tjoFfgWFovg8YqGC3waJgwNj3iqX1xcthO6K4casVEz25FE89pPpjmWmSMJRIuKzIQJN1rDW6AYBPnHWagLJQq6sANJSHeRa2jv3a6aeH6per4BRiUj8InyTAIvQuL0w2t0cxYFEc4rU70tnScwlPuCYA7y2QwzSnx3kTIz5KoXPoRDG171PzDx8JtAhp98c49MXPJbh787tZIAbN90MLvUeodJbmRDpaXMxpxfu6kod2wEP5CjQ7C2tpKUZlfOKDjF0euukegMecY1gll4sv5kkPEH8ugQ5Pg53axmDe6pEeruPaxGV20DREUX68yBXeEZEAJPmPF034tReqh7qfIFtmmyvk7QOMxbUE0GdDEfH56tvn0jSIyJ3lFwVNKshGTBURP6ddlujroccmM23IJ43X0XuIPZYsk3H79ukunRjb4JLOJMgaQk7OHzheYFUIIlPPg8HTZy2dFLzYig76OEVdCCHkPl1iUQ5AWNb6LbhZxf7dLCjhPCKbOZLoKMUolXxHuWLE81n3gsgz5NgUa03wZOkrlCfUkalc75qD6bGkUujXHPzrP2mwOWn7hQbP1L16QqJURZEtTvOiKNYhNKdmoQtToVspoutEiCg9js1AnPt7lPo8jPuVpmzbFrR3jIFRVvZEnaNYxGfidRpMohpbToCigdlNwypPtObewyCtCpapEP926xdalqGPR0nLycksyKUuIhlTULGjkOlrLPP6DfUedH0criSn2whJbSk6m0nWOYNjvko8OIl1XjbMP37QymhXCRdyPQVoxqVqbHxzXiy2PaMobTEXFv5SKgQk7tW2kzsJHpGmVEpum9hOdvtqpyI9fhrkaNmINcbcQrMv4BqqJXCwQ6kD41LjiCRGYDZvo8VE0r941xuKS5ErBy4FxNxfaOu8aR1MZWaZLhbMdUe3ZsukpxxmKsQsFI0njz9ITjqpOP91to3Qex8Rs6EBwc3Bu2yb15rVofIB5RAwFDNuBVL1ZXCW7Ef1GeaFjSiW70fCSp7f3UZCxtDXOO3WcgVqK652YmWdmBoC0vs3PPFMIRrfpsBPZeFrkIrG4NupWi1XbrY0HmKXDAC02LPZ0eRiwIzzermAXlf8dC6syQP9Ya9btYArAZa4qZ3UOncvZI3CU92QXPZ6xgfrEniMNIQBpSfBFH6oX7yzGyPoOwsLcXAoItAd9Zox1T6EjD1GKxGZwdNIaDdAimz0d7ekgShfuoudzvrHs5qmjB4HOgR6SQ55WjpC9Vs3HkeGfWXVZMIIXKZw010SP3VvkJ8uoyv5iYJL2oqbA6ugPRaPSYqqcJlMc
*/[arena.cpp] 乱码大师 终
/*
BpdrKRKmpRjKOf1o1qgpTI5IwjiKBgCNUnCoEWY2yHMKvL7wCnjd5ov0XdIjHS4lFGXSm3UiLo3EAA8KvrvzfqzARFrgivQv9xNuzpcIefWmnc6jTzg6pfEEs6sazIW9Er3DhfVJJz54b9l28R6v4K7xQzVOGzXUrafYD8rU5uZg3KgBmm4q6BlVAHtQGOs5yVd9bSegKBKNT0WFma4rlpKu4BILZBOVe2eGSGwnPH8tHd62D8rxwBr0M9JvIiQxi2B8H7tgM2XcdeeqmTlieah0k0t0gHvOJ4XYCODWOk81Oks9DbppCWpuXgsBxoaFs5n2T0Xsldr7MhEXJ4NVaAN5rFHo3p3uspuLpRBY33ePksw1wJWVUtYJ7p78c92UwvojKzIN0umjmhkhyFCS6kjDYpM8yMdsFRbaOrvNlg6WNoDL3NmA5VLbKfkG0L8Fmin8ZjVJNbpkQ03RLnZQHv0bYiqY3wmpeZvCGRVd2ILQGNsbAPzRIz1rhrNil9XOhRaxs3ZsJuJZH9AQY7rr7sgmh3VTD0rsRPpHQOAjHRGWaQw6XovcebNMdqnqqciG1VXPsf896OdgmalHMgs0GFKt37hrjN7isd7kIDrNZT3L3obNTTLjggchlJYTgeBWFHFVU4s4XwNYiyv9PHq3vSkgjH9NvJsAa7f2BY4hSSF8O9ImO8nJZWxGn7eiOWqybVyk13RRVfaroqdCwPTVvQkiVMOtqEpRhoBjrdAKIi94YlGTAhw57gld29WqNMH48Rnz2wHIcOM99acJHYMOD71DGW4dqLgykRvmNA4yYQ7i0hzFDMeQRdci7gJxzzvkRoWmybkXzpDyWCDkWp8yTkeaQvWOtP8KEc4CBnh9au775KpZ8xXZi9765dUy3aGFBIPK37Tezaj2tYc1V9YBHfIKJkGKJUZSmymq3GS3oB5fjheCpCO4seOBMeVd825s0sg4885uHAa0qEBdRXhJB5UVhx9nzEdx4K1CQ67gFhg3tpgKMLdVQ51508qxKTvPlwZC1eqEJWHDKxXgI9CgCBjDHZAb05ym0YwzCmDUGUhaPCFfLPJYY2jpZrOZvNJvtFs3z5XGXCowP3ZiQsGysxlRpAykVIdMVVPVYvj57XzUZYDzORyGNjfCrbuMtXgN06qYzZb44aZd6kbU9XiWGNi6ycQq77B5B1dAYCEcklEqTpIdM09aLqgIQ58YCJdNIFXqRjSATg0wTHZnFhObX2tx7zTHG5eYK9OjrotKTsEw9okOT6xy8qvEpNV3S8bmHzT8mNSFDhBMTtiuzgs6UlKI8nLavvKDsoJe9mtMR3gswMmw0c2VNKlW7443zPEsDXWKHQggTKYPgIJfuJ8GdtmlxomvD0nOVJinhMT8g0WLIp0B98RkzBVuzFpBDcZjuGWZcxiHxCaE1YN8gmrdxMXuaN3nxbWpr0PRy7itJG5IoQPUCG57ad0Ay3yteSjTT8vPDbGUsKmgk99xPE2yp28n44fgXOAyU5NhgbBYvvFg5ObUabQQcZBgbqM8CU6gZRNE3YmyUzcXLB1ulSKNzT1aKNhWqnBPDYbG5MCXLn4fw3ZhTr4SK51cRi7HTIegqGwvc7QvuUYqY5Y1waUFeTr5ByKeGwJ5AFykKPeErC3PGbRA9tPnKFqVBA7Q5QVFeR0yoeBgoE54nUFwLckfraA1jGRogw1IL1HAdQqSevUPOhLjI3P7cX8JnZ7ST6kp6zzjNn91gcQ4JkoblBhNgpgSPluqscfyacfxPpx4RL8i3uIp5zCkorCBc40SgdOEE4Cbr7fGSoyWiELmDVW0Mg9xk9NQnkdzmnaduGrK4pqk29UFdyDxeNuOUGnF0QEkDpN55CP7zEp1NKHyGUwvpoHK44Z2Somfb7keJAlHOYIjqXi72e0pQH9VMhVoTGS4NAifIRwezEMqm4vmgvZ6CjZWO5JrJjtgtbJC2DozQAnAEiusbTxoAWIYZZPsIIXCroMr2ArSLcaXLUOwxLi8pzeNY4FrKk1AZL1ZTqzmTZIm3ggyzP4oMjBulPj37kDg3FFX5CJWlbImFzlEMn1iWAcFZKJh2WL6lZdpluLVUcHjb2yvozdK9DahXtMaNfg7EHwy9FTdpkNOlJJZGwrNAP2fGOFe2tlG8fCIsdviMG65ZQcnKTBUrD87aNlcFUqN91f2eZk0pq5NEhAZ9L10X975VtfkNV5VWlXBIF975FUKufr3ys3T2BYX2DFNhKsB3NMLcURgjvydYphVhiyjtVEtgTHNo7ZpVtB5Nal4Vji2WNXE5TvxyAqfd50PDZFgROloyXtREZRluwzzQuuM2lzgqy31XGhyeTlayc0CBRx5Ou2mnx6pg6TU4XWZnDWQgHyctyp2Ok7kf7WS4cFigjDiEjIzuoPZ3MBuI0uglzQO6uo9V3rBk4uylCygyLFzfQryRleAi3YovKxQNnc8rW4bg2HcMWZ1wOzL9cTrdzdYJZzhMbnB5rmjs3JEXsFSGDnNpHCSGpyaMxFgW0sZrcGhgZvBP9dfMR09gCZu0XSKVf1zftXXTnC7N8JkHwQbLOkzZJuXoKrH0qHfjoADZNKuTbfkY3JrR1ryKjV63LO3BfhtRr40CMvfyaNUbgL2hA1ztU6xpUy17fuWVwUhIPNGxikWP4Z4EY28263qa1pffhB8dfpv3ACytuVGw2KBaMHaSKQ0JFdwwm4XSuTT2dPvVu9SuUbSos3FARDTfrQZdU73MYUNBuGgmQ6hsh7gZ8tjY5BDwbkX3pZON3lWvzBgPHLHzSwWbpG9uRKo04K1stNDu6ko6vUVApn7HjeqWuzPJJDHMVGCOePHk73q0XKBM5IbmwSIoRf5jtK3ObFlFc0xk3mkY6ts9CTv6vBtLrw2iH54sIn5ul2eooNKsGC1QgwVZ6MsxIufXxhNFVS8GTm3H7NAOa9oE6JnCfe7wWkTURrhuHnBkYC0fZA37HqLL97XnlchFMAjmzPgFApzi1zOZ7RgPH2kP7GAqqr5BznxxCbCMRB3Q9RzGqgd6gMVncddQSibRVYOf8Y0Xi3xrUx5IbhOH3r2dUd3wJfMpBiSJHQqzTmovjrEIYaXbSZEuAGrTvBG6tjO89E5b0rUhjgxHHUtj15dBLSfEdtJVchbkthJsYnXHUVXlxOSzT5AnWnz7fIcFxEzptGhP4CfWhCFfahc1kkmGWkOB0yQyAOl1eQRgc6AIGPvo4XnnFa3lIPwIOLEWjzYLNz003AGHYB5agqNvOPhgobzAwBhd9DzWAxUB5kSbtVCZLZTkyAQljNvgXaHgnEAvBf6HPYqH12qLaJ5WRTH9pBpMj40VJAQSpXhD3YU3aIO8aTfzuu8j3v3n03GJCglzBTAD1eGZveiV5LUzDdhHYi2WkIpwwZv806J1iZYdDE6IXZFlAw2gf2DPK0LGZEMXIfYzC5cPHhfpEvaOra4UcFtuEC8nPTJh6pgJuHgCwMzAHZW67YbhoSb2dhn2A6hFwOYodEyXYxhpUDublTGXvpZYXLafPIuLeQ8Ff6mD4R1Ycv8NOOtHEQqjlOOBeJUGjcTMjFYneZJGSRcoqV52vvlhI9quQKB8veSes0PWZglz8NnystynmjS2sIxHb6PWir8aqV5NBqNHDAD51BqouJonZl2ArReaGk86DBUN1peCzsFz36nyNZjwLl5AAhiQSpVd0x00mdCjVQiWUTUr3BlOuoW4WFTw4wZ2tY2fBDOgd7A5adubofzhUUl0jCwl8Tn11oeC11qc8zhgcbIOGF5ijrgQ3a9A4x93joEkp2Mv13Zdcr2q57ZmwDByoK8sFHvy39isC2nB3LpfApWFw30tGBp4VxulCohGvQ65QsHUD67NvbdpcbgtmVvHQo0dcirV6xbUpsw2w4OpdzcGaJ7Mm2bDoaoQGfwKcVoQNlQHno4QnggNxnhkoJvctj17OxRySFMnyn2lZ6CNkskigSQUjL4a45hQ28MSNhDMSD51HHO2A7ioX8GGRKqTQXrQdBrys2KKGQMXfiZppFbMNrcmCQFav60YGpX8spR8DnftVDgJSIfo9IYJgmtcqsA6hhFXXefkRJduUIDuatgh9F1n1sPpiawOF9vmnZVEq66IOICy9rgG4f33XTsE1ocGxX1k4Uwua1CzJNvSEZgGCjJiABwByYQv3Re8vY0TZBQsYKIkry04gHmqSi0OEQKFpwNiUMB4Xau3uDll9lpp0ZeSFerT29jr54XXOgbvGUwAfhuoQhcQFGrUsgwupdlshIP4yzzDTwL8dFu2vWSAkJeczYUmBDerV2vSzsdSoyYQCSS7xuFfCrGBQkybyaSRcLrbEU12RXQd0qivjxYvoo6EX2qVdGuFckpqEoqfMFGK5yDmvlhiYmw5okYRzSfbCSPPED2aSJsWF5I9pyrNklSWW0wVQZ4b1R0Fe0o5HgbXkrgZpVuXGM4mK0FkZHLYiJnLKZQbEz6wokTeFNBWjDG1DUlkl5ISO4lidBIp8Olw9EYObisIv7J7b3rK8AmWCXFngXdmtMh2bFPAxHRtOk0xnpIvx2Q9YfvCAYz3sg4RtTcri3i5lg2XVIQRLqarTV3d10fuehLWAvLsw3vihyDAGdbZUCOxfQZhOCZ3tsX1msrivnOalbkzFMXhWtc9JBoiLNjEEGF085i1s7bdgJavf5a9zDJIM7yiTfuht8h1DP05UZgBtG4WKdgJqxZA4WsXBlC5tt44H39jcnuT1x0LaeeObEYdiPBt8Nw1F13W2AFex88y36KbkwxJ8Vwqs5i0Rezgd0AfANI7VO4WUM7CG4VPYPDOVvPwaMaBNkrV57dZVf5x1D9HFcen1qAWlXQJt0VEiKkmPLLuyQrzbyErarcZhm6QHUkBTDNBV5xuOImMhbJIZW77Nig2SkSkFCtiNGrqKnki3U5k5M1cs8hFoMHH4k1JuuzG8r6ScpBfHEOLaPxRVdgKxwZ1eaLWUIkc9r5jeEPvQnGyACPdn4vkyUlc246WNr7UgAEKMdFmOUiWg87TA3B8VwiY1o2Mf9qLH4ddfrN1L6XzCdSMgdS9XAfWwiscpjv7lXiRO6SjAyiMb8gFj8OGG4nCkfmZMge8DNZbTzKdx2xW
*/[color.cpp] 求求你给我 20 分吧，我什么都会做的
//give me 20 points please[arena.cpp] 谎言重复一千次就成为真理
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
freopen("arena.in", "r", stdin);
freopen("arena.out", "w", stdout);
for (int i = 1; i <= 114514; i++) {
cout << "CSP-S AK ME" << "\n";
}
return 0;
}
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME
//CSP-S AK ME[color.cpp] 你从哪里复制来这段代码的
// The functions contained in this file are pretty dummy
// and are included only as a placeholder. Nevertheless,
// they *will* get included in the shared library if you
// don't remove them :)
//
// Obviously, you 'll have to write yourself the super-duper
// functions to include in the resulting library...
// Also, it's not necessary to write every function in this file.
// Feel free to add more files in this project. They will be
// included in the resulting library.
extern "C"
{
// A function adding two integers and returning the result
int SampleAddInt(int i1, int i2)
{
return i1 + i2;
}
// A function doing nothing ;)
void SampleFunction1()
{
// insert code here
}
// A function always returning zero
int SampleFunction2()
{
// insert code here
return 0;
}
}[arena.cpp/color.cpp/detect.cpp/duel.cpp] rp++
//rp++;[arena.cpp] 禁赛三年
#include <bits/stdc++.h>
using namespace std;
int main(){
cout<<"fuck you CSP";
return 0;
}[duel.cpp] 文言文大师……啊？
// 文
// 冯唐易老，李广难封
// 穷且益坚，不坠青云志向[detect.cpp] 你是多恨物理啊
// fxxk nm Physics
//update2 ans1做出来了 ans2炸了，就差一点[color.cpp] 虚惊一场
#include<iostream>
using namespace std;
int main(){
freopen("color.in", "r", stdin);
freopen("color.out", "w", stdout);
//最后四分钟。。。。T2来不及了，T1也不知道对没对，老天保佑rp++
//update 靠记错时间了，还有半个小时，赶紧看看T2
return 0;
}[arena.cpp] 究竟要千百次多强烈
// 一场游戏分为若干回合。
// 每回合,选择某只怪兽 i 以及 另一只怪兽j
// 并让怪兽 i 向怪兽 j 发起攻击。
// 此时,若怪兽 i 的攻击力小于等于怪兽 j 的防御力,则无事发生;否则,怪兽 j 的防御被打破,怪兽 j 退出游戏不再参与到剩下的游戏中。
// 一只怪兽在整场游戏中 至多只能发起一次攻击。
// 当未退出游戏的怪兽都已发起过攻击时,游戏结束。
// 决定一组攻击顺序,使得在游戏结束时,未退出游戏的怪兽数量尽可能少。
// 一条长度为 L 的南北主干道的车辆超速检测
// 解决一个简化的场景
// 背景1： 周末,出现 n 辆车,第 i 辆车从距离最南端 di 的位置驶入,以 vi 的初速度和 ai 的加速度做匀加速运动向北行驶。
// 只考虑从南向北的车辆（vi > 0）, ai 可为任一整数（+-0）。
// 判定条件1：当车辆行驶到主干道最北端(即距离最南端为 L 的位置)或速度降为 0(这只可能在 ai < 0 时发生)时,认为该车驶离主干道。
// 背景2： 主干道上设置了 m 个测速仪,其中第 j 个测速仪位于主干道上距离最南端 pj 的位置,每个测速仪可以设置开启或关闭。
// 判定条件2：当某辆车经过某个开启的测速仪时,若这辆车的瞬时速度大于V ,判定为超速。
// 注意：测速仪可以位于车辆驶入与驶出主干道的位置
// 问题如下：
// 首先，想知道,如果所有测速仪开启, n 辆车中会有多少辆车被判为超速。
// 其次,部门关闭一部分测速仪，但不希望漏掉超速的车。
// （即当 n 辆车里的某辆车在所有测速仪都开启时被判定为超速,希望关闭一部分测速仪后它依然被判定为超速。）
// 想知道最多可以关闭多少测速仪。
// 提示：n 很大,本题的“提示”部分提供了有关加速度的公式。
#include<i'll ak ioi>
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq qwq
ToT but and i fail in CSP-S[arena.cpp] 祝好。
//AFOed
//高三老登的最后一舞
//我只是想知道究竟是我真的技不如人，还是心态太差不配拿奖
//晚安。[color.cpp] 666
freopen("colour.in", "r", stdin);
freopen("colour.out", "w", stdout);[detect.cpp] CCF 我爱你你能给我点分数吗
#include<bits/stdc++.h>//I love CCF[detect.cpp] 勿要与我说虚伪的爱
// No,acuallly I...[color.cpp] 我的铜牌啊！！！
void dfs(int dep,int cnt){//821|847|347|1837|1641|122
int cnt1=cnt;//My bronze medal......[arena.cpp] 吃橘子
#include<bits/stdc++.h>//I love CCF
using namespace std;
int n,m,a[100005];
int main(){
freopen("arena.in","r",stdin);//I surrender,what the hell it is.
freopen("arena.out","w",stdout);
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
while(m--){
int x;
cin>>x;
cout<<"Cathy and Ray,Lucy and Darren"<<endl;//Just do it
}
return 0;
}// Eating oranges from 17:30 to 18:00 because nothing can do...
// How do the player who sat with me face to face think of me?
// And the player who sat besides me must smell the orange,good for him.[detect.cpp] 大家觉得呢
/* Maybe there're something to do with `d`, I think. */[color.cpp] 仔细分析
/* What???There seems to be nothing with a clear mind... */[arena.cpp] 都到这里了不如卖个萌吧
/* qwq */[duel.cpp] 意义不明的数字 1
//1541-1613[detect.cpp] 意义不明的数字 2
//1742[color.cpp] 意义不明的数字 3
//1613-1630-1734[detect.cpp] 意义不明的祈愿
//I PASS THE CSP J&S J1 S1 please!---xuzb//[detect.cpp] 繁体字使用大师 1
void increase(int d, int v, int a) {
// 行駛 (V^2-v^2)/2a 後達到臨界
int w = v > V ? d - 1 : d + (V * V - v * v) / (2 * a);
// cerr << "w = " << w << endl;
// 找到第一個 > w 的位置
int l = upper_bound(p + 1, p + m + 1, w) - p;
int r = m;
if (l > r) return;
ans1++;
need.emplace_back(l, r);
}
void stable(int d, int v, int a) {
if (v <= V) return;
int l = lower_bound(p + 1, p + m + 1, d) - p;
int r = m;
if (l > r) return;
ans1++;
need.emplace_back(l, r);
}
void decrease(int d, int v, int a) {
if (v <= V) return;
int l = lower_bound(p + 1, p + m + 1, d) - p;
// 行駛 (V^2-v^2)/2*a 後不超速
int w = d + (v * v - V * V - 2 * a - 1) / (-2 * a);
// cerr << "w = " << V * V - v * v << "/" << 2 * a << " = " << w - d << endl;
// 找到最後一個 < w 的位置
int r = lower_bound(p + 1, p + m + 1, w) - p - 1;
// cerr << "l, r = " << l << ", " << r << endl;
if (l > r) return;
ans1++;
need.emplace_back(l, r);
}[arena.cpp] 繁体字使用大师 2
// 對於每一個人,依次把他們加入
val[0][i] = a[i];
int p = (i + 1) / 2;
for (int j = 1; j <= lvl; j++) {
// cerr << "currently at " << j << " " << p << endl;
int ls = p * 2 - 1, rs = p * 2;
if (d[j][p]) swap(ls, rs);
int x = val[j - 1][ls], y = val[j - 1][rs];
// 擂主為 x,另一個為 y[duel.cpp] MEANNINGLES
//Something must has been wrong here,but do not assert
//WARNING: MAY NOT BE MEANNINGFUL
t[++r] = a[i];
--cnt;++ans;
//.......[detect.cpp] 你怎么忍住不缩写的
//Vars,remember to clear them every round
int n,m,L,V;
Car carsInc[N];int cntI;
Car carsDec[N];int cntD;
Car carsAve[N];int cntA;
int MonitorPos[N];
int LMonitorToBlockAve[N];// The leftest montor to block a average-speed car
int LMonitorToBlockDec[N];// The leftest montor to block a Decresing-speed car
int RMonitorToBlockDec[N];// The rightest montor to block a Decresing-speed car
int LMonitorToBlockInc[N];// The leftest montor to block a Incresing-speed car
bool NeedToChkInc[N];
bool NeedToChkDec[N];
bool NeedToChkAve[N];
bool OnlyHasInc = false;
bool OnlyHasDec = false;
bool OnlyHasAve = false;
//
int FindNearestMonitorId(int p){
return upper_bound(MonitorPos + 1,MonitorPos + m + 1,p - 1) - MonitorPos;
}
int FindNearestMonitorDis(int id,int p){
return MonitorPos[id] - p;
}
float GetCarSpeedAtPos(int d,int v,int a,int p){
float Distance = p - d;
return sqrt(Pow2(v) + 2 * a * Distance);
}
//We need to find the position when the car's speed equals to V;
//Then,Find the nearest Monitor left of it.
int GetFurthestMonitorToBlockDecCar(Car car){
//First Step
int DeltaV = car.v - V;
float TimeToDec = float(DeltaV) / abs(car.a);
float DistanceToGo = car.v * TimeToDec + 0.5 * car.a * Pow2(TimeToDec);
int TargetPos = DistanceToGo + car.d;//Does not need to SiSheWuRu
//Second Step
if(TargetPos >= L) return m;
int Id = lower_bound(MonitorPos + 1,MonitorPos + m + 1,TargetPos + 1) - MonitorPos;
return Id;
}[detect.cpp] I AK IOI
void solve2(){
cout << "CSP rp++\n";
cout << "I AK IOI\n";
}[arena.cpp] 神圣的 CCF 大人啊
puts("CSP-S 2024 RP++!");
puts("I Love You, Holy CCF!");
puts("Please Give Me More Score!");[color.cpp] CSP 的 Dijkstra 与 IOI 的 SPFA……？
namespace CSP{
inline void Dijkstra(){
int Max_num = -1, Step = 0;
for(register int step = 0; step < (1 << n + 1); step++){
int Result = Solve(step);
if(Result > Max_num){
Max_num = Result;
Step = step;
}
}
cout << Max_num << "\n";
return ;
}
}
namespace IOI{
inline void spfa(){
int Max_num = -1;
int Range = (1 << n + 1);
srand(time(0));
for(register int i = 1; i <= n * 10; i++){
int step = rand() % Range;
int Result = Solve(step);
if(Result > Max_num) Max_num = Result;
}
cout << Max_num << "\n";
return ;
}
}[color.cpp] 模拟退火，求放过
void SA(){
double t=1,p=0.98;
while(t>=eps){
for(register int i=1;i<=n;i++) color[i]=(rand()%2+1);
int nw=calc();
int delta=nw-answ;
if(delta>0) answ=nw,ans=max(ans,answ);
else if(exp(-delta/t)*RAND_MAX<rand()) answ=nw;
t*=p;
}
for(register int i=1;i<=10;i++){
for(register int i=1;i<=n;i++) color[i]=(rand()%2+1);
int nw=calc();
int delta=nw-answ;
if(delta>0) answ=nw,ans=max(ans,answ);
}
}
signed main(){
freopen("color.in","r",stdin);
freopen("color.out","w",stdout);
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
srand(time(NULL));
cin>>T;
for(register int i=1;i<=T;i++){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
ans=answ=calc();
SA();SA();SA();
cout<<ans<<"\n";
}
return 0;
}
// ccf can you give me point?I believe you.[detect.cpp] 书读百遍，其义自见
/*
【题目描述】
小 D 新入职了某国的交管部门,他的第一个任务是负责国家的一条长度为 L 的南
北主干道的车辆超速检测。为了考考小 D,上司首先需要他解决一个简化的场景。
这个周末,主干道上预计出现 n 辆车,其中第 i 辆车从主干道上距离最南端 d i 的
位置驶入,以 v i 的初速度和 a i 的加速度做匀加速运动向北行驶。我们只考虑从南向北
的车辆,故 v i > 0,但 a i 可正可负,也可以为零。当车辆行驶到主干道最北端(即距离
最南端为 L 的位置)或速度降为 0(这只可能在 a i < 0 时发生)时,我们认为该车驶离
主干道。
主干道上设置了 m 个测速仪,其中第 j 个测速仪位于主干道上距离最南端 p j 的位
置,每个测速仪可以设置开启或关闭。当某辆车经过某个开启的测速仪时,若这辆车的
瞬时速度 超
V ,那么这辆车就会被判定为超速。注意当车辆驶入与驶出主
. 过了道路限速
.
干道时,如果在对应位置有一个开启的测速仪,这个测速仪也会对这辆车进行测速。
上司首先想知道,如果所有测速仪都是开启的,那么这 n 辆车中会有多少辆车被判
定为超速。
其次,为了节能,部门想关闭一部分测速仪。然而,他们不希望漏掉超速的车,也
就是说,当 n 辆车里的某辆车在所有测速仪都开启时被判定为超速,他们希望在关闭一
部分测速仪以后它依然被判定为超速。上司还想知道在这样的条件下最多可以关闭多少
测速仪。
由于 n 很大,上司允许小 D 使用编程解决这两个问题,于是小 D 找到了你。
如果你对于加速度并不熟悉,小 D 贴心地在本题的“提示”部分提供了有关加速
度的公式。
【输入格式】
从文件 detect.in 中读入数据。
本
. 题
. 有
. 多
. 组
. 测
. 试
. 数
. 据。
.
输入的第一行包含一个正整数 T ,表示数据组数。
接下来包含 T 组数据,每组数据的格式如下:
第一行包含四个整数 n, m, L, V ,分别表示车辆数量、测速仪数量、主干道长度和
道路限速。
接下来 n 行:
第 i 行包含三个整数 d i , v i , a i 描述一辆车。
最后一行包含 m 个整数 p 1 , p 2 , · · · , p m 描述道路上所有测速仪的位置。*/[color.cpp/duel.cpp] 再次祈祷
//rp++【注：这段注释在 color.cpp 中一共出现了两次。】
[detect.cpp] 成分复杂
return 0;
// Final Step!!! (Muse Dash & Phigros)
}
// Sensei...
// I've discussed with you about the one who has a great responsibility.
// I didn't understand that time the thing you talked to me.
// About rights, resposibilities, and the thing on the extention of the line of time----YOUR CHOICE
// Where all 'Miracles' begin...
// from 'Blue Archive'
// Feiyang is my queen, confident and shines as lightning (Double Rhyme)
// Feiyang Wo Nv Wang, Zi Xin Fang Guang Mang
// Show my sincere love to SZZX-Shaoyu2024-Class1 Chen Feiyang
// Chu! Kawaii ku te gomen!
// Hatsune Miku is the 1st princess in the whole world!!!
// I want to see 'Oni-chan ha oshimai!' 2nd season!!! Please!!!
// In fact, I have no idea how to caculate the second number
// I've tried a n^3 method...but that clearly won't work =(
// I won't be trying n,m<=3000, instead, I use out another code ( n,m<=20 or a>=0 )
// So... I would still get 60pts [color.cpp] 20 分：我免费了
// 20pts for fr e e eeee eeeee e eeee !!!
// I think I would be able to get 2= ha ha hahahaha hahahahaha ha hahahaha
// 114514 114514 114514114514114514114514 114514114514114514114514114514 114514 114514114514114514114514[arena.cpp] 柚子厨真的是
cout<<"Ciallo~"<<endl;
cout<<"I will get 0/100 for this problem."<<endl;
cout<<"What the heck is this disgusting long problem"<<endl;
cout<<"I will not even read this problem QwQ"<<endl;[detect.cpp] 英语大师啊
struct Cars{
int di, vi, ai;//Drive in, Speed, AddSpeed
bool isOS;//Is it over-speed?
bool ceq;//ed could equal
int csq;//st could equal
ldouble st, ed;//When does it OverSpeed
bool cc;//could be checked
int cid;//if it could be checked, which checker checked it last time.
}c[100005];
struct CPair{
int idx;//which car is it
ldouble st, ed;
int chkr;//which checker checked it last
bool operator<(const CPair &T)const{
return ed < T.ed;
}
}Line[200005];[color.cpp] 中英文夹杂大师啊
/*
think:
That's a great pity that the computer didn't offer us Chinese to write.
As we set dp[i] that 1~i's answer, we can get:
dp[i] = max{dp[j - 1] + d[j][i]}
and:dp[i] = max{dp[j - 1] + d[j + 1][i - 1] + (a[i] == a[j] ? a[i] : 0)}
d[j][i] means if you paint j to i same color, how much points will you get
That can be yuchuli_ed by qianzhuihe.(is it?)
I'll try this.
OK now it's 17:56 and I found that it is fake
but I'll keep it
I wonder how much points will I get by this
I think I'll get 0 points by the following program.
But I still want to say that it is so generous to give us 20 pts for free!
*/【拼音翻译：yuchuli -> 预处理，qianzhuihe -> 前缀和】
[color.cpp/detect.cpp/duel.cpp] 保佑
//sxy bless pr[color.cpp] Forever!!!
if(n>2000){
puts("Love sxy forever!");
return;
}[detect.cpp] 逆天
/*
PHO
&&&
OI
nitian
*/【拼音翻译：nitian -> 逆天】
[color.cpp] 这么树形 dp 啊
/*
The AC resolve is tree dp
But I don't like tree
*/[arena.cpp] PhO 老哥，祝好。
/*
This is my last OI competition.
Glad to code before I've been AFO.
Surprised to see Physics problems in programming problems.
And I'm about to fight for Pho.
Good luck!
By Phi_Bio_Chem on 2024.10.26
*/[detect.cpp] 你大小写打对了吗
//TempTaTion[arena.cpp] 成分没那么复杂
void ciallo(int cia){
if("0d00"=="0721"){
cout<<"Ciallo~";
return;
}
return;
}
int main(){//if you dont know it, dont do it. go do Problem II.
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
cin>>t;
for(int i=0;i<t;i++){
cout<<1;
}
ciallo(0721);
return 0;
}
/*
Darkest night i confront you here
Such a destiny was not desired
in this place i never wish to see that side of you
and raise different colours from one another
never notice me
never call my name with your voice
Let me forget everything leaving no trace to you
what am i carrying out in this horizon of despair
if its not you i can hurt anyone in the name of justice
your shadow gets in the way of my light
Let me forget everything still moonlight shines on us
broken heart i dont want to find and take a look at
so ill sin more and destroy my thoughts make a mess of my hand
i swear on the darkest night ill end it all
and testify
All that i left is your reminiscence
take me to where you are wont you
and testify
ill show you
curse of justice you dont know
*/[arena.cpp] 你和上面几位是情敌吗
cout << "12" << endl; // I love CCF!!![arena.cpp] 拼写大师 & 祝好
/*
I think I will give up.
I can do this at home instead of in competition.
I can get 100+20=120pts now.
Its not a good point.
Now I can get 100+20+(40)==(160)
160 is helplss.
125? maybe
18mins leter is time to AFO.
Goodbye for my oi life.
I love my oi life,it brought me happiness and made me confident.
I made my best friends by it,we discussed and played together.
But it takes too much time.
The last 10 minutes......
No time to write more.Howerver I love programing for ever.
End at miidle school,restert at university!
Bye!
*/[arena.cpp] 如此 ++
int main()
{
int rp = 114514;
rp++, fout << "rp++";
return 0;
}[color.cpp] 所以我放弃了染色
//freopen("colour.in", "r", stdin);
//freopen("colour.out", "w", stdout);[detect.cpp] CCF · 是真的吗
bool ccf,flag;[arena.cpp] 卡评测机 & 言简意赅
#include <bits/stdc++.h>
using namespace std;
int main () {
freopen ("arena.in", "r", stdin);
freopen ("arena.out", "w", stdout);
while (1) ;
return 0;
}
// fuck CCF[color.cpp] 即兴诗人 1
//"The Colorful Night Faded With Flawless Black."[arena.cpp] 即兴诗人 2
//"In The Arena Of Ours, I Saw Shadow Transcending Humanity."[duel.cpp] 中英文夹杂 & 考场游记
/*
JS-S01359
CSP-S 2024 Diary
It is 14:05 now.
It's the first time for me to sit on the second round of CSP-S.
My target is to get over 100 points.
rp++.
14:36
T1 guess the jielun
*/[detect.cpp] 我 AK 了
//cout<<"I AK CSP-S!!!\nCSP-S2024rp++!!!";[color.cpp] 你游记呢？
/*
JS-S01359
CSP-S 2024 Diary
*/[arena.cpp] 遗憾离场
int main ()
{
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
cout<<"I AK CSP-S!!!!\nhahahahahahaha";
return 0;
}
/*
JS-S01359
CSP-S 2024 Diary
100+20+20+0?
If the score is less than 100,I will AFO
*/[color.cpp] 柚子厨深藏不露
//if (ans != dp[n][n]) cerr << "ciallo~" << endl;[arena.cpp/color.cpp/detect.cpp/duel.cpp] 素质有待降低
//I hate CCF![detect.cpp] 我收回我的评价
int cheat=1,cheat2=1;
vector<int> fuckCCF(1000005,0);[color.cpp/detect.cpp/duel.cpp] 是谁的生日呢。
//20090626[detect.cpp] PhO 老哥有福了
/*
I am a CPHO compititor!
I love physics
wy & chengjiafu &shuyousheng & yebangjiao bless tyc
*/[arena.cpp] 拼尽全力无法战胜
cout<<"This problem is too hard for me,I can not do it.I think I can get a high score in 2024 CSP-S.";
cout<<'\n'<<" ------Mr. Xie";[arena.cpp] 牢大我想你了
cout<<"what can I say?";[arena.cpp/color.cpp/detect.cpp/duel.cpp] bless me
//Good luck CSP-S2 2024
//RP++
//Wel and doowzs blesses me.[color.cpp] 你好呀
// cout << "hello" << endl;[arena.cpp] 我想说的只有一句话。
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << "rp++" << endl;
return 0;
}[detect.cpp] too hard, can't move
cout<<(int)(num*0.618);//Can not solve it. Give a GUESS![arena.cpp] mine8.out
cout<<"WHAT CAN I SAY";[duel.cpp] 笑话大师 1
//Give each of the one million monkeys a keyboard
//and one of them will write a Java program.
//The rest of them will write Perl programs.[detect.cpp] 笑话大师 2
//Why does a Java programmer have eyesight problems?
//Because he can't C#.[color.cpp] 笑话大师 3
//99 bugs in the code
//hunt one down
//toss it around
//101 bugs in the code[duel.cpp] 好运喵
//CSP-S Good luck[duel.cpp] 大型膜拜现场
/*
STO TheSky233 Orz
STO LXGOD Orz
STO rym Orz
STO czx Orz
rp+=inf;
luogu_uid=1038710
STO give me 1= please Orz
*/
//15:16 too vegetable[detect.cpp] 大型膜拜现场重现
/*
STO TheSky233 Orz
STO LXGOD Orz
STO rym Orz
STO czx Orz
rp+=inf;
luogu_uid=1038710
STO give me 1= please Orz
*/[color.cpp] 无穷加无穷等于无穷
/*
STO TheSky233 Orz
STO LXGOD Orz
STO rym Orz
STO czx Orz
rp+=inf;
rp+=inf;
rp+=inf;
rp+=inf;
rp+=inf;
rp+=inf;rp++;
luogu_uid=1038710
STO give me 1= please Orz
*/[arena.cpp] 启动
int YS[100100];//genshin[arena.cpp] 让我去 NOIP 吧，我什么都会做的/ll
/*
STO TheSky233 Orz
STO LXGOD Orz
STO rym Orz
STO czx Orz
(can't remember rym and czx's id)
rp+=inf;
luogu_uid=1038710
STO give me 1= please Orz
STO give me 1= please Orz
STO give me 1= please Orz
STO give me 1= please Orz
STO give me 1= please Orz
STO Let me get to NOIP Orz
STO Let me get to NOIP Orz
STO Let me get to NOIP Orz
STO Let me get to NOIP Orz
STO Let me get to NOIP Orz
Genshin , shutdown(i don't play it)
C++ , start!!!
*/[duel.cpp] 好好好
freopen("duel2.in","r",stdin);
freopen("duel2.out","w",stdout);[duel.cpp] 你好单词
/*Hello CCF! Hello Nfls! Hello word!! */[arena.cpp] 你是不会这题所以故意不打对文件名还是不小心的.jpg
freopen("arean.in","r",stdin);
freopen("arean.out","w",stdout);[arena.cpp] 高斯消元法
/*Hello Hello CCF!
x y z res
| 1 1 1 | 11 |
| 1 0 -1 | 3 |
| 0 -1 1 | 4 |
R2-R1 | 1 1 1 | 11 |
----> | 0 -1 -2 | -8 |
| 0 -1 1 | 4 |
R3-R1 | 1 1 1 | 11 |
-----> | 0 -1 -2 | -8 |
| 0 0 3 | 12 |
R3/3 | 1 1 1 | 11 |
----> | 0 -1 -2 | -8 |
| 0 0 1 | 4 |
R2+2*R3 | 1 1 1 | 11 |
------> | 0 -1 0 | 0 |
| 0 0 1 | 4 |
R2/-1 | 1 1 1 | 11 |
-----> | 0 1 0 | 0 |
| 0 0 1 | 4 |
R1-R3 | 1 1 0 | 7 |
-----> | 0 1 0 | 0 |
| 0 0 1 | 4 |
R1-R2 | 1 0 0 | 7 |
-----> | 0 1 0 | 0 |
| 0 0 1 | 4 |
Result x = 7
-----> y = 0
z = 4
x y z res
| 1 1 1 | 11 |
| 1 0 -1 | 3 |
| 0 -1 1 | 4 |
R2-R1 | 1 1 1 | 11 |
----> | 0 -1 -2 | -8 |
| 0 -1 1 | 4 |
R3-R1 | 1 1 1 | 11 |
-----> | 0 -1 -2 | -8 |
| 0 0 3 | 12 |
R3/3 | 1 1 1 | 11 |
----> | 0 -1 -2 | -8 |
| 0 0 1 | 4 |
R2+2*R3 | 1 1 1 | 11 |
------> | 0 -1 0 | 0 |
| 0 0 1 | 4 |
R2/-1 | 1 1 1 | 11 |
-----> | 0 1 0 | 0 |
| 0 0 1 | 4 |
R1-R3 | 1 1 0 | 7 |
-----> | 0 1 0 | 0 |
| 0 0 1 | 4 |
R1-R2 | 1 0 0 | 7 |
-----> | 0 1 0 | 0 |
| 0 0 1 | 4 |
Result x = 7
-----> y = 0
z = 4
x y z res
| 1 1 1 | 11 |
| 1 0 -1 | 3 |
| 0 -1 1 | 4 |
R2-R1 | 1 1 1 | 11 |
----> | 0 -1 -2 | -8 |
| 0 -1 1 | 4 |
R3-R1 | 1 1 1 | 11 |
-----> | 0 -1 -2 | -8 |
| 0 0 3 | 12 |
R3/3 | 1 1 1 | 11 |
----> | 0 -1 -2 | -8 |
| 0 0 1 | 4 |
R2+2*R3 | 1 1 1 | 11 |
------> | 0 -1 0 | 0 |
| 0 0 1 | 4 |
R2/-1 | 1 1 1 | 11 |
-----> | 0 1 0 | 0 |
| 0 0 1 | 4 |
R1-R3 | 1 1 0 | 7 |
-----> | 0 1 0 | 0 |
| 0 0 1 | 4 |
R1-R2 | 1 0 0 | 7 |
-----> | 0 1 0 | 0 |
| 0 0 1 | 4 |
Result x = 7
-----> y = 0
z = 4
12345678901234567890123456890123456789012345678901234567890123456789012345678901234567890
12345678901234567890123456890123456789012345678901234567890123456789012345678901234567890
12345678901234567890123456890123456789012345678901234567890123456789012345678901234567890
12345678901234567890123456890123456789012345678901234567890123456789012345678901234567890
12345678901234567890123456789012345678901234567
*/[color.cpp] 中文、英文和拼音 1
if(n<=15)//n<=15 时 ke yi bao li jie jue ,may be 20 分【拼音翻译：n<=15 时可以暴力解决】
[color.cpp] 中文、英文和拼音 2
for(int i=0;i<=(1<<n)-1;i++)//0 is red , 1 is blue[color.cpp] 中文、英文和拼音 3 & 大概鹿
else if(fl)//ru guo A li yuan su hu bu xiang tong , cout 0 . ke nen 10 分 , da gai lu mei you 分【拼音翻译：如果 A 里元素互不相同，cout 0.可能 10 分，大概率没有分】
[color.cpp] 中文、英文和拼音 4 & 会吗？
//buhui[color.cpp] 所以我又放弃了染色
// freopen("colour.in", "r", stdin);
//freopen("colour.out", "w", stdout);[detect.cpp] 物理学爱好者
// I love Physics.[arena.cpp/color.cpp/detect.cpp] qwq
int qwq; cin >> qwq; while(qwq--) solve();[arena.cpp] 呜呜呜你也好可爱
void solve()
{
cout << rd() << '\n';
// bu hui zuo 555 QAQ
}[detect.cpp] 做出了一个违背祖宗的决定
//CCF give me 20 points,I'm your son[arena.cpp/color.cpp/detect.cpp/duel.cpp] 小粉兔
#ifndef PKRBT[color.cpp] CCF 保佑你
/*
TODO: duipai
GG, no time to write duipai
CCF bless...
*/[arena.cpp] 期望得分
// GG, expected 76 pts[arena.cpp/color.cpp/detect.cpp/duel.cpp] Jorisy 老师晚上好
// Code by Jorisy. Best Wishes & Good Luck.[arena.cpp] 祝好喵。
// I hope to make it miracle, but no results.
// Sorry, maybe I will get 100+100+50+0.[arena.cpp/color.cpp/detect.cpp/duel.cpp] 你是懂诈骗的
//freopen
//freopen
//freopen
//freopen
//freopen
//freopen luogu uid 772909[duel.cpp] 查询成分 1
/*In Hell We Live,Lament(奉我们存于炼狱之命)-Mili
Limbus Company */[detect.cpp] 查询成分 2
/*Compass(指南针)-Mili
裴阔德号 船长 */[color.cpp] 查询成分 3
/*Fly,My Wings(飞吧，我的翅膀)-Mili
绽放E.G.O.:山茶花 */[detect.cpp] 给 PhO 爷磕头了
vector<pair<int,int>> hbzleft;
/*
Such a easy physics problem (I am a PhOer) qwq
16:15 first answer ok for all cases
*/[duel.cpp] 读不懂你的注释
j[i].bh = 1;//we i gong ji[detect.cpp] 拼音大师 & 乱码大师
//ke wu a ,tu hai shi bu hui zuo ,tao mu ban dou yun xing bu liao aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
/*hdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywqhdsakdsahdsadsahldsahdsafhiqwhfeuqhfoiewqhuiwqryeiywqyrqirewqrewrqewyreywq*/【拼音翻译：可恶啊，题（？）还是不会做，套模板都运行不了】
[arena.cpp/color.cpp] 记录一下
//the first two AC
//the first three in CSP-J AC【以上为完整的选手代码。】
[detect.cpp] 随机说话 1
//perhaps we can make the digit more beautiful by making more and more notes?
//please forgive me but I really can't do this.It is too difficult for me.
//aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa;dsljfakdj;fkasdfjkopifjamklcasdkl/afsdfjkaopr;fj;dlskjfopaid;cjfkdsjpoaf;kdlaeffjri;czairejo;odairejpZ:acfdoijlsfkjmcsdlkhgvoruv
//perhaps we can make the digit more beautiful by making more and more notes?
//please forgive me but I really can't do this.It is too difficult for me.
//aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa;dsljfakdj;fkasdfjkopifjamklcasdkl/afsdfjkaopr;fj;dlskjfopaid;cjfkdsjpoaf;kdlaeffjri;czairejo;odairejpZ:acfdoijlsfkjmcsdlkhgvoruv
//perhaps we can make the digit more beautiful by making more and more notes?
//please forgive me but I really can't do this.It is too difficult for me.
//aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa;dsljfakdj;fkasdfjkopifjamklcasdkl/afsdfjkaopr;fj;dlskjfopaid;cjfkdsjpoaf;kdlaeffjri;czairejo;odairejpZ:acfdoijlsfkjmcsdlkhgvoruv
//perhaps we can make the digit more beautiful by making more and more notes?
//please forgive me but I really can't do this.It is too difficult for me.
//aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa;dsljfakdj;fkasdfjkopifjamklcasdkl/afsdfjkaopr;fj;dlskjfopaid;cjfkdsjpoaf;kdlaeffjri;czairejo;odairejpZ:acfdoijlsfkjmcsdlkhgvoruv[color.cpp] 随机说话 2
//It is an exercise of DP,but it seems I can't finish it successfully...Just do it then^v^
//Fine then,I can't make it!TAT......
//Why cannot you give us a simple question?I only want to get into NOIp......
//Who had I bothered?
//example 2
//Release 20.03 rev 11997 (2020-03-28 13:56:24) gcc 9.3.0 Linux/unicode - 64 bit
//Release 20.03 rev 11997 (2020-03-28 13:56:24) gcc 9.3.0 Linux/unicode - 64 bit
//It is an exercise of DP,obviously,but it seems I can't finish it successfully...Just do it then^v^
//Fine then,I can't make it!TAT......
//Why cannot you give us a simple question?I only want to get into NOIp......
//Who had I bothered?Huh???!!![arena.cpp] 随机说话 3 & archiology
//Aelena or Arena?That's quite a mystery.Arena maybe.
//But perhaps I can achieve my success not in Information Technology,but in archiology instead.
//History too.
//I love history and Information Technology,but I don't no which to choose.
//What should I do??????????????????????????????
//Aelena or Arena?That's quite a mystery.Arena maybe.
//But perhaps I can achieve my success not in Information Technology,but in archiology instead.
//History too.
//I love history and Information Technology,but I don't no which to choose.
//What should I do??????????????????????????????
//Aelena or Arena?That's quite a mystery.Arena maybe.
//But perhaps I can achieve my success not in Information Technology,but in archiology instead.
//History too.
//I love history and Information Technology,but I don't no which to choose.
//What should I do??????????????????????????????
//I will go to wu yi xiang and jiang nan gong yuan soon.
//Yahoo~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//(perhaps I'm a bit of crazy...)(maybe it is true)
//I will go to wu yi xiang and jiang nan gong yuan soon.
//Yahoo~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//(perhaps I'm a bit of crazy...)(maybe it is true)
//I will go to wu yi xiang and jiang nan gong yuan soon.
//Yahoo~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//(perhaps I'm a bit of crazy...)(maybe it is true)
//I will go to wu yi xiang and jiang nan gong yuan soon.
//Yahoo~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//(perhaps I'm a bit of crazy...)(maybe it is true)[duel.cpp] bless 1
//Kawasaki Kagami Bless GCH[detect.cpp] bless 2
//Fu Bingyan Bless GCH[arena.cpp/color.cpp] EMACS 快速指南
/*
* Emacs 快速指南.（查看版权声明请至本文末尾）
【注意：位于【】之间的内容是译注，比如本行，下同。】
Emacs 键盘命令通常包含 CONTROL 键（有时候以 CTRL 或 CTL 来标示）和
META 键（有时候用 EDIT 或 ALT 来标示）。为了避免每次都要写出全名，我们
约定使用下述缩写：
C-<chr> 表示当输入字符 <chr> 时按住 CONTROL 键。
因此 C-f 就表示：按住 CONTROL 键再输入 f。
M-<chr> 表示当输入字符 <chr> 时按住 META（或 EDIT 或 ALT）键。
如果你的键盘上没有 META 、EDIT 或 ALT 键，用下述方法也等效：
先按一下 ESC 键然后放开，再输入 <chr>。我们用 <ESC> 来表示
ESC 键。
重要提示：要退出 Emacs，请用 C-x C-c（两个连续的组合键）。
要退出一个正在运行中的命令，请用 C-g。
下文中左边顶行的“>>”字样用来提示你尝试键盘命令。比如：
*/[arena.cpp] 结束了，谢谢大家。
//freopen
//freopen
//freopen
//freopen//freopen
//freopen
//freopen
//freopen
//freopen
//freopen
//freopen
//freopen
//freopen
//freopen
//freopen
//no thanks