CSP-S 2024 JS 迷惑行为大赏
总览
-
(
\color{red}\texttt{+}\text{xxx} /\color{blue}\texttt{-}\text{xxx} 表明相比去年增加 / 减少的) -
共有 1858(
\color{red}\texttt{+}\text{634} ) 人参赛,共有 4495(\color{red}\texttt{+}\text{2130} ) 份 cpp 代码。- 其中有 6537(
\color{red}\texttt{+}\text{2072} ) 份代码有#include。
- 其中有 6537(
-
共有 6474(
\color{red}\texttt{+}\text{2077} ) 份代码用了using namespace std; -
共有 116(
\color{red}\texttt{+}\text{33} ) 份代码使用了//freopen,其中不乏有一些诈骗,为真正没写文件的人默哀。 -
共有 634(
\color{red}\texttt{+}\text{222} ) 份代码用了#define int long long。 -
有 23(
\color{blue}\texttt{-}\text{16} ) 份代码中有\verb!ccf! 字眼。 -
有 10(
\color{red}\texttt{+}\text{5} ) 份代码写了\verb!mian! ,但是无人因此挂分。 -
有 9(
\color{red}\texttt{+}\text{8} ) 份写了\verb!AKIOI! 。 -
有 5(
\color{red}\texttt{+}\text{3} ) 份代码提到了\verb!fuck! ,期待禁三。 -
有 72 份写了
\verb!114514! 。
个人
JS-S00435 duel.cpp
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int r[100005],cnt[100005];
int main(){
//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
freopen("duel.in","r",stdin);
freopen("duel.out","w",stdout);
...(省略正常代码)
}
疑似去年的 JS-S00282。
JS-S01775 arena.cpp
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int T,a[N],n,m,c[N],k,x0,x1,x2,x3;
int main()
{
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d",a+i);
for(int i=1;i<=m;i++)scanf("%d",c+i);
while(T--)
{
scanf("%d%d%d%d",&x0,&x1,&x2,&x3);
printf("%d\n",((x0+x1+x3-x2)&a[1]%c[0]+x2-a[0])^m);
}
return 0;
}
//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)
JS-S01515 arena.cpp
/*
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!!!
*/
JS-S00695 detect.cpp
#include<bits/stdc++.h>
using namespace std;
int T,n,m,L,V,ans1,ans2;
int d[100005],v[100005],a[100005],x[100005][2],p[100005];
bool G[25][25],chk[25];
int ans[25];
int main(){
freopen("detect.in","r",stdin);
freopen("detect.out","w",stdout);
...(省略正常代码)
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