2024 & 2025 CSP-J/S 代码迷惑行为大赏（JX）

__Groyhj__QwQ · 2025-11-02 10:43:24 · 休闲·娱乐

2024

数据统计

整个江西 CSP-J/S 所有代码共 7.15 MB，其中 J 有 2.70 MB，S 有 4.45 MB。

J 组一共有 948 名选手参加，其中有 925 名选手提交了代码；S 组一共有 497 名选手参加，其中有 495 名选手提交了代码。

bits/stdc++.h

在 J 组中共有 2991 个 bits/stdc++.h，在 S 组中有 1383 个。

freopen

在 J 组中共有 6160 个 freopen，在 S 组中有 3016 个。

//freopen

在 J 组中共有 320 个 //freopen，在 S 组中有 114 个。

freopen(".out","w",stdin)

JX-S00162\duel
JX-J00094\explore
JX-J00094\poker
JX-J00094\sticks
JX-J00170\sticks
JX-J00285\sticks
JX-J00438\sticks
JX-J00850\explore

freopen(".in","w",stdin)

JX-J00270\poker
JX-J00288\sticks
JX-J00459\chain
JX-J00459\poker
JX-J00459\sticks
JX-J00592\explore
JX-J00592\poker
JX-J00941\chain
JX-J00941\poker
JX-J00941\sticks

freopen(".in","r",stdout)

JX-J00850\sticks

freopen(".out","r",stdout)

在 J 组中共有 26 个 freopen(".out","r",stdout)，在 S 组中有 8 个，分别是：

JX-S00195\arena
JX-S00208\color
JX-S00229\arena
JX-S00229\color
JX-S00229\detect
JX-S00229\duel
JX-S00328\detect
JX-S00406\duel

freopen(".in","w",stdout)

JX-S00162\arena
JX-S00162\color
JX-J00198\explore
JX-J00355\explore
JX-J00523\poker
JX-J00718\sticks
JX-J00725\sticks
JX-J00888\explore

,in

JX-S00134\duel
JX-J00058\sticks
JX-J00389\sticks
JX-J00523\chain
JX-J00530\explore
JX-J00672\poker

,out

JX-S00388\color
JX-S00425\detect
JX-S00446\color
JX-J00173\explore
JX-J00173\sticks
JX-J00297\chain
JX-J00297\poker
JX-J00334\chain
JX-J00777\sticks

.ans

JX-S00039\arena
JX-S00039\color
JX-S00039\detect
JX-S00039\duel
JX-S00041\duel
JX-S00173\arena
JX-S00371\duel
JX-J00339\explore
JX-J00339\sticks
JX-J00582\poker
JX-J00582\sticks
JX-J00640\poker
JX-J00640\sticks

#define int long long

在 J 组中共有 42 个 #define int long long，在 S 组中有 123 个。

main

在 J 组中共有 3230 个 main，在 S 组中有 1577 个。

mian

JX-S00438\color
JX-S00438\duel
JX-J00337\explore
JX-J00337\poker
JX-J00383\chain
JX-J00622\explore

csp

在 J 组中共有 25 个 csp，在 S 组中有 21 个。

ccf

在 J 组中共有 2 个 ccf，均在 JX-J00847\chain 中；在 S 组中有 5 个，分别是：

JX-S00332\arena
JX-S00386\arena
JX-S00386\duel
JX-S00405\detect
JX-S00449\color

rp++

在 J 组中共有 13 个 rp++，在 S 组中有 13 个。

ak csp

JX-J00929\explore
JX-J00929\poker
JX-J00929\sticks

ak ioi

JX-S00272\arena
JX-S00272\color
JX-S00272\detect
JX-S00272\duel
JX-J00513\chain
JX-J00513\explore
JX-J00513\poker
JX-J00513\sticks

迷惑行为

以下按准考证字典序排列，如有侵权请联系作者删除，想上的也可以在底下评论。

JX-J00003

explore：读样例大佬。

...
    freopen("explore1.in","r",stdin);
    freopen("explore1.out","w",stdout);
...

JX-J00014

chain：itn大佬，然后自己看吧。

#include<bits/stdc++.h>
using namespace std;
int n,m,ans,x,y,d,k,T;
char a[1010][1010];
int v[1010][1010];
int dx[4]={0,1,0,-1};
itn dy[4]={1,0,-1,0};
node dfs(int i,int j,int f,int step){
    step++;
    if(step==k){
        printf("%d\n",ans);
    }
    int xx=i+dx[f];
    int yy=j+dy[f];
    int p=0;
    if(0<xx&&xx<=n&&0<yy&&yy<=m)p=1;
    if(a[xx][yy]=='.'&&p==1){
        if(v[xx][yy]==0){
            ans++;
            v[xx][yy]=1;
        }
        dfs(xx,yy,f);
    }
    else {
        p=(f+1)%4;
        dfs(i,j,p);
    }

}
int main(){
    cin>>T;
    while(T--){
        scanf("%d%d%d%d%d%d",&n,&m,&k,&x,&y,&d);
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                cin<<a[i][j];
            }
        }
        dfs(x,y,d);
    }
    return 0;
}

JX-J00022

chain：运气牢大。

#include <bits/stdc++.h>
#include <time.h>
/*       @-----@
         [#####]
          #####
          #####
          #####
          #####
          #####
          #####
@        @#####@        @
[#######################]
[#LUCK WITH YOU FOREVER#]
[#######################]
@        @#####@        @
          #####
          #####
          #####
          #####
          #####
          #####
         [#####]
         @-----@
         RiP ++
*/
using namespace std;
int t;
int main()
{
    freopen("chain.in", "r", stdin);
    freopen("chain.out", "w", stdout);
    cin >> t;
    srand(time(NULL));
    while(t --)
    {
        int n, k, q;
        int l[100005], s[200005];
        int r[100005], c[100005];
        cin >> n >> k >> q;
        for (int i = 1; i <= n; i ++)
        {
            cin >> l[i];
            for (int j = 1; j <= l[i]; j ++)
            {
                cin >> s[i];
            }
        }
        for (int i = 1; i <= q; i ++)
            cin >> r[i] >> c[i];
        for (int i = 1; i <= q; i ++)
        {
            int ra = random() % 100;//luck ++, rp ++
            if (ra >= 80.114514)
                cout << 1 << endl;
            else
                cout << 0 << endl;  
        }
    }
    return 0;
}

sticks：.out大佬。

JX-J00032

explore：

...
/*
wo bu hui yong scanf a (
qu tong bu de cin you bu tai bao xian
xi wang bu yao yin wei zhe ge bao ling ba :)

*/

翻译：

我不会用 scanf 啊（
去同步的 cin 又不太保险
希望不要因为这个爆零吧 :)

poker：

...
/*
zhe zen mo mei you zhong wen shu ru fa /fn/fn/fn/fn/fn

byd

*/

翻译：

这怎么没有中文输入法 /fn/fn/fn/fn/fn

byd

sticks：

...
/*
zhe ti wo hao xiang jian guo
dan shi wang le zen mo xie :(

wei shen mo shang yi ti wo bu yong while(t--) ne? (

qian mian wang le 
zhong jian wang le
hou mian wang le

xi xi fu mei ma le 

/fn/fn/fn

*/

翻译：

这题我好像见过
但是忘了怎么写 :(
为什么上一题我不用 while(t--) 呢？ (
前面忘了
中间忘了
后面忘了
CCF 没 M 了
/fn/fn/fn

JX-J00059

sticks：

...
//first,the number whose need of sticks is more than the real number has the priority;
//we can easily found the priority of all the numbers;the queue is(real number)2,1,3,4,5,6,8,9,7;
...

JX-J00073

chain：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;

int main(){
    freopen("chain.in","r",stdin);
    freopen("chain.out","w",stdout);
    //666zhegerushiguiwolandexiele

    return 0;
}

JX-J00201

chain/explore/poker/sticks：

/*priority vector greater resice insert reverse erase std::ios::sync_with_stdio(false)*/
...

JX-J00480

chain/explore/poker/sticks：

...
//rp++
//luogu:jiangyunuo

JX-J00549

chain：精神失常。

#include<bits/stdc++.h>
using namespace std;
int main(){
    freopen("chain.in","r",stdin);
    freopen("chain.out","w",stdout);
    /*
    Although the chain is a the most difficult
    but it is truly the best of all.The game is a
    good game,but I can not do it.So,do it ge dan.
    HAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHA
    HAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHA
    HAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHA
    HAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHA
    HAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHA
    HAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHA!!!
    */
    fclose(stdin);
    fclose(stdout);
    return 0;
}

JX-J00570

poker：

...
//8:40 the contest problems weren't coming
//8:50 the same as 8:40
//8:51 downloading the problem
//9:00 failed
//9:01 opened
//9:08 T1 finished
//9:34 T2 finished(has somthing wrong with my brain)
//9:35 find T3 is the problem that I have solved!!!
//10:06 T3 finished
//10:15 T4 failed, the problem is too hard
//the contest changed the ending time to 12:30
//11:48 finished
...

JX-J00943

chain：

//  Luogu: 706607
...
/*
wei le ni chang xia qu
LuoTianyi / COP

wei le ni chang xia qu
zhi dao huang wu
wei le ni chang xia qu
zhi dao ...

*/

explore：

//  Luogu: 706607
...
/*
I love LuoTianyi
*/

poker：

//  Luogu: 706607
...
/*
shang shang gang
LuoTianyi / ilem

ping fan cheng shi
ping dan gu shi
ping jing bu cheng shi
guang ying tai duan 
bei shang tai qian
bu gou niang cheng jiu 
ze ze ping ping 
jiao bu cong cong 
chun xia you qiu dong
gu shi jiang gei wo
wo men xie shou ge
zhe ying gai hui you yong
ni jiang wo chang ni lai he
shang shang gang shang shang gang
qing ting wo da shen chang
chang feng shuang  chang chun guang
chang shi guang chang chen zhang
bu gu dan bu gu dan
yin wei wo men dou yi yang
bu zuo chi bang ye zuo ge jian bang
*/

sticks：

//  Luogu: 706607
...
/*
Lao, wo qing ai de lao
ni zen me jiu shi ge zhi pian ren a
jiu, wo bu neng jie shou
ta zhen de hao hui chang
*/

JX-S00005

duel：

...
/*    -----------
     (@#########@)
  (@###############@)
  @#################@
  @#######@@@#######@
  @#####@R.I.P@#####@
  @#######@@@#######@
  @@ALYMINE FOREVER@@
  @#######@@@#######@
  @#################@
 *@#################@*
 *@#################@*
~~...---... ...---...~~
 */

JX-S00015

无缩进大佬。

arena：

//If I am SSHed, I don't want my code can be used by Karry5307 directly.
#include<bits/stdc++.h>
#define int long long
#define N 100005
#define M 17
using namespace std;
inline int r(){int x;cin>>x;return x;}
inline void w(int x){cout<<x<<'\n';}
inline void W(int x){cout<<x<<' ';}
bool d[M][M];
int init[M];
int x[4];
int a[N];
int c[N];
signed main(){
ios::sync_with_stdio(0),cin.tie(0);
freopen("arena.in","r",stdin);
freopen("arena.out","w",stdout);
init[0]=1;
for(int i=1;i<M;i++)init[i]=init[i-1]*2;
int n=r(),m=r(),k;
for(int i=1;;i++)if(init[i]>=n){k=i;break;}
for(int i=1;i<=n;i++)a[i]=r();
for(int i=1;i<=m;i++)c[i]=r();
for(int i=k;i;i--)
for(int j=1;j<=init[i-1];j++){
char c;
cin>>c;
d[i][j]=(c=='1');
}
int t=r();
while(t--){
int ans=0;
for(int i=0;i<4;i++)x[i]=r();
for(int i=1;i<=n;i++)a[i]^=x[i%4];
for(int i=1;i<=m;i++){
for(int j=1;;j++)if(init[j]>=c[i]){k=j;break;}
for(int j=k;j;j--){
}
}
for(int i=1;i<=n;i++)a[i]^=x[i%4];
}
return 0;
}
// Oh no, I don't have time to finish this problem!

color：

// If I am SSHed, I don't want my code can be used by Karry5307 directly.
#include<bits/stdc++.h>
#define int long long
#define N 200005
using namespace std;
inline int r(){int x;cin>>x;return x;}
inline void w(int x){cout<<x<<'\n';}
inline void W(int x){cout<<x<<' ';}
int n,ans;
bool f[N];
int a[N];
inline void dfs(int x){
if(x>n){
int thoth=0;
for(int i=1;i<=n;i++){
bool flag=0;
for(int j=i-1;j;j--)if(f[j]==f[i]){flag=(a[j]==a[i]);break;}
thoth+=flag*a[i];
}
ans=max(ans,thoth);
return;
}
f[x]=0;
dfs(x+1);
f[x]=1;
dfs(x+1);
}
signed main(){
ios::sync_with_stdio(0),cin.tie(0);
freopen("color.in","r",stdin);
freopen("color.out","w",stdout);
int t=r();
while(t--){
n=r(),ans=0;
for(int i=1;i<=n;i++)a[i]=r();
dfs(1);
w(ans);
}
return 0;
}
// This idea just need 4×10^13 years to pass n<=10^2 and 4×10^585 years to pass n<=2,000!I am genius!

detect：

#include<bits/stdc++.h>
#define int long long
#define N 100005
using namespace std;
inline int r(){int x;cin>>x;return x;}
inline void w(int x){cout<<x<<'\n';}
inline void W(int x){cout<<x<<' ';}
vector<int>point;
map<int,int>mp;
struct car{
int d,v,a;
}a[N];
int n,m,L,V,ans;
pair<int,int>line[N];
bool f[N];
int p[N];
int sum[N];
inline void solve1(){
bool flag=0;
int thoth=0;
for(int i=1;i<=n;i++)if(a[i].v>V&&p[m]>=a[i].d)thoth++,flag=1;
W(thoth),w(m-flag);
}
inline void solve2(){
bool flag=0;
int thoth=0;
for(int i=1;i<=n;i++)if(a[i].d<=p[m]&&sqrt(a[i].v*a[i].v+2*a[i].a*(p[m]-a[i].d))*1.0>V*1.0)thoth++,flag=1;
W(thoth),w(m-flag);
}
inline void dfs(int x,int thoth){
if(x>m){
int tot=0;
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(f[j]&&a[i].d<=p[j]&&sqrt(a[i].v*a[i].v+2*a[i].a*(p[j]-a[i].d))*1.0>V*1.0){tot++;break;}
if(tot==thoth){
tot=0;
for(int i=1;i<=m;i++)tot+=!f[i];
ans=max(ans,tot);
}
return;
}
f[x]=0,dfs(x+1,thoth),f[x]=1,dfs(x+1,thoth);
}
inline void solve3(){
int thoth=0;
ans=0;
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(a[i].d<=p[j]&&sqrt(a[i].v*a[i].v+2*a[i].a*(p[j]-a[i].d))*1.0>V*1.0){thoth++;break;}
W(thoth),dfs(1,thoth),w(ans);
}
// inline void solve4(){
// int thoth=0;
// for(int i=1;i<=n;i++){
// if(!a[i].a&&a[i].v>V&&a[p].d<=p[m])line[++thoth]=make_pair(lower_bound(p+1,p+m+1,a[i].d)-p,m),v.push_back(lower_bound(p+1,p+m+1,a[i].d)-p),v.push_back(m);
// else if(a[i].a>0&&sqrt(a[i].v*a[i].v+2*a[i].a*(p[m]-a[i].d))*1.0>V*1.0)line[++thoth]=make_pair(lower_bound(p+1,p+m+1,(V*V-a[i].v*a[i].v)/2/a[i].a)+a[i].d)-p,m),v.push_back(lower_bound(p+1,p+m+1,(V*V-a[i].v*a[i].v)/2/a[i].a)+a[i].d)-p),v.push_back(m);
// else if(a[i].a<0&&a[i].v>V&&a[i].d<=p[m])line[++thoth]=make_pair(lower_bound(p+1,p+m+1,a[i].d)-p,lower_bound(p+1,p+m+1,(V*V-a[i].v*a[i].v)/2/a[i].a)+a[i].d)-p),v.push_back(lower_bound(p+1,p+m+1,a[i].d)-p),v.push_back(lower_bound(p+1,p+m+1,(V*V-a[i].v*a[i].v)/2/a[i].a)+a[i].d)-p);
// }
// sort(v.begin,v.end());
// int tot=unique(v.begin(),v.end())-v;
// for(int i=1;i<=tot;i++)mp[v[i-1]]=i;
// for(int i=1;i<=thoth;i++)sum[line[i].first]++,sum[line[i].second+1]--;
// for(int i=1;i<N;i++)sum[i]+=sum[i-1];
// for(int i=1;i<=thoth;i++){
// int maxx=0,rk;
// for(int j=line[i].first;j<=line[i].second;j++)if(sum[j]>maxx)maxx=sum[j],rk=j;
// if(maxx)
// }
// }
signed main(){
ios::sync_with_stdio(0),cin.tie(0);
freopen("detect.in","r",stdin);
freopen("detect.out","w",stdout);
int t=r();
while(t--){
bool flag1=1,flag2=1,flag3=1;
n=r(),m=r(),L=r(),V=r();
for(int i=1;i<=n;i++){
a[i].d=r(),a[i].v=r(),a[i].a=r();
if(a[i].a)flag1=0;
if(a[i].a<0)flag2=0;
if(a[i].a>0)flag3=0;
}
for(int i=1;i<=m;i++)p[i]=r();
sort(p+1,p+m+1);
if(flag1)solve1();
else if(flag2)solve2();
else if(m<=20)solve3();
// else if(m<=3000)solve4();
}
return 0;
}
// Oh no, I don't have time to finish this problem!

JX-S00094

arena/color/detect/duel：

/*
    Author : Sparkle_ZH & Spark1037
    Right OutPut ! & Accepted !
*/
...

JX-S00114

arena/color/detect/duel：

/*priority vector greater resize reverse insert erase*/
...

JX-S00136

arena：

...
/*
     * NOI Every Year (From Computer's Background)
     * 30th 2013 Chengdu
     * 31st 2014 Shenzhen
     * 32nd 2015 Hangzhou
     * 33rd 2016 Mianyang
     * 34th 2017 Shao#xing
     * 35th 2018 #
     * 36th 2019 Guangzhou
     * 37th 2020 #
     * 38th 2021 #
     * #:There is no word or the word is too small so that I can't kown it claerly. 
    */
...

JX-S00185

color/detect/duel：

...
    // Right here I sing a song for you
    // I cheer for bilibili for you

    // ni xing zhong hao han de yu zhou
    // shan shuo zhe ming wei meng de xing qiu

    // Luogu@zaochen, QQ@2633941738

    // wuwu xue xiao pai zhao you bu dai wo
    // /ll
...

JX-S00249

arena：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    // I cannot say anymore.
    // Connector & Unattainable Sun Day
    // Make it Attainable.

    // See U never.
    return 0;
}

JX-S00259

arena/color/detect/duel：

...
//rp++
//luogu:jiangyunuo

JX-S00298

color/detect/duel：

...
/*
NOIP 2024 RP ++
        --DZDdzd
*/

JX-S00303

duel：

...
//14:37 the problem was coming but <<  8min left  >>
//14:40 failed
//14:45 downloading
//14:51 nearly failed
//14:55 see the problem!!!
//15:04 T1 finished
//16:49 T2 60pts
//16:58 T3 20pts
//17:30 T4 failed
...

JX-S00326

arena：

#define yuanshen <bits/stdc++.h>
#define Girl using
#define Band namespace
#define Cry std
#define play int
#define maimai main
#define ALL return
#define PERFECT 0

#include yuanshen
Girl Band Cry;

play maimai(){
    //freopen("aziyi.in","r",stdin);
    //freopen("aziyi.out","w",stdout);
    //a mi nuo si

    for(int i=1;i<=101.0000;i++){
        break;break;break;
    }

    ALL PERFECT;
}
/*
bu hui xie le,wo sui bian xie dian
di yi ti hao jian dan(
hou mian de ti wo dou zai pian fen,rp++

shuo qi lai zuo tian wan shang chu qin de shi hou da dao bi dian,
jie guo zui hou yi ba mei bao cun ji zi jiu guan le
(ni de zhang hao mei you zheng chang deng chu)
(qing yu 15 fen zhong hou zai ci deng lu)
wo gang tui de fen a!!!!!
mei shi wo dai hui er jiu qu chu qin
ma shang jiu qu
*/

JX-S00364

arena/detect/duel：

/*
 * a.cpp
 * 
 * Copyright 2024 NOI <noi@G-08-D03>
 * 
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 * 
 * 
 */
#include<bits/stdc++.h>
using namespace std;
int main(){
    /*freopen("","r",stdin)
     *freopen("","w",stdout)
     *fclose(stdin)
     *fclose(stdout)
     */
     return 0;
    }

JX-S00386

arena：

...
//Finally I Will join The CCF
//And Make A Question That The Answer Is "No"!

color：

...
//Then I Can Go To TsingHua Uni ^-^
//And Find My Way To Learn OI...

detect：

...
//Please All " Cout << "No\n" "!
//Then I Can Get Extra Scores!

duel：

...
// I Love U CCF!
// Please Give Me More Scores!

JX-S00405

detect：

...
/*
CCF Ni Chu De Shen Me La Ji Da Mo Ni TAMDE Wo Da le 1 kun Hours Dou Mei Guo Yangli 
*/

JX-S00433

duel：

#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
//test data

/*
10
136 136 136 2417 136 136 2417 136 136 136
*/

int n,a[N],cnt;
bool l[N],f[N];
int b[N],fb[N],live;
//l dai biao shi fou tui chu
//f dai biao shi fou gong ji guo

bool cmp(int a1,int a2){
    return a1<a2;
}

//x:jian shu y:bei jian shu
void cut(int x,int y){
    if(x <= y) return;

//    if(fb[x] == 0) cut(x+1,y);
//    if(b[y] == 0) cut(x,y+1);

    if( fb[x] == b[y] ){
        live-=fb[x];
        b[y]=0;
        fb[y]=0;
        fb[x]=0;
        return;
    }

    if(fb[x] > b[y]){
        live-=b[y];
        fb[x]-=b[y];
        fb[y]=0;
        b[y]=0;
        //cut(x,y+1);
    }

    if(fb[x] < b[y]){
        live-=fb[x];
        b[y]-=fb[x];
        fb[x]=0;
        //cut(x+1,y);
    }

    return;
}

int main(){
//don't forget to delete the "//" !!!!!!!!!!!!!!

    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);

    cin>>n;
    live=n;

    for(int i=1;i<=n;i++){
        cin>>a[i];
        l[i]=1;
        f[i]=1;
    }

    sort(a+1,a+1+n,cmp);

//    for(int i=1;i<=n;i++){
//        cout<<a[i]<<endl;
//    }

    for(int i=1;i<=n;i++){

        if(a[i] > a[i-1]){
            cnt++;
            b[cnt]++;
            fb[cnt]++;
        }

        else if(a[i] == a[i-1]){
            b[cnt]++;
            fb[cnt]++;
        }

    }

    for(int i=1;i<=cnt;i++){
        //cout<<b[i]<<endl;
    }

    for(int i=1;i<=cnt;i++){
        for(int j=i+1;j<=cnt;j++){
            cut(j,i);
        }
    }

    cout<<live;
    return 0;

    //♿I want to play maimaiDX♿
    //♿♿♿♿♿♿♿♿♿♿♿♿♿
}

JX-S00439

detect：AFOer。

...
/*
      AFO
3 years for CSP
1 year for NOIP
 Then ...... ?
 Maybe physics
 Maybe college
     Anyway
     Thanks
       OI
*/

JX-S00449

duel：

...
//cong qian you yi ge mu qin yao si le ,ta lin zhong qian gao su
//ta de nv er men shei neng yong 1000 yuan mai dong xi tian man zheng ge
//wu zi ,shei jiu neng ji cheng ta de yi chan.da nv er mai le yi dui mu chai
//dan shi zhi tian man le ban ge wu zi.er nv er mai le yi bai gen la zhu,
//mu qin shan le ta yi ba zhang : ni zhei ge zhi hui chao xi tong hua gu shi
//de jia huo .san nv er mai le yi fu hmh&zyt de xing zhuan nv tong ben zi,
//yu shi mu qin he nv er men bian yi qi chong man le zheng ge wu zi.

JX-S00461

color：

...
/*
O(nlogn)?idk
*/
...

detect：

...
/*
4e6 io,it's so evil
I want to trust the speed,but i'm not
i don't want to write fread
*/
...

duel：

...
/*
meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~meow~
*/
...

JX-S00490

arena/detect/duel：

...
/*
zenme kaikao 20min le haimei nadao juanzi?
zheshi zai gansha?
yaoshi kaoshi shijian buyanchang
jinnian huojiang chengwei zui nitian de yinian
*/
/*
zuowei zuihou yici canjia csp-s,zheshi wode di 6 ci csp.
buguan zenmeyang,neng fahui chu dangshi nage jiangxi duizhang yiban de fengcai jiu yijing henbucuo le 
zongzhi jinli jiuhao
heyiqian yiyang,woyehuizaizheli xiexia yixie xiangyao ganxiede ren de mingzi 
1. Jingyi Guo,wode zuihaode pengyou,zaiwo xinli zuikeai de nvhaizi,jiyule wo henduo henduo guli,fangzai ganxie de diyiwei
2. Zihua Zeng,zuowei cengjing  noi cu de xuezhang,yebangle wo feichangduo,yuanyi qinting wo henduohenduo de fannao bingqie hui guli wo ,suishuo youdeshihou youdianhaoxiao,danshi zhendeshi henhaode ren,paizai dierwei
3. Runze Lai ,Zekai Liao ,zuowei dangqian ganzhou zuiqiangdade liangge gaoyi xuanshou ,meitian peiwo liaotian ye gielewo hendade bangzhu,tamen binglie paizai disanwei.
4. Zhiyuan Lai,zuowei liangnianqian de noi ag,lao dadangle,buyong shuo nameduo
5. minilong,fjy666,zxc deng guanger de haopengyou men ,suishuo women xiangchude shijian bingbushi henchang buguo ye you yiqixueguo deshijian.
zuowei noi2024 de jiangxi shengdui duizhang zuihou que noi cu.
xiwang zuihouyici ,zai shanyao yici ba .
final csp contest ,by recollector.
Yangfei Long.
*/

color：

...
/*
1h40min 300

nitianchutiren
*/
/*
zenme kaikao 20min le haimei nadao juanzi?
zheshi zai gansha?
yaoshi kaoshi shijian buyanchang
jinnian huojiang chengwei zui nitian de yinian
*/
/*
zuowei zuihou yici canjia csp-s,zheshi wode di 6 ci csp.
buguan zenmeyang,neng fahui chu dangshi nage jiangxi duizhang yiban de fengcai jiu yijing henbucuo le 
zongzhi jinli jiuhao
heyiqian yiyang,woyehuizaizheli xiexia yixie xiangyao ganxiede ren de mingzi 
1. Jingyi Guo,wode zuihaode pengyou,zaiwo xinli zuikeai de nvhaizi,jiyule wo henduo henduo guli,fangzai ganxie de diyiwei
2. Zihua Zeng,zuowei cengjing  noi cu de xuezhang,yebangle wo feichangduo,yuanyi qinting wo henduohenduo de fannao bingqie hui guli wo ,suishuo youdeshihou youdianhaoxiao,danshi zhendeshi henhaode ren,paizai dierwei
3. Runze Lai ,Zekai Liao ,zuowei dangqian ganzhou zuiqiangdade liangge gaoyi xuanshou ,meitian peiwo liaotian ye gielewo hendade bangzhu,tamen binglie paizai disanwei.
4. Zhiyuan Lai,zuowei liangnianqian de noi ag,lao dadangle,buyong shuo nameduo
5. minilong,fjy666,zxc deng guanger de haopengyou men ,suishuo women xiangchude shijian bingbushi henchang buguo ye you yiqixueguo deshijian.
zuowei noi2024 de jiangxi shengdui duizhang zuihou que noi cu.
xiwang zuihouyici ,zai shanyao yici ba .
final csp contest ,by recollector.
Yangfei Long.
*/

JX-S00496

color/detect：

/*Life is too long to end at a grave.*/
#include<bits/stdc++.h>
#define N 110
#define M ?
#define endl '\n'
#define I_love_Furina return
#define forever 0
#define foreverr 1
#define ull unsigned long long
#define db double
#define ldb long double
#define PII pair<int,int>
#define fi first
#define se second 
#define mk make_pair
#define int long long
...

duel：

/*Life is too long to end at a grave.*/
/*
I'm ___Furina___, and this is my last chance to join CSP-S during my OI life.

4.5 years went by. It's too long.

I love Furina !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
*/
...

2025

目前只有 S 组。

数据统计

整个江西 CSP-J/S 所有代码共 ，其中 J 有 ，S 有 1.98 MB，较去年显著下降。

J 组一共有 名选手参加，其中有 名选手提交了代码；S 组一共有 566 名选手参加，其中有 名选手提交了代码。

bits/stdc++.h

在 J 组中共有 个 bits/stdc++.h，在 S 组中有 1783 个。

freopen

在 J 组中共有 个 freopen，在 S 组中有 3855 个。

//freopen

在 J 组中共有 个 //freopen，在 S 组中有 个。

freopen(".out","w",stdin)

freopen(".in","w",stdin)

freopen(".in","r",stdout)

freopen(".out","r",stdout)

在 J 组中共有 个 freopen(".out","r",stdout)，在 S 组中有 个，分别是：

freopen(".in","w",stdout)

,in

,out

.ans

#define int long long

在 J 组中共有 个 #define int long long，在 S 组中有 个。

main

在 J 组中共有 个 main，在 S 组中有 个。

mian

csp

在 J 组中共有 个 csp，在 S 组中有 个。

ccf

在 J 组中共有 个 ccf，均在 `` 中；在 S 组中有 个，分别是：

rp++

在 J 组中共有 个 rp++，在 S 组中有 个。

ak csp

ak ioi