依据消息人士透露的 CCF（Code Cypher Foundation） CSP-S（Code Securely Protected-Senior） 第二轮代码，现将所有和标准写法不同的代码整理如下。

为方便自行查找，先将格式列举如下：

example

regex example

114 files, 514 results

...

正文开始

//freopen 人

regex //freopen\("[^/"]+",

57 files, 96 results

freopen 数据人

regex \sfreopen\("[a-z]+[0-9]\.[a-z]+"

60 files, 78 results

RP++ 人

regex RP\+\+

29 files, 62 results

来看一看 BJ-S00228/color：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
void print(__int128 x,bool f=true){
    if(x>1145141919810){cout<<"INF";return;}
    if(x==0&&f)cout<<0;
    if(x==0)return;
    int t=x%10;
    print(x/10,false);
    cout<<t;
}
ll get_cnt(__int128 x){
    if(!x)return 1;
    int ans=0;
    while(x)ans++,x/=10;
    return ans;
}
ll get_1st(__int128 x){
    if(!x)return 1;
    int ans=0;
    while(x)ans=x%10,x/=10;
    return ans;
}
int main(){
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    //ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    srand(time(0));

    string s;
    cout<<"Your name:";cin>>s;

    //luogu:533708
    getchar();
    __int128 Bright12077_RP=0;
    if(s=="1")s="Bright12077",Bright12077_RP=1145141919000;
    while(true){
        cout<<"\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n";
        if(Bright12077_RP>1145141919810){
            cout<<"**************************\n";
            cout<<"*  Achievement:RP+=inf!  *\n";
            cout<<"*    RP>1145141919810    *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>114514191981){
            cout<<"**************************\n";
            cout<<"*Achievement:RP+=Tree(3)!*\n";
            cout<<"*    RP>114514191981     *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>11451419198){
            cout<<"**************************\n";
            cout<<"* Achievement:RP+=G(64)! *\n";
            cout<<"*     RP>11451419198     *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>1145141919){
            cout<<"**************************\n";
            cout<<"* Achievement:RP+=G(63)! *\n";
            cout<<"*     RP>1145141919      *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>114514191){
            cout<<"**************************\n";
            cout<<"*Achievmnt:RP+=10^10^10)!*\n";
            cout<<"*      RP>114514191      *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>11451419){
            cout<<"**************************\n";
            cout<<"*Achievement:RP+=10^100! *\n";
            cout<<"*      RP>11451419       *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>1145141){
            cout<<"**************************\n";
            cout<<"*Achvmt:RP+=4294964266ll!*\n";
            cout<<"*       RP>1145141       *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>114514){
            cout<<"**************************\n";
            cout<<"* Achievement:  AK CTSC! *\n";
            cout<<"*       RP>114514        *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>11451){
            cout<<"**************************\n";
            cout<<"*  Achievement: AK IOI!  *\n";
            cout<<"*        RP>11451        *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>1145){
            cout<<"**************************\n";
            cout<<"*  Achievement: AK NOI!  *\n";
            cout<<"*        RP>1145         *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>114){
            cout<<"**************************\n";
            cout<<"*  Achievement: AK CSP!  *\n";
            cout<<"*         RP>114         *\n";
            cout<<"**************************\n";
        }else if(Bright12077_RP>11){
            cout<<"**************************\n";
            cout<<"* Achievement: AK DIV.4! *\n";
            cout<<"*          RP>11         *\n";
            cout<<"**************************\n";
        }
        cout<<"《Bright12077's 电子木鱼模拟器——RP++》\n你可以不断按下Enter键以增加RP，增加的RP值全看你的RP！\n"<<s<<"'s RP=";print(Bright12077_RP);
        char c=getchar();
        if(c!='\n')return 0;
        Bright12077_RP+=rand()%(get_cnt(Bright12077_RP)*get_cnt(Bright12077_RP)*get_cnt(Bright12077_RP)*get_cnt(Bright12077_RP)*get_cnt(Bright12077_RP)*get_cnt(Bright12077_RP)\
                                *(rand()%10+10)*get_1st(Bright12077_RP));
    }
    return 0;
}

文明人

regex [^a-zA-Z](SB|f.ck)[^a-zA-Z]

2 files, 13 results

另外 BJ-00390/arena：

#include<bits/stdc++.h>
using namespace std;
int main(){
    freopen("arena.in","r",stdin);
    freopen("arena.out","w",stdout);
    cout << "hello world!";
    //my name is Dali Hang.I almost believe it if I didn't pass the csp-s openning test;
    //  AS A STUDENT,it's very important for us to learn english well.
    // actually i had problems in remembering english words and i felt quite sad.
    //i asked my teacher for help and she told me: shut the f**k up u son of a b***h :(
    fclose(stdin);
    fclose(stdout);
    return 0;
}

CCF 人

regex [^a-zA-Z]ccf

2 files, 5 results

来看看 BJ-S00458/arena：

1.CSP-JS第二轮时，各省考点必须统一使用NOI报名系统规定的准考证和准考证号。
2.CSP-JS第二轮时，认证者须同时携带个人有效身份证件、CSP准考证入场。入座后，将个人证件及准考证放置在桌子上，供监考核查。监考需核对认证者本人、姓名、性别、学籍学校、证件号、照片等信息是否一致相符。如有不实，视为替考，CSP-JS各省总负责人可取消认证者参加资格，且从次年算起被禁赛三年。
3.认证者进入考场时，只许携带笔、橡皮等非电子文具入场。禁止携带任何电子产品或机器设备入场，无存储功能的手表除外；手机（关机）、U盘或移动硬盘、键盘、鼠标、闹钟、计算器、书籍、草稿纸及背包等物品必须存放在考场外。监考人员须尽职告知提醒，并在考前进行认真详细的清理和检查。如有认证者违规带入的，一经发现，监考人员必须及时处理，并根据情节报请CSP-JS各省总负责人直至取消认证者参加资格。
4.认证开始15分钟后，认证者不得进入考场，以缺考处理；除去洗手间外，证者在认证期间，全程不能早退，必须在认证正式结束后，统一离场。
5.认证者进入考场后，在认证正式开始前，禁止操作机器、使用鼠标键盘等设备。
6.在认证过程中，考点各考场统一提供草稿纸（A4打印纸）。草稿纸不足时，认证者可举手向监考示意并索要。
7.认证期间，如出现系统死机、崩溃或硬件故障的情况，认证者需立即举手向监考求助；如经监考组技术人员确认非认证者责任，认证者可获得加时补偿。
8.认证期间，如有认证者相互讨论、使用网络、利用各种方式拷贝或传递信息等违反考场纪律的，涉事认证者均可被立刻取消参赛资格，并从次年算起被禁赛三年。
9.认证期间，认证者在去洗手间前举手向监考示意，由志愿者带领前往。
10.认证结束后，认证者应立即停止答题、不要关闭计算机、迅速且有序地离开考场，加时认证者除外。认证者离开后禁止在考场外逗留或返回考场。如有认证者违反，成绩以零分记。加时认证者在宣布加时结束后应遵循相关规定迅速离场。
11.根据CCF全国统一要求，今年第二轮机试数据公示流程发生如下变化：
（1）机试结束后，将在源程序收集核对后在NOI北京教练群和报名系统公示加密的压缩文件和MD5码；
注：加密的压缩文件可以查看选手答案的目录结构、源代码文件信息等（文件名、字节数等）。
（2）CCF初评成绩发布后，将再次公示同一个加密的压缩文件、MD5码和解压密码。已默写，看在我实力的分上给我过了呗，谢谢

AFO 人

regex [^a-zA-Z]AFO[^a-zA-Z]

6 files, 27 results

来看看 BJ-S00845/*：

#include <iostream>
#include <ctime>
using namespace std;

int main()
{
    system("reboot");
    cout << "I'm going to AFO" << endl;
    cout << "Are you going to AFO?" << endl;
    cout << "(Y/N)" << endl;
    char a;
    bool afo;
    cin >> a;
    if(a=='Y'){
        afo=true;
    }else if(a=='N'){
        afo=false;
    }else{
        cout << "NI SHUO SHA"<<endl;
        main();
    }
    if(afo==true){
        cout << "me too!"<<endl;
    }else{
        cout << "so are you going to AK?"<<endl;
        bool ak;
        char f;
        cout << "(Y/N)"<<endl;
        cin>>f;
        if(f=='Y'){
            ak==true;
        }else{
            ak==false;
        }
        if(ak==false){
            cout<<"okay,good luck";
        }else{
            cout<<"however,I'm going to!";
        }
    }

    main();
    return 0;
}

homo 人

regex (114514|1919810)

61 files, 165 results

没写主函数人

regex main

5903-5811=92 files

#define int long long 人

regex #define int long long

435 files, 438 results

输出数据人

regex cout<<"?[0-9]+

635 files, 1566 results

int mian 人

regex mian

14 files, 25 results

来看看 BJ-S00556/arena：

#include<bits/stdc++.h>
#include<detect>.out
using namespace()
int mian()
{
printf(detect.out"5\n19\n7\n1");
}

hello world 人

regex hello world

7 files, 7 results

诈骗人

BJ-S00559/color

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb emplace_back
#define F(n) for(int i = 1; i <= n; i++)
#define Fi(i, n) for(int i = 1; i <= n; i++)
#define Fx(i, n) for(int i = n; i >= 1; i--)
#define Fn(i, l, r) for(int i = l; i <= r; i++)
#define Fnx(i, l, r) for(int i = r; i >= l; i--)
int T, n, a[200005];
int dp[2][2][200005];
void solve(){
    cin >> n;
    F(n) cin >> a[i];
    memset(dp, 0, sizeof(dp));
    F(n){
        dp[i%2][0][i-1] = 0;
        dp[i%2][1][i-1] = 0;
        Fi(j, i-2){
            dp[i%2][0][j] = dp[(i-1)%2][0][j] + (int)(a[i] == a[i-1])*a[i];
            dp[i%2][0][i-1] = max(dp[i%2][0][i-1], dp[(i-1)%2][1][j] + (int)(a[i] == a[j])*a[i]);
            dp[i%2][1][j] = dp[(i-1)%2][1][j] + (int)(a[i] == a[i-1])*a[i];
            dp[i%2][1][i-1] = max(dp[i%2][1][i-1], dp[(i-1)%2][0][j] + (int)(a[i] == a[j])*a[i]);
        }
    }
    int ans = 0;
    F(n-1){
        ans = max({ans, dp[n%2][0][i], dp[n%2][1][i]});
    }
    cout << ans << endl;
}
signed main(){
    freopen("color.in", "r", stdin);
    freopen("color.out", "w", stdout);
    cin >> T;
    F(T) solve();
    return 0;
}
//zha pian mi huo xing wei da shang
//mian
//freopen("color.in", "w", stdin)
//feropen("luogu")
//kkksc03
//chen_zhe
//rteurn 0;
//pbds

BJ-S01803

#include <bits/stdc++.h> //Never gonna give you up
#define int long long
using namespace std;
int n,r[100005],cnt;
signed main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for (int i=1;i<=n;i++) cin>>r[i];
    sort(r+1,r+n+1);
    for (int i=1;i<n;i++)
        if (r[i]==r[i+1]) cnt++;
    if (cnt==0) cout<<"1";
    return 0;
}
//If we can glow with our own sparkle.

RP++ 人 2.0

BJ-S00096（没错是我）/arena：

main()     {puts(      "C"       "S"
"P" "2"    "0" "2"     "4"       );\
puts(      "RP+="    "21474"   "83647"
";" "s"    "c"         "o"       "r"
"e"  "+"   "+"         ";"       );}

无法评价人

BJ-S01384/arena：

# include <bits/stdc++.h>
using namespace std;
int main() {
    freopen("arena.in", "r", stdin);
    freopen("arena.out", "w", stdout);
    cout << 0;
    return 0;
}
/* I want to fu ck c cf.
but I love zys
so I can't fu ck c cf
*/

BJ-S00370/arena

import os,time,random

money=0
meimiaozengjia=0

while True:
    os.system("clear")
    with open("a.txt","r") as f:
        money=int(f.readline())
        meimiaozengjia=int(f.readline())
    print("")
    print(""+str(money))
    print(""+str(meimiaozengjia))
    money+=meimiaozengjia
    with open("a.txt","w") as f:
        f.write(str(money)+"\n")
        f.write(str(meimiaozengjia)+"\n")

    time.sleep(1)

import os
a="""
花费0获得1
花费100获得1/s
花费1000获得10/s
花费10000获得100/s
花费100000获得10000/s
"""
money=0
meimiaozengjia=0
while True:
    os.system("clear")
    print(a)
    p=input("请输入你的选择：")
    if(p=="1"):
        with open("a.txt","r") as f:
            money=int(f.readline())
            meimiaozengjia=int(f.readline())
        money+=1
        with open("a.txt","w") as f:
            f.write(str(money)+"\n")
            f.write(str(meimiaozengjia)+"\n")
    if(p=="2"):
        with open("a.txt","r") as f:
            money=int(f.readline())
            meimiaozengjia=int(f.readline())
        if(money>=100):
            money-=100
            meimiaozengjia+=1
        with open("a.txt","w") as f:
            f.write(str(money)+"\n")
            f.write(str(meimiaozengjia)+"\n")
    if(p=="3"):
        with open("a.txt","r") as f:
            money=int(f.readline())
            meimiaozengjia=int(f.readline())
        if(money>=1000):
            money-=1000
            meimiaozengjia+=10
        with open("a.txt","w") as f:
            f.write(str(money)+"\n")
            f.write(str(meimiaozengjia)+"\n")
    if(p=="114514"):
        with open("a.txt","r") as f:
            money=int(f.readline())
            meimiaozengjia=int(f.readline())

        money-=10000
        meimiaozengjia+=1000
        with open("a.txt","w") as f:
            f.write(str(money)+"\n")
            f.write(str(meimiaozengjia)+"\n")

氧 化 钙 人

BJ-S01593/arena

#include<bits/stdc++.h>
using namespace std;
int main()
{
    freopen("arena.in","r",stdin);
    freopen("arena.out","w",stdout);
    da feng chui
    ku a han a,jiao ni ma ma dai ni qu mai wan ju a,kuai kuai na dao xue xiao xuan yao ba,hai zi jiao dian peng you ba.
    ei ya ya,ni kan ni shou shang na de shen me ma,na dong xi wo men zao jiu bu xie la,ha ha ha,ha.
    cao dong mei you pai dui.
    return 0;
}

BJ-S01593/color

#include<bits/stdc++.h>
using namespace std;
int main()
{
    freopen("color.in","r",stdin);
    freopen("color.out","w",stdout);
    lan ni
    ou duo mo mei li de yi ke xin,zen me hui,zen me hui,jiu bian cheng le yi tan lan ni.
    ou duo mo dan chun de yi shou shi,zen me hui,zen me hui,jiu bian cheng le feng ci.
    o xiang yao shuo de qian ren men dou shuo guo le.
    o xiang yao zuo de you qian ren dou zuo guo le.
    o xiang yao de gong ping dou shi bu gong men xu gou de.
    cao dong mei you pai dui
    return 0;
}

自 报 家 门 人

BJ-S00588/arena

#include<bits/stdc++.h>
using namespace std;
int main(){
    freopen("arena.in","r",stdin);
    freopen("arena.out","w",stdout);
    long long n,m,a,b,c,t,x,y;
    cin >> n >> m;
    for(int i = 0; i < n; i++){
        cin >> a;
    }
    for(int j = 0; j < m; j++){
        cin >> b;
    }
    for(int w = 0; w < 4; w++){
        cin >> c;
    }
    cin >> t;
    for(int k = 0; k < t; k++){
        for(int s = 0; s < 4; s++){
                cin >> x;
        }
    }
    if(n == 5) cout << 5 << endl << 19 << endl << 7 << endl << 1 << endl;
    if(n == 500) cout << 126395;
    if(n == 498) cout << 1698571;
    if(n == 5000) cout << 132523761347;
    //woshibeijingshichenjinglunzhongxuejinsongfenxiaodezhangruixuan
    //wodezhunkaozhenghaoshi:BJ-S00588 shenfenzhenghouziweishi:9530
    //xiwanggeweishenxiannengwanzuwoyigeyuanwang:
    //woyongwoyiniandanshenlaixuan2024niancsp-szufusaisandengjiang
    //huozheyongdanshenwunianlaihuan2024csp-sfusaierdengjiang
    //nengnajiangjiukeyi,qiuqiule!
    //xiwanggeweishenxiannengmanzuwozhegeyuanwang
    //woxiwangdaoshihoubuhuishuchu5 19 7 111
    fclose(stdin);
    fclose(stdout);
    return 0;
}