JS csp迷惑行为大赏

· · 休闲·娱乐

作者:Daybreak_Firefly

感谢 zzy0618 和 shimizu_kiouka 完成了 1400 以后的筛选

保证人类贡献完全大于 AI,保证 AI 只是给英语滚木拼音滚木的作者进行翻译 如果你跟作者一样滚木可用 AI 辅助阅读 效果更佳

不保证评选客观 不保证我没有遗漏的看了所有代码 如果你认为你整的活没选大概率是我认为不够好玩 不保证我的好玩是客观的 总之我在随机乱选 如果你想进可以私我 但私我不一定有用

保证一定出锅

JS-S00009

不是哥们还以为你整了什么大活 (题面直接塞 cpp 的)

hub.cpp

:::info[]

%PDF-1.7
%����
20 0 obj
<</Filter/FlateDecode/Length 3155>>
stream
x�ś����s?E��`d��+����m��“�ti9����%޺%�{��`�}(����x���M��ɛS7g���m�  �߿^������7�n_���!�}H7Xmo_���NB��}Z��AN#U����~�u�^�Dar��K�%h�u��ˢ�h�Q39"���2j�������`��Ak�~��լZ���rl����H��v��J�Y���sI���JZ��M�;�u̕J3�J�c�d�ܳ�Q�(h��Y[nmv�SS�|��zP�q|�F���j2�kz�A�A���X�ޭŽ\�s)���ti�5j�*����"��ڲ��A����A�VGO������non���$��c��W���%�߷��~��c�!6�P"% ��nϿ9�L�7LDD
ށ�H���~��Z�]���P"\�@�na�+IW�R�/�[Mrj�n]��ZΣ=��~�ѡ�fN��4Q�)+���g-�0�E�VI��R^���Y�4sx�"����Jҕ!V�fh�Rw��(���\��Y�qR�dNi�D   `j$��3$��2��>.��r�IR�$�i�!��J���JS�y#���^ѫ   ��e_�+�e��Ү^A�e��`�kH��,_��

:::

JS-S00016

crystal.cpp

优势在我

//15:05 pass

subway.cpp

优势不在我

//16:13 wo hao tang, wo bu hui zuo
//qwq
//17:32 writing bao li
//I have no water left, I'm really thirsty

JS-S00024

hub.cpp

木棍木棍木棍

#include <bits/stdc++.h>
using namespace std;
int main(){
    freopen("hub.in","r",stdin);
    freopen("hub.out","w",stdout);
    /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
    ////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
    return 0;
}

migrate.cpp

#include <bits/stdc++.h>
using namespace std;
int main(){
    freopen("migrate.in","r",stdin);
    freopen("migrate.out","w",stdout);
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    /////////////////////////////////////////////////////////////////////////////
    //////////////////////////////////////////////////////////////////////////////////

    return 0;
}

JS-S00027

subway.cpp

/续标识

//quan yuan zui duan lu?
// I only remember Kruscal
//O(n^3+q*(d^2))? 50pts
// dan fan n<=400 dou guo le
// scan your QR code CCF and CSP

JS-S00029

crystal.cpp

精神胜利 (这人 108 分)

#define iwill using
#define ak namespace
#define csps std;
iwill ak csps

JS-S00039

hub.cpp

LSQ11451410086

再也不打 csp 是正确的

洛天依是正确的

Happy every day!

:::info[]

#include<bits/stdc++.h>
using namespace std;
/*
bai le bai le
I love luo_tian_yi
for(;;){
    cout<<"kkksc03";
}

*/
int main(){
    freopen("hub.in","r",stdin);
    freopen("hub.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //cout<<"hello_world";//wan bian bu li qi zhong
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555 555
    //wo yi hou zai ye bu da CSP-S le
    //*******************************************************************************
    int kkksc03;
    int LSQ11451410086;
    //cout<<"happyeveryday";
    cout<<"1\n2";
    return 0;
}

:::

JS-S00043

crystal.cpp

// ________  ________
//|  ____  ||  ____  |   __      __    __
//| |____| || |____| | _|  |_  _|  |_ |__|
//|  ____  ||  ______||_    _||_    _| __
//|_|    \_\|_|         |__|    |__|  |_/
//    R         P        +       +     ;

JS-S00049

crystal.cpp

Just simply recalling...
Unlike last year,
there's not so much desire for the Winter Camp.
"Where should I stop?"
I asked myself.
In fact,
whatever it turns out to be,
I'll treasure it,forever.
//freopen

JS-S00078

hub.cpp

即便 我们 都在 那黑暗漫长的反乌托邦

/*
我们孤身闯入这世界里
找寻名为宝藏的通关奖励
——珍珠

生命是一万次的谎话
吊唁这梦和童话
万水千山看罢
蹉跎几度年华
——空心人札记

只因为你那渴望自由的心脏
困在一张没有空隙的网
我们的周围并非没有光亮
只是太耀眼将我们灼伤
——反乌托邦

比赛结束前打的,歌词记不清了,不知道有没有错
我想上迷惑行为大赏,qwq
*/

JS-S00082

crystal.cpp

迷惑行为大赏总得有个追忆位的

wo chang chang zhui yi guo qu

sheng ming shun jian ding ge zai nao hai

wo jiang bei hou de shi jian cai jian zhe die quan qu, rou nian cheng tian shang dup duo bai yun.

yun duo zhi jian yi you fen bie

JS-S00137

subway.cpp

这人最后 T1 还是炸了

cout << "I did not notice a detail in T1. Now I have no time to finish T2. That's a pity.";

JS-S00164

空中飞人一个

hub.cpp

//CCF:Chinese Can Fly
//    ^       ^   ^
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
//no!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

JS-S00174

这人教练是不是可以拉出去毙了

crystal.cpp

:::info[]

#include <bits/stdc++.h>
using namespace std;
int a[1000000000000000001];
long long m=100000000001;
int main(){
    int n,m,s=0,t=0;
    int ans=1;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        s+=a[i];
    }
    for(int i=1;i<=n;i++){
        if(a[i]>s/5&&a[i]-s/5<m);{
            t=i;
            m=a[i];
        }
        if(a[i]<s/5&&s/5-a[i]<m);{
            t=i;
            m=a[i];
        }
    }
    for(int i=1;i<=n;i++){
        if(a[i]>a[t]) a[i]-=a[t];
        else a[i]=a[t]-a[i];
    }
    sort(a,a+n);
    if(a[1]<=a[n]){
        for(int i=2;i<=n;i++){
            if(m>=a[i]){
                m-=a[i];
                ans++;
            }
            else break;
        }
    }
    else{
        for(int i=n-1;i>=1;i--){
            if(m>=a[i]){
                m-=a[i];
                ans++;
            }
            else break;
        }
    }
    cout<<ans;
    freopen("crystal.in","r",stdin);
    freopen("crystal.out","w",stdout);
    return 0;
}

:::

subway.cpp

:::info[]

#include <bits/stdc++.h>
using namespace std;
int main(){
    int c,n,m,d,q;
    cin>>c>>n>>m>>d>>q;

    freopen("subway.in","r",stdin);
    freopen("subway.out","w",stdout);
    return 0;
}
}

:::

migrate.cpp

:::info[]

#include <bits/stdc++.h>
using namespace std;
int main(){
    int c,t,h=0;
    cin>>c>>t;
    for(int k=1;k<=t;k++){
        int n,d;
        cin>>n>>d;
        int ans=0;
        int x[n+5];
        int a[n+5][n+5],b[n+5][n+5];
        for(int i=1;i<=n;i++){
            cin>>x[i];
        }
        for(int i=1;i<=n;i++){
            for(int j=i+1;j<=n;j++){
                if(x[j]-x[i]<=d){
                    a[i][j]=1;
                    a[j][i]=1;
                }
            }
        }
        for(int i=4;i<=n;i++){
            h=1;
            for(int h=1;h<i;h++){
                if(a[h][i]==1){
                    for(int g=1;g<h;g++){
                        if(a[g][h]==1){
                            b[i][g]++;
                        }
                    }
                }
            }
        }
        for(int i=4;i<=n;i++){
            for(int j=1;j<i;j++){
                if(b[i][j]==2){
                    ans++;
                }
            }
        }
        cout<<ans;
    }
    freopen("migrate.in","r",stdin);
    freopen("migrate.out","w",stdout);
    return 0;
}

:::

hub.cpp

:::info[]

#include <bits/stdc++.h>
using namespace std;
int main(){
    int c,t;
    cin>>c>>t;
    for(int l=1;l<=t;l++){
        int n,k;
        cin>>n>>k;
        int u[n=5],v[n=5];
        for(int i=1;i<=n-1;i++){
            cin>>u[i]>>v[i];
        }
    }
    freopen("hub.in","r",stdin);
    freopen("hub.out","w",stdout);
    return 0;
}

:::

JS-S00244

crystal.cpp

深刻反省

//I want to cry, my mum says I only need my phone.I am suffering.I don't concentrate on the OI, I look much bad things. I regret but it cannot work.It's 18:19 now, I don't know if others will laugh at me.I copy others code, I ask for AI often.
//I will tell all this to my family tonight. how to open my mouth. I have realized that if I do not say it, I will keep down in my life until I'm died.
/*
OK, I think good.

use pre arr, get the position.

output position-1

#1 ok, #2 ok, #3 ok.

?!#4 Wa.?!

maybe find the count most num, greedy.

ok, 30 minutes later.

?!segmentation fault?!

?!ququ?!

now 15:40, can I win?

maybe i really need to concentrate on my study, i forget my dijkstra.

I'm tired out.
*/
//111111111111111111111111111111111111111111111111111111111111111111111

JS-S00276

严肃在哪

subway.cpp

//This is CSP-S. Be serious!

JS-S00281

hub.cpp

兄弟抱一下 说说你心里话

/*I don't know how it feels.
I have two friends,who I play with them very well from the age of 6.A boy and a girl.
For some reason,we didn't connect as frequently as before ,as we were in different classes.
After coming into senior high.we connect much more.
Days before ,the boy became the girl's boyfriend.As his sincere friend,I feel absolutely happy.
Thus,they come much closer.Only I,like a boat missing in the sea,not knowing what to depend on.
Sure,I don't feel jealousy about their delight.
But I am...,just a little lonely.*/

JS-S00406

省流 45+0+0+0

crystal.cpp

//CCF is my baba.

subway.cpp/migrate.cpp

//please let me pass;

JS-S00410

migrate.cpp

是啊是什么

//sha shi meng xian da

JS-S00438

migrtae.cpp

你成功无语到我了

:::info[]

#include<bits/stdc++.h>
#define int long long
using namespace std;
int x[2000005],dis[2000005];
signed main()
{
    freopen("migrate.in","r",stdin);
    freopen("migrate.out","w",stdout);
    //freopen("migrate3.in","w",stdin);      诈骗orz
    //freopen("migrtae.out","r",stdout);     诈骗orz
    int c,t;
    cin>>c>>t;
    while(t--)
    {
        int n,d;
        cin>>n>>d;
        bool A=1,B=0,Bp=0;
        for(int i=1;i<=n;i++)
        {
            cin>>x[i];
            if(i>2&&x[i]-x[i-1]!=x[i-1]-x[i-2])
            {
                A=0;
            }
        }
        for(int i=1;i<=n;i++)
        {
            if(x[i]-x[1]<=m&&x[n]-x[i]<=m)
            {
                B=1;
                Bp=i;
                break;
            }
        }
        if(!(A||B)&&n>5000)
        {
            cout<<"不会qwq"<<endl;
            continue;
        }
        //7~10不知道能不能过
        if(A)
        {
            int sx=x[1],gc=x[2]-x[1],tmp=0,di=0,ans=0;
            for(int i=1;i<=n;i++)
            {
                if(di<x[i])
                {
                    tmp+=(x[i]-tmp+d-1)/d*d;
                    di=x[i];
                    dis[i]=tmp;
                }
            }
            for(int i=1;i<=n;i++)
            {
                for(int j=1;i*j<=x[n];j++)
                {
                    ;//不不不这无疑是困难的,不写了
                }
            }
            cout<<n*(n-1)/2<<endl;
        }
        if(B)
        {
            cout<<n-1+(Bp-1)*(Bp-2)/2+(n-Bp)*(n-Bp-1)/2<<endl;
            continue;
        }
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=i+1;j<=n;j++)
            {
                int tmp=x[i],d1=0,d2=0;
                for(int k=i;k<=j;k++)
                {
                    if(x[k]>tmp)
                    {
                        tmp+=d;
                        d1++;
                    }
                }
                tmp=x[j];
                for(int k=j;k>=i;k--)
                {
                    if(x[k]<tmp)
                    {
                        tmp-=d;
                        d2++;
                    }
                }
                if(d1==d2)
                {
                    ans++;
                }
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}
//uid:1419161
//orz kkk %%%
//orz chenzhe %%%
//orz chw %%%
//orz zgq %%%
//orz dzd %%%
//≈24 pts(可能会炸
//滚动的木头
//滚动的木头
//滚动的木头
//滚动的木头
//滚动的木头

:::

JS-S00446

migrate.cpp

wm自动机

/*
li jie le
yi dian ye bu hao wan
fang wo hui qu wan osu
(wei she me kao shi shi jian zhe me wan,hui qu wo dou mei shi jian qu dawu meng le)
*/

JS-S00538

migrate.cpp

gty 大哥你好强

int gty,_;cin>>gty>>_;

JS-S00541

hub.cpp

介个 linkd 是个什么东西啊

//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net
//www.playlinkd.net

JS-S00542

认出是 gty 了

JS-S00552

migrate.cpp

哦哦哦 哦 哦哦哦 噢噢噢噢 呜呜呜呜呜呜 呜呜呜呜呜呜呜

 freopen("migrate.in","r",stdin);
 //   freopen("migrate.out","w",stdout);
    cin>>c>>t;
    if(c==114514) cout<<"it's been a long day~\n";
    if(c==1919810) cout<<"without you my friend~\n";

JS-00557

教练拉出去斩了 2.0(本人贴的完整代码)

crystal.cpp

cout<<3;

subway.cpp

cout<<32<<endl<<17;

migrate.cpp

cout<<1<<endl<<2;

JS-S00563

crystal.cpp

你几点想出来的 T1 ?

/*
Time 14:30-18:30 don't forget!

luogu:AutumnQ(uid=1038710)
friend:moon_set

chennie,Cubber,absi2011,cmh,aaa_Pigeaon,offoff,Sving1024,placeholder,hyman00,UKB_wyx,TheSky233,LXGOD,rym,SNRJ,moon_set bless me!
The participant who sits next to me says that he is qqiq,is this true?

rp=inf;

Maybe 14:28 I think out T1's idea?
Maybe 14:43 AC Sample 4/4
*/

JS-S00579

发现 qqiq 转一圈 狗狗笑哭

声称得分 200

期望得分 20

实际得分 -114514

中文注释作者加的

crystal.cpp

:::info[]

#include <bits/stdc++.h>
using namespace std;

int a[100005], c[100005], p[100005];
int n, m, sum, ans = -1;

signed main()
{
    freopen("crystal.in", "r", stdin);
    freopen("crystal.out", "w", stdout);
    cin >> n>> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i < n; i++)
    {
        c[i] = a[i + 1] - a[i];
        p[i] = p[i - 1] + c[i];
    }//兄弟怎么把差分数组前缀和了
    int l = n - 1, r = n - 1;
    while (l <= r && l >= 0)
    {
        while (sum <= m && l >= 0)
        {
            sum += p[r] - p[l - 1];
            l--;
        }
        l++;
        ans = max(ans, r - l + 1);
        sum -= c[r] * (r - l + 1);
        sum -= c[l];
        r--;
    }
    cout << ans;
    return 0;
}

:::

subway.cpp

:::info[]

#include <bits/stdc++.h>
using namespace std;

int c, n, m, d, ds, x, y, ans;

struct node
{
    int v, w;
};
int w[500005];
vector<node> g[500005];
int dis[3005];
bool vis[3005][3005];
queue<int>q;
void spfa(int s)
{
    memset(dis, 0x3f, sizeof dis);
    dis[s] = 0;
    q.push(s);
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        for (int i = 0; i < g[u].size(); i++)
        {
            int v = g[u][i].v, w = g[u][i].w;
            if (dis[u] + w < dis[v])
            {
                dis[v] = dis[u] + w;
                q.push(v);
            }
        }
    }
}//甚至不会 dij 话说 liuhaodong947 初二是不是也不会 dij

signed main()
{
    freopen("subway.in", "r", stdin);
    freopen("subway.out", "w", stdout);
    cin >> c >> n >> m >> d >> ds;
    for (int i = 1; i <= m; i++)
    {
        cin >> w[i];
    }
    for (int i = 1; i <= n; i++)
    {
        int k;
        cin >> k;
        for (int j = 1; j <= 2 * k; j++)
        {
            int w;
            cin >> w;
            if (vis[i][j])
            {
                for (int tt = 0; tt < g[i].size(); tt++)
                {
                    if (g[i][tt].v == j) g[i][tt].w += w;
                }
                for (int tt = 0; tt < g[i].size(); tt++)
                {
                    if (g[tt][i].v == j) g[tt][i].w += w;
                }
            }
            else
            {
                vis[i][j] = 1;
                vis[j][i] = 1;//站台跟地铁线路也是双向边?
                g[i].push_back({j, w});
                g[j].push_back({i, w});
            }
        }
    }
    memset(dis, 0x3f, sizeof dis);
    int ds;
    cin >> ds;
    while (ds--)
    {
        memset(dis, 0x3f, sizeof dis);
        ans = 0;
        cin >> x >> y;
        spfa(x);
        cout << dis[y] << endl;
    }
    return 0;
}
//Kingsley is gay
//fuck you CCF
//afo on 2026.10.31

:::

JS-S00598

恭喜 Igunareo 爷从 248 爷晋升为 325 爷!!!

subway.cpp

//Igunareo ver.

//chutirenheyiwei

migrate.cpp

//Igunareo ver.

//Good night.
//That's the end.

JS-S00663

魔裁联动邦邦真的假的

话说这人是不是没有不是 qwerty 的风险

migrate.cpp

//mo cai lian dong bang bang? zhen de jia de?
//wo qu, zhen lian dong le.

//csp-s hun le wu nian le, bu liu ji ming nian dou shang da xue le, mei ji hui zai da le.
//zai ci ming ji wo de (shang gong) qing chun
//So, tell me, where should I go?
//sayonara~

hub.cpp

//wo yao da ming ri fang zhou
//wo yao wan arknights
//wo yao chou ka
//wo shi ren lei, wo yao shang mi huo xing wei da shang

JS-S00667

这个网址不好玩。

crystal.cpp

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define O_ return
#define my cout
#define touhou <<
#define tiny_game -1
#define go <<ans
const int N=5e5+5;
int n,m,a[N],cf[N],sum,ans=1,num;
signed main(){
    freopen("crystal.in","r",stdin);
    freopen("crystal.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)cf[i]=a[i]-a[i-1];
    for(int i=1,j=1;i<=n&&j<=n;i++){
        while(num<=m&&j<=n)j++,num+=(j-i)*cf[j],sum+=cf[j];
        ans=max(ans,j-i);
        num-=sum,sum-=cf[i+1];
    }my go;
    O_ 0;
    http://thenv.me
    my touhou tiny_game;
    O_ 0;
}

JS-S00695

qwerty 你看看别的高三生(Silvefish )什么水平

hub.cpp

/*
I'm Aukcwduag(encoded), a Grade 12 student.
I won a silver medal in the National Olympiad in Informatics 2026.
Finally, it's time to leave.
Best wishes to every OIer persuing his/her dream.
By the way, the lengths of my codes are 520, 1314, 2026 and 1031 respectively :)
*/

JS-S00706

hub.cpp

?

JS-S00727

crystal.cpp

呆马原:西艾付慌弟的[保佑]

// CatNyan Blesses Me!
// placeholder Blesses Me!
// Cubber Blesses Me!
// chenmohan201068 Blesses Me!
// clever_baka Blesses Me!
// DTL123 Blesses Me!
// Zheng_iii Blesses Me!
// Daylightning Blesses Me!
// xuanxuanni Blesses Me!
// _vector_ Blesses Me!
// cdx123456 Blesses Me!
// tourist Blesses Me!
// jiangly Blesses Me!
// CCF Blesses Me!

// freopen();
// freopen();

JS-S00784

migrate.cpp

研究表明写成这样击杀概率是滚木 看不清楚的可贴剪贴板

:::info[] /*

aaa!!
wo bu hui a!!
tai na la!!!!
//freopen
froepen
frepen
fropen
freepen
froopen
jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjj
jjjjjjjjjjj
      cccc      cccc     fffffff       iiiiiii      l          ooo    v           v  eeeeeee        y     y   ooo    u     u       !!!!!
    c         c          f                i         l         o   o    v         v   e               y   y   o   o   u     u       !!!!!
   c         c           f                i         l        o     o    v       v    e                y y   o     o  u     u        !!!
   c         c           fffffff          i         l        o     o     v     v     eeeeeee           y    o     o  u     u        !!!
   c         c           f                i         l        o     o      v   v      e                 y    o     o  u     u       
    c         c          f                i         l         o   o        v v       e                 y     o   o    u   u         !!!
      cccc      cccc     f             iiiiiii      llllllll   ooo          v        eeeeeee           y      ooo      uuu          !!!
*/

:::

JS-S00815

crystal.cpp

混沌之物吓到我了

:::info[]

#include<bits/stdc++.h>
#define int long long
#define N 500005
#define YFBLRHBJJS using
#define DADNQPKIKI namespace
#define IXEZXYNNAA std
#define WYFXLYHOHS int
#define HLUMALBKVN n
#define SDKWEJXTYX a
#define UUYZULYBAF N
#define VJSPXSAYEX m
#define LWBXVHHUDH sum
#define TXCTYWFWZH qst
#define EUSYJPRMNV l
#define JAUMXRWGLZ r
#define OEWSAWQFTP o
#define OZLGXUXQIM 1
#define MUMIGLZESM p
#define DIQBASYSXT if
#define HNSUVPOSGZ and
#define EUTSEBEFGY 3
#define RJIJNKCLCB cout
#define GLPYFMPVFX endl
#define ULTNGZPMEV return
#define KVGUFTEJGG 0
#define KORBMWOERV signed
#define BOIXBOWSAB main
#define NMWWGDRMMA freopen
#define SZOLADJOHB crystal
#define JIPSHSIELL in
#define FAZDYGJQUV stdin
#define SNUGYVLKLS out
#define LVDCPKWXOH w
#define KVKKZISIAM stdout
#define FUZCDAZOKK ios
#define HXHKBYWXYL sync
#define HIITSJDKRG with
#define XZAYBDAASM stdio
#define MZLWLMUHMS cin
#define UVBFOTOTGG tie
#define ZDHADIFEKX for
#define QYYCULQPVC i
#define HRZKWNGLJM sort
#define TIPAKSKQYW ans
#define PRUOTPZLGW while
#define ONOPAKDGVO max
#define SQWJQJDCZC Oct31
#define YQTVEOMGZS Dec25
#define CPHSFHDKNA Thisisurfate
YFBLRHBJJS DADNQPKIKI IXEZXYNNAA;
WYFXLYHOHS HLUMALBKVN,SDKWEJXTYX[UUYZULYBAF],VJSPXSAYEX,LWBXVHHUDH[UUYZULYBAF];
WYFXLYHOHS TXCTYWFWZH(WYFXLYHOHS EUSYJPRMNV,WYFXLYHOHS JAUMXRWGLZ){
    WYFXLYHOHS OEWSAWQFTP=SDKWEJXTYX[JAUMXRWGLZ]*(JAUMXRWGLZ-EUSYJPRMNV+OZLGXUXQIM);
    WYFXLYHOHS MUMIGLZESM=LWBXVHHUDH[JAUMXRWGLZ]-LWBXVHHUDH[EUSYJPRMNV-OZLGXUXQIM];
    // DIQBASYSXT(EUSYJPRMNV==OZLGXUXQIM HNSUVPOSGZ JAUMXRWGLZ==EUTSEBEFGY){
    //     RJIJNKCLCB<<OEWSAWQFTP<<' '<<MUMIGLZESM<<' '<<VJSPXSAYEX<<GLPYFMPVFX;
    // }
    DIQBASYSXT(OEWSAWQFTP-MUMIGLZESM<=VJSPXSAYEX) ULTNGZPMEV OZLGXUXQIM;
    ULTNGZPMEV KVGUFTEJGG;
}
KORBMWOERV BOIXBOWSAB(){
    // NMWWGDRMMA("SZOLADJOHB.JIPSHSIELL","JAUMXRWGLZ",FAZDYGJQUV);
    // NMWWGDRMMA("SZOLADJOHB.SNUGYVLKLS","LVDCPKWXOH",KVKKZISIAM);
    // freopen("crystal.in","r",stdin);
    // freopen("crystal.out","w",stdout);
    freopen("crystal.in","r",stdin);
    freopen("crystal.out","w",stdout);
    FUZCDAZOKK::sync_with_stdio(KVGUFTEJGG);
    MZLWLMUHMS.UVBFOTOTGG(KVGUFTEJGG);RJIJNKCLCB.UVBFOTOTGG(KVGUFTEJGG);
    MZLWLMUHMS>>HLUMALBKVN>>VJSPXSAYEX;
    ZDHADIFEKX(WYFXLYHOHS QYYCULQPVC=OZLGXUXQIM;QYYCULQPVC<=HLUMALBKVN;QYYCULQPVC++) MZLWLMUHMS>>SDKWEJXTYX[QYYCULQPVC];
    HRZKWNGLJM(SDKWEJXTYX+OZLGXUXQIM,SDKWEJXTYX+HLUMALBKVN+OZLGXUXQIM);
    ZDHADIFEKX(WYFXLYHOHS QYYCULQPVC=OZLGXUXQIM;QYYCULQPVC<=HLUMALBKVN;QYYCULQPVC++) LWBXVHHUDH[QYYCULQPVC]=LWBXVHHUDH[QYYCULQPVC-OZLGXUXQIM]+SDKWEJXTYX[QYYCULQPVC];
    WYFXLYHOHS TIPAKSKQYW=KVGUFTEJGG;
    WYFXLYHOHS EUSYJPRMNV=OZLGXUXQIM;
    ZDHADIFEKX(WYFXLYHOHS JAUMXRWGLZ=OZLGXUXQIM;JAUMXRWGLZ<=HLUMALBKVN;JAUMXRWGLZ++){
        PRUOTPZLGW(EUSYJPRMNV<=JAUMXRWGLZ HNSUVPOSGZ !TXCTYWFWZH(EUSYJPRMNV,JAUMXRWGLZ)) EUSYJPRMNV++;
        // RJIJNKCLCB<<EUSYJPRMNV<<' '<<JAUMXRWGLZ<<GLPYFMPVFX;
        TIPAKSKQYW=ONOPAKDGVO(TIPAKSKQYW,JAUMXRWGLZ-EUSYJPRMNV+OZLGXUXQIM);
    }
    RJIJNKCLCB<<TIPAKSKQYW;
    ULTNGZPMEV KVGUFTEJGG;
}

/*
SQWJQJDCZC==YQTVEOMGZS?
CPHSFHDKNA?
ccf
*/

:::

JS-00837

crystal.cpp

学生打csp小指断裂 教练说这才是完整的信息人生

/* bushi, ni zhege jianpan shift jian yizhi zai zhouji wode zuoshou xiaozhi???
   bushi, xian zai 14:17 wo jianqiaoyan yijing fan le...
   bushi, ni zhege meishi jianwei ling wode '\' '|' xuanzhuan...

   jingran you baocuo!! zanqie bu hei le.

   15:32 crystal samples passed. tiao le yige shiji de yuanyin shi mei paixu. wo shi ruozhi...
   15:37 jixian shuju WA le, yuyuzheng
   15:41 zenme shi shengchengqi gua le, xiao si. zhexia guo le.
*/

JS-S00866

crystal.cpp

还是英语巨佬

/*
If you see it,you will see this:
When you are seeing this,you have seen these.
*/

JS-S00899

migrate.cpp

这下小明可惨了

/*
Please give me 100 score!


    you ji;

    xiao ming ceng jing shi yi ge ren;
    hou lai;
    ta ai shang le xue xi;
    ta xi huan xue bian cheng;
    ta shi yi ge ren;
    ta fei le qi lai;
    ta shuai zai le di shang;
    "pa da";
    si le;

    zai hou lai;
    ta chong sheng le;
    ta fa xian;
    ta shi yi ge ren;
    suo yi;
    ta shi yi ge ren;

    you yi tian;
    ta bao min le CSP-J;
    ta fa xian tai nan le;
    ba dian nao za le;
    jian ao lao shi lai le;
    hen sheng qi;
    yi bu xiao xing ba ta da si le;
    xiao ming you si le;
*/

JS-S00963

crystal.cpp

兄弟搞这么大 给你了 看不清可复制到剪贴板

/*
........................#........................
.......................#.#.......................
.......................#..#......................
......................#...#................................................................................................................................
......................#....#...............................................................................................................................
.....................#.....#.................................#####.......................................#.....................#....................#......
.....................#......#..........................#.....#...#.......##############..........#.......#............#........#...........#........#......
....................#.......#..........................#.....#...#..........#....................#.......#............#.....#..#..........#.......#.#......
....................#........#.........................#.....#####..........#....................#.......#............#.....#..#..........#......#..#......
...................#.........#.........................#.....#...#..........#....................#....#######.........#.....#..#.........#####...#..#......
...................#..........#........................#.....#...#..........########...........#.#.......#............#.....#..#.........#......#######....
..................#...........#......................#####...#####..........#......#...........#####.....#..........#####.#########.....#.......#...#......
..................#............#.......................#....................#......#..........#..#...#########........#.....#..#..#.......####.#....#......
.................#.............#.......................#.#.#########........#..#...#.............#........#...........#.....#..#..#........#.....######....
.................#..............#......................##......#............#...#...#............#.#......#...........#.....#.....#........#........#......
................#...............#...................####.......#............#....#..#...........###...#######.........#.....#...#.#......#####......#......
...............#.................##....................#.......####.........#.......#.........##.#........#...........#.#...#....##........#.......#.#.....
..............#....................##................#.#....#..#............#........#...........#....#...#...........##....#..............#.......#.#.....
............##.................##....##...............##....##.#............#.#......#..#........#.....#..#.........###.....#......#.......#.#.....#..#....
..........##............##########.....##..............#...#..##............##........#.#........#........#..................#.....#.......##.....#....#...
........##......###################......##...............#.....####........#..........#................###...................######.............#......#..
......##.........################..........##..............................................................................................................
....##...........###...###.....#.............##............................................................................................................
..##...................###.....................#.
##.....................###......................#
##.....................###....................##.
..##...................###..................##........................................................................................................................................................
....##.................###................##......##########...##########...##......##...##......##.......##.......##########..........##......##...##########...##########...#######........######...
......##...............###..............##........##########...##########...###....###...##......##.......##.......##########..........###....###...##########...##########...#########.....########..
........##.............###............##..............##.......##............###..###.....##....##.......####..........##..............####..####...##...............##.......##.....###...###....###.
..........##...........###..........##................##.......##.............######......##....##.......####..........##..............##.####.##...##...............##.......##.....###...##......##.
............##.........###........##..................##.......#########.......####........##..##.......##..##.........##..............##..##..##...##########.......##.......#########....##......##.
..............##.......###.......#....................##.......#########........##.........##..##.......##..##.........##..............##......##...##########.......##.......#######......##......##.
................##.....###......#.....................##.......##...............##..........####.......########........##..............##......##...##...............##.......#####........##......##.
..................#....###.....#......................##.......##...............##..........####.......########........##..............##......##...##...............##.......##..###......###....###.
...................#...###.....#......................##.......##########.......##...........##.......##......##.......##..............##......##...##########.......##.......##...###......########..
...................#...###....#.......................##.......##########.......##...........##.......##......##.......##..............##......##...##########.......##.......##.....###.....######...
....................#..###....#........................................................................................................^..............................................................
....................#....#...#...................
.....................#.......#...................
.....................#......#....................
......................#.....#....................
......................#....#.....................
.......................#...#.....................
.......................#..#......................
........................#.#......................
.........................#.......................
Introduction: A Minecraft server that builds subway in the map of Genshin. The map comes from a bilibili poster. The MTR mod is added to the game.
*/

JS-S00989

crystal.cpp

愚人之眼,解放!若娜瓦📌若娜瓦📌若娜瓦📌若娜瓦📌若娜瓦📌若娜瓦📌

//wu bai nian lai,wo dou wang bu diao na ge yan shen,si zhi zhi zheng jiang xia bu si zu zhou de shi hou
//ta de yan zhong mei you bei min ye mei you kuai yi
//ming ming zhou wei dou shi qi qiu de ren me,si zhi zhi zheng yi jiu bu wei suo dong
//xian zai, ruo na wa,zheng shi wu!zheng shi ni de di ren!yu ren zhi yan!jie fang!ruo na wa!

JS-S01100

migrate.cpp

兄弟我生气了😡 你怎么是 315 分在这随机说话

//chennie bless me
//chennie bless me
//chennie bless me
//chennie bless me
//chennie bless me
//chennie bless me
//chennie bless me
//chennie bless me
//chennie bless me
//chennie bless me
//chennie bless me
//you jin bu liao WC le

JS-S01115

hub.cpp

那种勃勃生机 万物竞发的境界犹在眼前 短短 10 年后 这 csp 竟至于一变而为我的葬身之地了吗

nan wai di fang,li dai da gui mo kao shi ?? yu ci
shi fei qu zhe,nan yi lun shuo
bu guo ,shi jia jie ren wei,zheng shi zai zhe ji fang wu zhan chang
jue ding le duo shao ming OIer de xing shuai qi luo
suo yi,gu lai bian you wen ding nan wai zhi shuo
3 nian qian,wo cong nan hang ta shang zheng tu,kai shi le di yi ci CSP-J

推一下我去年的文章 https://www.luogu.com.cn/article/4ld5dcp9

JS-S01116

migrate.cpp

不可以小白鸟

signed main(){
    freopen("migrate.in","r",stdin);
    freopen("migrate.out","w",stdout);
    int c = read();
    int t = read();
    while(t--){
        cout << 0 << endl;
    }
    //I say if!!!if!!!,if I AK IOI;
    //NONONO,I can't AK IOI forever;
    fclose(stdin);
    fclose(stdout);
    return 0;
}

JS-S01126

怎么没有考的比我好的骂 ccf 啊

//luogu:mcc2025
//f**k CCF

JS-S001138

crystal.cpp

禁止时间打代码源的我

/*/
 * 14:07
Type here what you want, use it as a notice/scratch board
Type here what you want, use it as a notice/scratch board
Type here what you want, use it as a notice/scratch board
Type here what you want, use it as a notice/scratch board
Type here what you want, use it as a notice/scratch board
Type here what you want, use it as a notice/scratch board
Type here what you want, use it as a notice/scratch board
Type here what you want, use it as a notice/scratch board
Type here what you want, use it as a notice/scratch board
Type here what you want, use it as a notice/scratch board
 * 14:55
 * I give up.
 * Now I just want to reach the final faster.
 * 
 * 15:17(22min)
 * boring...
 * 
 * 15:34(17min)
 * boring...
 * 
 * 15:47(13min)
 * boring...
 * 
 * 15:57(10min)
 * boring...
 * 
 * 16:07(10min)
 * boring...
 * 
 * 16:17(10min)
 * boring...
 * 
 * 16:27(10min)
 * boring...
 * 
 * 16:37(10min)
 * boring...
 * 
 * 16:47(10min)
 * boring...
 * 
 * 16:57(10min)
 * boring...
 * 
 * 17:07(10min)
 * boring...
 * 
 * 17:17(10min)
 * boring...
 * 
 * 17:27(10min)
 * boring...
 * 
 * 17:37(10min)
 * boring...
 * 
 * 17:47(10min)
 * boring...
 * 
 * 17:57(10min)
 * boring...
 * 
 * 18:07(10min)
 * boring...
 * 
 * 18:17(10min)
 * boring...
/*/

JS-S01147

crystal.cpp

加入知更鸟 funs club 谢谢喵

/*
I am ROBIN's DOG!!!
Miss ROBIN!!! I am your fans!!!
This is true music!
*/
//Honkai:Starail UID : 152884855

JS-S01152

crystal.cpp

来自csp考场的激情表白 不属于我的青春

/*
写不动了。。。
我要打wotb&df
明年在来吧。。。

dzd我喜欢你很久了!!!!!!

游记:
(写了一段游记,只有聪明人能看见,你看见了么)
🚾🚾🚾🚾🚾🚾🚾🚾🚾🚾🚾🚾
*/

JS-S01186

hub.cpp

你小学一年级是停课了吗

//zhe'shi'yi'ge'yin(g)'cang'cai'dan
//gong'xi
//yin(g)'shi'qian'bi'yin'hai'shi'hou'bi'yin?????

JS-S012222

crystal.cpp

ccf 确实只给你 crystal 50 分(+eps)

//100 pts ?
//I'm exhausted
//ccf v me 50

JS-S01229

subway.cpp

教练拖出去斩了 3.0

//duancuowu shishenme a aaaaaaa 

JS-S01238

hub.cpp

羡慕 ccf

//CCF I love you!!!!!!!
//suki desu~~~~
//baka
//zako desu

JS-S01266

subway.cpp

最强战绩铭刻于 csp 考场

//so that, does CFF won?

JS-S01499

subway.cpp

看来只有败类会在代码里骂 ccf

//cout<<"FUCK CCF,I WANNA KILL YOU,WULA!!!\n";

JS-S01628

hub,cpp

OI 还有孝子?

// PhO is less nb than OI
// PhO's chusai are held by local ordinary schools
// OI's chusai are held by nb schools!
// OI nb!

JS-S01631

migrate.cpp

学生打csp手指断裂 教练说这才是完整的信息人生2.0

//I forget when I opened T3.
//16:22 hurt a finger
//16:57 +8pts from #1~2(n <= 9)
//no clue at all
//I'm super weak.

JS-S01652

hub.cpp

败类+1

//I love your mother CCF

JS-S01686

migrate.cpp

水晶の迁徙

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

JS-S01687

这人今年擦线一等了大概

两人想表达的意思是我喜欢你 你喜欢我

//好看一点
//结...束了吗
//可能我早就AFO了
//可还是放不下啊
//OI你个臭杂鱼

JS-S01688

这是一场与豪赌!(你甚至不愿意输入 t

subway.cpp

#include<bits/stdc++.h>
using namespace std;
int main(){
    freopen("subway.in","r",stdin);
    freopen("subway.out","w",stdout);
    cout<<rand()%10<<"\n"<<rand()%10;
}

migrate.cpp

#include<bits/stdc++.h>
using namespace std;
int main(){
    freopen("migrate.in","r",stdin);
    freopen("migrate.out","w",stdout);
    cout<<rand()%10<<"\n"<<rand()%10;
}

hub.cpp

#include<bits/stdc++.h>
using namespace std;
int main(){
    freopen("hub.in","r",stdin);
    freopen("hub.out","w",stdout);
    cout<<rand()%10<<"\n"<<rand()%10;
}

JS-S01763

subway.cpp

🤓👆

/*/
I LOVE CCF!!!🤓👆
/*/

JS-S00721 (因本人要求改成 0721)

总有一天 禁赛一年 劲爆尾杀 本人声称这是本文章最好笑的

crystal.cpp

xi xi,I will win!

subway.cpp

t1,2 is so ez,I will get in the wc.
++rp

migrate.cpp

I have thought 9min,stop to do t4
kawaii t4,back to do t3

g++ -std=c++14 -O2 -static -Wall -Wshadow migrate.cpp -o c

now 15:21,I have got 100+100+0+0=200

fuck 17:22 I have got 100+100+0+0

if my score > 300,I can escape the mid-term exam

maybe one day, I'll get in the JS Province Team

zong you yi tian, just today!

hub.cpp

fuck i can't get into wc