CSP-S 2025 ZJ 迷惑行为大赏补充

Ectau · 2025-11-07 12:00:18 · 生活·游记

Part 0. 前言

CSP-S 2025 ZJ 迷惑行为大赏 - b1tset

CSP-S2025 ZJ迷惑行为（？）大赏 - LinkCatTree

Part 1. //freopen

大家喜闻乐见的 //freopen 环节。

652 matches across 85 files。

ZJ-S00222

ZJ-S00222\employ\employ.cpp（完整代码）

//freopen("emply.in","w",stdout)
//luogu uid:1017223  y0 y1 kkksc03 CCF chen_zhe bits\stdc++.h
//I'm Nai Long.

ZJ-S00040

ZJ-S00040\club\club.cpp

   88  // 来玩『魔法少女的魔女审判』xxm.
   89  // freopen freopen("club.in","w",stdin);
   90: //freopen("club.in",'r',stdin);

ZJ-S01112

ZJ-S01112\employ\employ.cpp

   15  int main()
   16  {
   17:  //freopen("employ.in","r",stdin);
   18:  //freopen("employ.out","w",stdout);
   19   
   20  //  luogu : Pyrf_uqcat
   21  //  uid : 1137860    
   22  //  %%% _Deer_Peach_ orz
   23   
   24  //   00:45 T1 : 100 pts
   25  //   01:28 T3 : 25 pts
   26  //   02:24 T2 : 16 pts   
   27  //  03:48 T4 : 4 pts
   28  //  Sad Ending.

ZJ-S01395

//Hope to be found。

ZJ-S01395\road\road.cpp（line 61\~67）

//freopen
//freopen
//Hope to be found.
//I've been retired from OI for more than half a year since ninth grade. I once doubted myself if I should to sign up for CSP this year and just now, I thought I couldn't solve T2.
// Luckily, I zhuiyi how to type zuixiaoshengchengshu, which helps me get 50pts;
//16.08 good luck.
//And, welcome all 9 graders to Hangzhou No.2 High School! Even if you're not planning to OI ahead, it's still a good place for learing as well as chouxiang.

ZJ-S01459

这里放的是 sublime text 的匹配结果：

ZJ-S01459\club\club.cpp:
   13   return s*w;
   14  }
   15: void Designant(){//freopen!!!
   16   freopen("club.in","r",stdin);
   17   freopen("club.out","w",stdout);

ZJ-S01459\employ\employ.cpp:
   13   return s*w;
   14  }
   15: void Designant(){//freopen!!!
   16   freopen("employ.in","r",stdin);
   17   freopen("employ.out","w",stdout);

ZJ-S01459\replace\replace.cpp:
   13   return s*w;
   14  }
   15: void Designant(){//freopen!!!
   16   freopen("replace.in","r",stdin);
   17   freopen("replace.out","w",stdout);

ZJ-S01459\road\road.cpp:
   13   return s*w;
   14  }
   15: void Designant(){//freopen!!!
   16   freopen("road.in","r",stdin);
   17   freopen("road.out","w",stdout);

ZJ-S01487

这里放的是 sublime text 的匹配结果：

ZJ-S01487\club\club.cpp:
    1  #include<bits/stdc++.h>
    2  using namespace std;
    3: //freopen?
    4  //long long?
    5  //memset?

ZJ-S01487\employ\employ.cpp:
    1  #include<bits/stdc++.h>
    2  using namespace std;
    3: //freopen?
    4  //long long?
    5  //memset?

ZJ-S01487\replace\replace.cpp:
    1  #include<bits/stdc++.h>
    2  using namespace std;
    3: //freopen?
    4  //long long?
    5  //memset?

ZJ-S01487\road\road.cpp:
    1  #include<bits/stdc++.h>
    2  using namespace std;
    3: //freopen?
    4  //long long?
    5  //memset?

不过这位选手看起来像是在用这里的内容来提醒自己。

ZJ-S01493

ZJ-S01493\replace\replace.cpp（line 170\~173）

/*
代码可能来不及！！！我最终到底四题总共几分
我不能 //freopen 
*/

ZJ-S01709

ZJ-S01709\club\club.cpp

   65  }
   66  /*
   67: //freopen("club.in","r",stdin);
   68: //freopen("club.out","w",stdout);
   69  上面是两行不明意义的代码，但我知道有人喜欢看。
   70  在这里先说一件事：我是珊瑚宫心海的dog。

两位 //freopen 领域大手子：

ZJ-S00726

ZJ-S00726\employ\employ.cpp

出现了 336 次 //freopen()

:::info[完整代码]

//Welcome to my code.(^.^)/
// u see,it is a fake and so bad code,hoping u can see something ineresting in it.Have a good time!

/*
a small stage
but it was deleted,xd.
*/
#include<stdio.h>
#define rep(i,s,e) for(int i=(s);i<=(e);++i)
#define _rep(i,s,e) for(int i=(s);i<(e);++i)
#define rev(i,s,e) for(int i=(s);i>=(e);--i)

const int N=1e5+10,mod=998244353;

int n,m,c[N],s[N],vis[N],b[N];

long long ans=0;

void dfs(int k){
    if(k==n+1) {
        int lose=0,win=0;
        rep(i,1,n) {
            if(s[i]==0) {
                lose++;
                continue;
            }
            if(lose>=c[b[i]]) lose++;
            else win++;
            if(win>=m) {
                ans++;
                return;
            }
        }
        return;
    }
    rep(i,1,n) {
        if(vis[i]) continue;
        vis[i]=1,b[k]=i;
        dfs(k+1);
        vis[i]=0;
    }
}

int main() {
    int flag=1;
    freopen("employ.in","r",stdin);
    freopen("employ.out","w",stdout);
    scanf("%d%d",&n,&m);
    rep(i,1,n) {
        scanf("%1d",&s[i]);
        if(!s[i]) flag=0;
    }
    int cnt=0;
    rep(i,1,n) {
        scanf("%d",&c[i]);
        if(!c[i]) cnt++;
    }
    if(flag==1) {
//      return 0;
//      if(cnt<m) return printf("0"),0;
//      printf("%d ",cnt);
        long long t=1;
        while(cnt--) t=t%mod*(cnt+1)%mod;
        ans=t;
        printf("%lld",ans);
        return 0;
    }
    dfs(1);
    printf("%lld",ans);
    return 0;
}
//ah...啊 唉……
/*
打个标记
//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen() 
//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen() 
//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen() 
//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen() 
//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen() 
//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen()//freopen() 

写游记吧，摆烂了
红色的dev-c++还打不了中文
T1想到解法花了十几分钟，也还好。然后呢，实现花了一个来小时，我也是唉……
现在17:01了，还是只做出了T1，T2做了一下特殊性质A，然后呢样例都没过，有几个测试点没乡村的，就是裸的最小生成树板子，可是啊
打到一半，忘掉了，呵呵
T3看不懂，T4更闷逼，特殊性质打不了，我真是个S (9+4)  (谁知道代码里写脏话会怎么样，反正我不敢试咯) 
不管咯，摆烂吧。 
现   17:06 
17:14 Kruskal裸的板子想起来了，就是不知道对不对
17:15 吃根士力架
17:18 留一点待会吃
17:19 继续想T2吧
17:24 两个选择 op1 继续想T2        op2 去想T3暴力 交给时间决定吧 time(0)%2+1 
17:26 结果是2，我去想T3暴力了
17:27 好像无法暴力，T3不知道要进行多少次替换，去看看特殊性质 
17:30 还有1h- 我……真的是……唉……算了算了，AFO就AFO吧，拜拜,OI
string action;
//...
if( "Away From OI" == action) printf("AFO");
//...

...
AFO....

现在是17:34，想T4暴力 
又emo了啊，呵呵
打竞赛啊，要的就是抗压能力，尤其是信息，可我还是要撑不住了呢

17:36 那么，现在干什么？在这发牢骚？
将决定交给时间吧 
time(0)%2+'1'
0:做题{0:想T2  1:想T4}
1:在这继续摆{0:发呆        1:继续写这一篇}

srand(time(0))
rand()%30
进行以上活动时间，接下来就这么干咯，一直到18:15吧
现在17:42 

时间告诉我要写这一篇再写29min
....
6
17:47 不知道干啥 
17:49 打T4暴力 ,咳咳咳，又加了点东西
17:57 赶紧打暴力 
18:02 暴力RE了 
18:04 愣住了
18:05 Debug... 
18:11 傻掉了 
18:13 过会调 
18:15 我是傻 星号 距离考试结束还有15min
18:16 DeBug 
18:18 我特喵的真是傻……文件名忘改了，怪不得一直输出0 
18:21 还能争 
18:23 放弃 
*/

:::

ZJ-S01522

ZJ-S01522\road\road.cpp

出现了 157 次 //freopen（以及大量的 I AK CSP 和 RP++）

:::info[完整代码]

#include<bits/stdc++.h>
using namespace std;
const int N=1e4+10;
vector<int>e[N];
int n, m, k;
int main(){
    freopen("road.in", "r", stdin);
    freopen("road.out", "w", stdout);
    cin>>n>>m>>k;
    for (int i = 1; i <= n;i++){
        int u, v, w;
        cin >> u >> v >> w;
    }
    cout << k;
    return 0;
}
/*
（我要上迷惑行为大赏！）
证明1+1=3
设x=0
则2x=3x
可得2=3
由于1+1=2
并且2=3
故1+1=3
(考场终于没有XXS了)
论浙江省有强悍的初中吗？
包有的
所有锦绣育才教育集团旗下的初中和小学都是强校！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
JXYC万岁！
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
RP++
I AK CSP
*/
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);
//freopen("road.in","r",stdin);

:::

Part 2. luogu

Searching 8069 files for "luogu"

53 matches across 45 files

ZJ-S00002

ZJ-S00002\road\road.cpp

    1  #include <iostream>
    2  using namespace std;
    3: // i love luogu
    4  // i hate (d-1)(d-1)(g-1)
    5  int main()

ZJ-S00279

ZJ-S00279\employ\employ.cpp

   46          dfs(1, 0);
   47      else
   48:         ans = 751187; // +luogu wuyukai0403(751187) wuyukai0403_alt(991249)
   49      printf("%llu\n", ans);
   50  }

ZJ-S00472

ZJ-S00472\replace\replace.cpp（line 131\~146）

    /*
    我是真写不出来了，今年的题目怎么出的这么邪门啊。
    练的全部都没有考到，我明明所有模拟赛都有200pts++的，为什么今天只能疯狂骗分啊？
    为什么今年的CSP好像每道题目都有绿+~蓝啊？
    怎么会这么难写（生气）
    考完去luogu上一看发现清一色蓝题我就老实了
    现在的状态是T1没切出来，T2没切出来，T3彻底疯狂
    我考啥啊考，最后一年AFO了，还是没能有好结果
    我的所有练习全都在四个小时里面白费了
    好绝望，NOIP会不会良心一点啊？
    为什么今年这么抽象这么抽象，我真不理解，为什么大家好像都会写的样子？
    会不会是因为我昨天晚上一点钟睡没睡好
    才导致现在这副样子的
    我明明喝了四瓶咖啡续命，但是这个题目在我眼里就是好难啊
    为什么为什么为什么为什么为什么。 
    */

ZJ-S00475

ZJ-S00475\club\club.cpp（line 1\~4,93\~96）

/*
this fvv, whose luogu uid is 869164, cannot solve T1
fc c
ukcf
*/

/*
guys im gonna be afo
so just lemme be one of the oier listed in the 'misunderstanding behaviors show'
*/

ZJ-S00475\road\road.cpp（line 91~98）

/*
我是sb
我写不出来T2
md昨天刚背的板子
一到考场上脑子里全是空白的 
准备迎接我的 AFO time 了 
——luogu 869164
*/

ZJ-S00652

\ZJ-S00652\road\road.cpp:

   92  /*
   93  
   94: luogu602458. 
   95  
   96  Goodbye, world.

ZJ-S00787

\ZJ-S00787\club\club.cpp（line 57\~61）

//Luogu user :I_Love_Furina
//Luogu uid 1113349
//Genshin Impact uid 275713829
//Fuirna!!!
//RP++

这位选手甚至有两个名为 Furina 的结构体：

struct Furina{
    int a,b,c,mx,mx2,v;
    bool operator<(const Furina B)const{return mx-mx2<B.mx-B.mx2;}
}a[N];

struct Furina{
    int u,v,w;
    bool operator<(const Furina B)const{return w>B.w;}
};
priority_queue<Furina>q,Q[15];

ZJ-S00893

\ZJ-S00893\employ\employ.cpp（line 3\~43）

/*
感觉要 AFO 了
抱歉，最亲爱的小x
抱歉，每一个祝福过我的人
抱歉，帮助过我的长辈、老师、同学和网友
大概这就是朽木不可雕吧 
天生我材必有用的前提是是材 

感谢 CCF 出题组
现在由衷地感觉我的存在不仅地狱而且笑话 

AB 写了三个小时还没写出来
一开始看到 A，傻了
看了看 B，感觉可做，看了数据范围，傻了
早上 J 组 C 也不会，我就是个废物吧
毕竟也属于是初三了，哎。 

而且我还不是一般的 jocker
我替前主导打工勤勤恳恳搞了两个月 OI
工作日尽量保持着每天 10 题的水准
也在模拟赛里切过一两次蓝
但是有用吗？
正赛的时候，各种心悸手抖，心态直接炸了
脑子里不知道装的什么

我甚至没有想过我到底喜欢 OI 还是 whk
虽然大概都不喜欢，我讨厌内卷 
但是这 60 天还是很少为自己想过
可能我在玩的游戏里面真正喜欢的只有原神

打算再骗点分就走了。
可能我天生就没有什么优点吧。
期望得分：J 300+，S 0 

再见，小 x。 
再见，OI ？ 

by @fly_x (luogu)
*/

// while(rp++);

ZJ-S01060

ZJ-S01060\employ\employ.cpp:（line 102\~126）

/*
感觉没有什么可以拿的分了啊
我还是太菜了
100+[50,64]+10+[12,16] = [172,190]
但愿不要挂分！
感觉今年题目比去年难啊
不过我已经释怀了
至少打的比去年好
本来就是whk选手没什么好纠结的
T2居然是图论
一眼最小生成树，不会建模qwq
估计又是全机房垫底 
人生最后一次CSP-S了，大概率2= 
6钩可能有吧、、、
自己尽力了，感觉这几道题目没有我强项 
NOIP继续加油吧！
Luogu uid:713343
宵宫梦男 & 奶味蓝
唯一老婆：宵宫
主担：Miyeon（团粉偏面） 
好感霞之丘，由比滨结衣，NMIXX，izna
关注 Luogu 713343 谢谢喵！
哦对了Miyeon solo 2在大家看到这个代码之前发布了，多多关注谢谢喵！
米哈游加强宵宫！ 
*/

ZJ-S01112

ZJ-S01112\employ\employ.cpp:

   18   //freopen("employ.out","w",stdout);
   19   
   20: //  luogu : Pyrf_uqcat
   21  //  uid : 1137860    
   22  //  %%% _Deer_Peach_ orz

ZJ-S01157

ZJ-S01157\employ\employ.cpp:

   45  //freopen("road3.in","w",stdin);
   46  //froepen("road.out","r",stdout);
   47: //luogu-??????
   48  //ZJ-S??????
   49  //probably AFO

ZJ-S01157\replace\replace.cpp:

   20  //freopen("road3.in","w",stdin);
   21  //froepen("road.out","r",stdout);
   22: //luogu-733354
   23  //ZJ-S??????
   24  //probably AFO

ZJ-S01161

ZJ-S01161\employ\employ.cpp:（line 49\~51）

    return 0;//这就是我和dfs热血沸腾的组合技啊啊啊啊啊啊啊啊啊啊啊 看我不卡爆你测评机！！！ 
    //不豪我似乎想到了dp方程！！！但是tmd时间来不及了
    //如果这道题真是tmd用dp做的记得谁看见了来锤我luoguuid566190我是歌者啊啊啊啊啊啊

ZJ-S01181

ZJ-S01181\road\road.cpp:

    5   //freopen("road.in","r",stdin);
    6   //freopen("road.out","w",stdout);
    7:  //Luogu:yaonainai
    8   return 0;
    9  }

ZJ-S01221

ZJ-S01221\club\club.cpp:

    3  const int N=1e5+5;
    4  
    5: //luogu SproutPower
    6  
    7  //duo ce yao qing kong.  duo ce yao qing kong.  duo ce yao qing kong.  duo ce yao qing kong.  duo ce yao qing kong.

ZJ-S01256

ZJ-S01256\road\road.cpp:（line 170\~200）

/*
I spent two hours writing this code
But it can't Accept
And now I only have one hour (qwq)
What can I say
What can I say
What can I say
Manba out

oh no , only have 10 min
I have only 158 pts
no
what can I say

sto %%% Ms potato %%% orz

sto %%% haochengwang920 %%% orz

sto %%% Loop1st %%% orz

^(Luogu user name)^
|                 |

Don't ask my Luogu uid

Location: Zhe Jiang(ZJ)

Tang Tang Tang

*/

ZJ-S01273

ZJ-S01273\club\club.cpp:（line 65\~74）

/* 我要弄whk了qwq
我也该退役了qwq
这次好难啊qwq
再见编程qwq
不会做qwq
再见qwq
啊qwq
qwq
luogu:_wronganswer_
*/

ZJ-S01342

ZJ-S01342\club\club.cpp:

    5  using namespace std;
    6  
    7: // luogu uid: 486677
    8  // uid = 260985 shi xiao mao niang
    9

ZJ-S01344

ZJ-S01344\club\club.cpp:

   91  //%%% myself(doge)
   92  
   93: //luogu uid = 1300065 ? (binary_carrots)
   94  
   95  /*

ZJ-S01344\road\road.cpp:（line 118\~131）

//C++ Searching Program - Sunior (CSP-S)

// 16:00 I have eaten all my chocolate!!! [cry][cry][cry][cry][cry]
// wo yao shang mi huo xing wei da shang!!!
//luogu uid = 1300065 ?
//by binary_carrots
//Don't lost hope,maybe you can make it.
//Man!What can I say!
//sdfsdgwotregduxhgdfjowthuesbdfjslkzghiworhaehflkdhzknawkqpoosoasfndkszxdhiwaueyrhralsdjnfklashtwiehrueiasdnklzsk
//100+(>=70)+0+10=(>=180)pts

//I love CCF!!!

//key:Ren5Jie4Di4Ling5%

:::info[代码] 人类迷惑行为大赏欢迎您。

club.cpp（line 79\~106）

// wo yao shang mi huo xing wei da shang

//ZJ-J01310
//ZJ-J01344

//15:49 AC

//%%% Clv_Csy
//%%% Brute_Force
//%%% yyc
//%%% fede
//%%% __Segment__
//%%% myself(doge)

//luogu uid = 1300065 ? (binary_carrots)

/*
  rrr   rrr      p ppppppppppp            ++                      ++
   rr rr          ppp        pp           ++                      ++
   rrr            pp         pp           ++                      ++
   rr             pp        pp  ++++++++++++++++++++++  +++++++++++++++++++++
   rr             ppppppppppp   ++++++++++++++++++++++  +++++++++++++++++++++
   rr             pp                      ++                      ++
   rr             pp                      ++                      ++
   rr             pp                      ++                      ++
   rr             pp                      ++                      ++
   rr             pp                      ++                      ++
*/

road.cpp （line 118\~131）

//C++ Searching Program - Sunior (CSP-S)

// 16:00 I have eaten all my chocolate!!! [cry][cry][cry][cry][cry]
// wo yao shang mi huo xing wei da shang!!!
//luogu uid = 1300065 ?
//by binary_carrots
//Don't lost hope,maybe you can make it.
//Man!What can I say!
//sdfsdgwotregduxhgdfjowthuesbdfjslkzghiworhaehflkdhzknawkqpoosoasfndkszxdhiwaueyrhralsdjnfklashtwiehrueiasdnklzsk
//100+(>=70)+0+10=(>=180)pts

//I love CCF!!!

//key:Ren5Jie4Di4Ling5%

replace.cpp（line 31）

//盲猜乱码

employ.cpp（line 45）

//rp++

:::

ZJ-S01395

ZJ-S01395\replace\replace.cpp:（line 69\~78）

/*
//freopen
luogu 688674
bye, OI.
Once I thought I was still ok after whking for 4 months, but it's obviously I won't be over 200 pts.
May I participate NOIP ? But will it make any sense ?
You have been AFOed, but why holding such a dream ?
Getting nothing, but unwilling to give up...
18:26 bye.
*/

ZJ-S01423

ZJ-S01423\replace\replace.cpp:

    8   return 0;
    9  }
   10: //luogu @chemical_reaction uid:1706408
   11  //**** CCF

ZJ-S01485

ZJ-S01485\employ\employ.cpp:

   72  // Hello, if someone is looking at this page.
   73  // ...Who am I?
   74: // Well, I am Ayanami_404, my Luogu UID is 983943.
   75  // Why am I telling you my UID?
   76  // I don't know.
   ..
   87  // Chtholly KAWAIIIIIIIIIIIIIII
   88  // I love CCF, give me 1= pls
   89: // I love Luogu, pls pls pls pls
   90  // I love OI, so pls give me 1= 1= 1= 1= 1=
   91  // rp+=INF;

ZJ-S01497

ZJ-S01497\employ\employ.cpp:（line 62\~70）

//feropen()
//freopen("employ.in","r",stdin);
//关注Just_A_Sentence(LuoguUid=502314)谢谢喵
//15:37 过T1
//17:29 战绩100+0+0+24=124，还能蒸！
//17:43 战绩 100+0+25+24=149
//18:07 100+0+50+24=174
//18:18 100+0+[50,70]+24=[174,194]完蛋了
//18:26 100+[0,16]+[50,70]+24=[174,210]寄

ZJ-S01625

ZJ-S01625\club\club.cpp:

   48  那一天的挂分挂分起来，那一天的AFO AFO起来
   49  CCF以挂分痛吻我，我却报之以歌
   50: If I can up mi huo sth. big show,please close pig luogu:slzxzhengguo123(I think my English is very nice!!!)
   51  */

ZJ-S01668

ZJ-S01668\club\club.cpp:

    1: //Luogu 743373-Vitamin_B:)
    2  //ZJ-S01668
    3  #include <bits/stdc++.h>

ZJ-S01668\employ\employ.cpp:

    1: //Luogu 743373-Vitamin_B:)
    2  //ZJ-S01668
    3  #include <bits/stdc++.h>

ZJ-S01668\replace\replace.cpp:

    1: //Luogu 743373-Vitamin_B:)
    2  //ZJ-S01668
    3  #include <bits/stdc++.h>

ZJ-S01668\road\road.cpp:

    1: //Luogu 743373-Vitamin_B:)
    2  //ZJ-S01668
    3  #include <bits/stdc++.h>

ZJ-S01763

ZJ-S01763\club\club.cpp:

   74  /*
   75  By ZJ-S01763.
   76: Luogu UID:1086453.
   77  */
   78

ZJ-S01763\employ\employ.cpp:

   44  /*
   45  By ZJ-S01763.
   46: Luogu UID:1086453.
   47  */
   48

ZJ-S01763\replace\replace.cpp:

   11  /*
   12  By ZJ-S01763.
   13: Luogu UID:1086453.
   14  */
   15

ZJ-S01763\road\road.cpp:

   16  /*
   17  By ZJ-S01763.
   18: Luogu UID:1086453.
   19  */
   20

ZJ-S01807

ZJ-S01807\club\club.cpp:

   48  /*
   49  //freopen
   50: zai luogu shang guanzhu uid 1283951 !!!!
   51  */
   52

ZJ-S01886

ZJ-S01886\club\club.cpp:

  123  }
  124  //I want go to the qiguaixingweidashang!
  125: //luogu uid：562443
  126  //Go for it!
  127  //Ren5Jie4Di4Ling5%

ZJ-S01886\employ\employ.cpp:

   65  }
   66  //I want go to the qiguaixingweidashang!
   67: //luogu uid：562443
   68  //Go for it!
   69  //Ren5Jie4Di4Ling5%

ZJ-S01886\replace\replace.cpp:

   35  }
   36  //I want go to the qiguaixingweidashang!
   37: //luogu uid：562443
   38  //Go for it!
   39  //Ren5Jie4Di4Ling5%

ZJ-S01886\road\road.cpp:

   79  }
   80  //I want go to the qiguaixingweidashang!
   81: //luogu uid：562443
   82  //Go for it!
   83  //Ren5Jie4Di4Ling5%

ZJ-S01892

ZJ-S01892\employ\employ.cpp:

    1  // HSR Elder UID: I have forgotten
    2  // HSR New UID: 167851258
    3: // Luogu Username: hinin
    4  
    5  // Expect: 0pts

ZJ-S01892\replace\replace.cpp:（line 1\~36）

// Homeward you come, distant wind
// Aglaea: Goodbye Cifera.
// Agy, Can you hear me? Say something. Anything. Please...
// Expect: 0pts

// The whole contest(CSP-S): maybe 96pts
// The whole contest(CSP-J): maybe 364pts

// HSR Elder UID: I have forgotten
// HSR New UID: 167851258
// AcWing Username: nekoboy
// Luogu Username: hinin

// A Student at Grade Nine

// No Mid-Term Examination on Double-Eleven!

// DP on string, right?
// No DP PLEASE! I "LOVE" CCF!
// Not DP?
// Trie?(x) KMP? Prefix Function?
// But I don't review them...
// How about DP with Prefix Function? :(

// No BFS, IDDFS, the shortest path algorithm and LCA
// No Trie, segment tree and fenwick array
// No eular sieve, Phi function and extend GCD
// I have reviewed nothing...

// Why not review DP? 
// All right. That's not a template. 
// Maybe it need to be practiced every day?

// Who say no KMP in CSP-S in a QQ group named Luogu User 1 Group?

// Irontomb or CCF(

ZJ-S01897

ZJ-S01897\road\road.cpp:

  150  }
  151  //I really want to win!
  152: //luogu uid 734379
  153  //winwiwnwinwniwinwinws

Part 3.拼写错误

Searching 8069 files for "empoly"

11 matches across 6 files

ZJ-S00006

ZJ-S00006\employ\employ.cpp:

   15  int main()
   16  {
   17:  freopen("empoly.in","r",stdin);
   18:  freopen("empoly.out","w",stdout);
   19   cin>>n>>m;
   20   cin>>st;

ZJ-S00166

ZJ-S00166\employ\empoly.cpp:

   32  
   33  int main() {
   34:  freopen("empoly.in", "r", stdin);
   35:  freopen("empoly.out", "w", stdout);
   36   ios::sync_with_stdio(false);
   37   cin >> n >> m >> s;

ZJ-S00540

ZJ-S00540\employ\employ.cpp:

    3  using ll=long long;
    4  int main(){
    5:  freopen("empoly.in","r",stdin);
    6:  freopen("empoly.out","w",stdout);
    7   cout<<2;
    8   return 0;

ZJ-S01819

ZJ-S01819\employ\empoly.cpp:

    7  int main()
    8  {
    9:  freopen("empoly.in","r",stdin);
   10:  freopen("empoly.out","w",stdout);
   11   cin>>n>>m>>s;
   12   for(int i=0;i<s.size();i++)

ZJ-S01851

ZJ-S01851\employ\employ.cpp:

   11  {
   12   freopen("employ.in","r",stdin);
   13:  freopen("empoly.out","w",stdout);
   14   cin>>n>>m;
   15   cin>>s;

ZJ-S01869

ZJ-S01869\employ\empoly.cpp:

   10  
   11  signed main(){
   12:  freopen("empoly.in","r",stdin);
   13:  freopen("empoly.out","w",stdout);
   14   ios::sync_with_stdio(false),cin.tie(0);
   15

Part 4. hope & see

我们所可以自慰的，想来想去，也还是所谓对于将来的希望。

希望是附丽于存在的，有存在，便有希望，有希望，便是光明。

——P5291 [十二省联考 2019] 希望

~虽然这一段话和这篇文章没有什么关系~

Searching 8069 files for "hope"

ZJ-S00066

ZJ-S00066\road\road.cpp:

   88  /*
   89  What a... But I just prepared Kruskal...
   90: O(mlogm+2^k*knlogkn),extremely large!!! Thus,I sincerely hope:
   91  That's what"Intel Core Ultra 9 285K CPU @ 3.70 GHz"make differences!
   92  But TLE on"road3.in",WA on"road4.in",maybe gets 0 pts poorly? AFO...

ZJ-S00315

ZJ-S00315\club\club.cpp:

    2  using namespace std;
    3  const int maxn=1e5+1;
    4: int n,t,to=0,peo[4]={},hope[maxn]={};
    5  struct l{
    6   int ff,name,who;
    .
   36       for(int i=1;i<=to;i++){
   37           //cout<<peo[1]<<" "<<peo[2]<<" "<<peo[3]<<endl;
   38:          if(hope[towards[i].name]==0&&peo[towards[i].who]<n/2){
   39               cout<<towards[i].name<<"  "<<towards[i].who<<endl;
   40:              hope[towards[i].name]=1;
   41               ans+=towards[i].ff;
   42               peo[towards[i].who]++;
   ..
   49       peo[2]=0;
   50       peo[3]=0;
   51:      memset(hope,0,sizeof(hope));
   52       
   53   }*/
   ..
   55  using namespace std;
   56  const int maxn=1e5+1;
   57: int n,t,to=0,peo[4]={},hope[maxn]={};
   58  struct l{
   59   int ff,name,who;
   ..
  109       for(int i=1;i<=to;i++){
  110           //cout<<peo[1]<<" "<<peo[2]<<" "<<peo[3]<<endl;
  111:          if(hope[towards[i].name]==0&&peo[towards[i].who]<n/2){
  112               cout<<towards[i].name<<"  "<<towards[i].who<<endl;
  113:              hope[towards[i].name]=1;
  114               ans+=towards[i].ff;
  115               peo[towards[i].who]++;
  ...
  122       peo[2]=0;
  123       peo[3]=0;
  124:      memset(hope,0,sizeof(hope));
  125       }
  126       for(int i=1;i<=n;i++){

ZJ-S00315\club\未命名4.cpp:

    2  using namespace std;
    3  const int maxn=1e5+1;
    4: int n,t,to=0,peo[4]={},hope[maxn]={};
    5  
    6  struct ll{

ZJ-S00830

ZJ-S00830\road\road.cpp:（line 9\~19）

  /*
    2025 take part in CSP-S and here is my experence：
    time flies so quickly
    last time I took part in is two years ago
    the diffiulies of the problem is rising a lot;
    I can't work out the first problem
    but I had tried my best
    next year maybe I will come back again
    and then I will AK 
    hope other OIers can get the scores they want 
    */

ZJ-S00890

ZJ-S00890\employ\employ.cpp:（line 2\~62）

/*
* employ.cpp
* 
* Copyright 2025 Administrator <Administrator@S16202-C50>
* 
* 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.
* 
* 
*/
/*
* employ.cpp
* 
* Copyright 2025 Administrator <Administrator@S16202-C50>
* 
* 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.
* 
* 
*/
/*
* 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.
* 
*/

ZJ-S01294

ZJ-S01294\employ\employ.cpp:（完整代码）

#include<bits/stdc++.h>
using namespace std;
void hey() {
    freopen("employ.in","r",stdin);
    freopen("employ.out","w",stdout);
}
signed main() {
    hey();
    cout<<"i love xujiajing so much!!!!!!!!!";
    cout<<"how i hope i can marry her!!!!!!!";
    return 0;
}

ZJ-S01344

ZJ-S01344\road\road.cpp:

  122  //luogu uid = 1300065 ?
  123  //by binary_carrots
  124: //Don't lost hope,maybe you can make it.
  125  //Man!What can I say!
  126  //sdfsdgwotregduxhgdfjowthuesbdfjslkzghiworhaehflkdhzknawkqpoosoasfndkszxdhiwaueyrhralsdjnfklashtwiehrueiasdnklzsk

ZJ-S01364

ZJ-S01364\club\club.cpp:（line 103\~132）

/*
16:42 got 73 pts(finish T1,T2's wrong answer)
16:44 have no idea for T3 but BF can get maybe 10 pts?
17:02 delicious
17:02 found a mistake
17:16 deliuious
17:16 maybe found how to solve T3-B
17:37 BF
17:44 can't solve T3-B
17:44 I think ZHX has already AKed
17:59 finish T4 BF(n<=10)
17:59 all:25+48+25+8=106
18:17 check the file and freopen
18:18 all right
*/

/*
rp++

I can't get more score.
I can't make it.
Only hope -J 400

If T1 AC,I will get 181pts and maybe 1=
but

Hope CCF's data is water.

End here
*/

ZJ-S01395

ZJ-S01395\road\road.cpp:

其实在前面放过一次（

   61  //freopen
   62  //freopen
   63: //Hope to be found.
   64  //I've been retired from OI for more than half a year since ninth grade. I once doubted myself if I should to sign up for CSP this year and just now, I thought I couldn't solve T2.
   65  // Luckily, I zhuiyi how to type zuixiaoshengchengshu, which helps me get 50pts;

ZJ-S01436

ZJ-S01436\club\club.cpp:

    5  club
    6  oh no. skipped at 15:15. etw ~ 40pts
    7: Finally passed all pretests, hope that there's no MLE.
    8  I have become schlecter, honestly speaking. at 17:36.

ZJ-S01848

ZJ-S01848\road\road.cpp:

   90  1 1 8 2 4
   91  100 1 3 2 4
   92: AC i hope
   93  */
   94

ZJ-S01948

ZJ-S01948\road\road.cpp:（line 82\~111）

/*
Regard every village as a city;
Build a miniumn tree;
Finally check if a village don't make use, then kill it;
make use means connecting two cities.
That's all my thoughts.

17:17
Well, I find it completely wrong;
As the sample, this code would bridge the second village because it thought this point must be connected;
I need to find a better algorithm.
Can we kill each villlage,then check whether it benefits or not?
This can be tried.
To the sky blue archive.
(p.s.:I find these words are also blue.)

18:03
I find my code get worse,going to the toilet.

18:07
I've given up struggling, using the former algorithm which may cheat some extra points.
At last, I failed to suceed,resulting to be a normal senior in senior high school.

18:23
Only 7min left.
I use a one-by-one O(1024m + mlogm) algorithm.
Hope:over 0 pts.

Hope to be seen.
*/

25 matches across 12 files

Searching 8069 files for "see"

ZJ-S00475

ZJ-S00475\replace\replace.cpp:（line 1\~7）

/*
if u see this
it means that i will afo
lets play a game
play nm play再不写暴力就没时间了
我要上迷惑行为大赏 uid 869164 
*/

ZJ-S00519

ZJ-S00519\employ\employ.cpp:（line 26\~39）

/*
//freopen("employ.in","r",stdin);
//freopen("employ.out","w",stdout);

wow end no say but want to be seen dont konw bad or good so nothing but a thought push to show however which it 
so it trouble  if can break the trouble maybe will better but it a circle cicle inside circle 
awa someone ehglish bad but it used easy so just it
if with chinese
Ei ye mei you she me te bie dong ren de gu shi suo yi shuo ye zhi neng kao zhu shi lai bou ren yan qiu le hao gan ga
fan zheng zhe xie ye mei ren hui translate le
soory someone ping ying bad too
zzyb say goodbye
who lose language on computer
*/

ZJ-S00863

ZJ-S00863\employ\employ.cpp:

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

int main()
{
    //60+64+25+0=149
    //maybe 2=
    //next year,see you.
    //...
    return 0;
}

ZJ-S01009

ZJ-S01009\club\club.cpp:（line 289\~294）

It seems that I'm not a good OIer......
But I love OI at all.
I love C++ a lot.
However I don't have more time to study it now.
Wish good luck.
                    --CN_emo_ 2025/11/1

ZJ-S00818

ZJ-S00818\employ\employ.cpp:（line 10\~11）

/*Time's gone.I haven't got time to finish this task.
SEE YOU NEXT TIME "ACFAILD"[1] "ACFAILD"[1] "ACFAILD"[2]*/

Part 5. 后记

这篇文章到这里就算是结束了。可以看到这篇位置相较于一般的人类迷惑行为，缺少了很多的锐评。~~这是因为我不会写。~~

还有一个特点，就是查找了 hope 这个单词。笔者在浏览选手们的代码时，经常看到有很多选手在代码的注释里表达了自己想要上人类迷惑行为的愿望，但是笔者在翻看其他人的人类迷惑行为中，并没有看到这些人的代码。

于是就有了查找 hope 这个单词的念头。不过一定还是有很多选手想要上人类迷惑行为但是没有被笔者找到，笔者对此深感抱歉。

Part -1: 补充的补充

既然这篇文章名叫“迷惑行为大赏补充”，那么还是要补充一下前言里第二篇文章里没有显示出来的代码。

ZJ-S00046

/*
    这是一个诈骗，为了让你看到一个AFOer的自白。 
    2次了，现在初二
    Only J1=,S无 
    我的CSP与OI生涯就要画上句点了。
    18:20 T1勉强60分，T260分,T3,4 0分
    [120],这个成绩在ZJ就像一个【】
    我从初一学起，或是因为兴趣，或是因为热爱。 
    但这都不重要了。
    但这都无意义了。
    我追忆过去，发现我的过往总是在whk-摸鱼-颓废-水题中循环 
    我似乎从来没有真正努力过。
    但我似乎努力过。 
    不对！
    如果我努力了，为什么会是这个结果呢？
    为什么呢？
    这都不重要了，不是吗？
    天赋使然，我或许真的不适合OI
    天赋使然，我或许真的不适合ZJ
    天赋使然，我或许真的只能走whk
    但这都不重要了。
    但这都无意义了。
    在有我所不乐意的whk里，我不愿去；
    在有我所不乐意的OI里，我不愿去；
    在有我所不乐意的【你】所期望的NOIP里，我不愿去；
    而连【你】，我也要抛弃了。
    呜呼呜呼，我不如彷徨于【】！ 
    再见了，CSP
    再见了，OI
    再见了，信奥 
    再见了——再也不见 
    如果你能看见我的话，你愿意安慰我吗？
    ——但这也没有意义了。
    祝愿@ghc1024,@Liam_Zhaoqiang…… 考好点吧 
    18：27 结束了。 
    AFOed——ZJS00046 
*/

ZJ-S00639

#include<bits/stdc++.h>
#define int long long 
using namespace std;
signed main () {
//  freopen("employ.in", "r", stdin);
//  freopen("employ.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int rp = 1e9;
    for (int i = 1; i <= 666666; i ++ ) {
        rp++;
    }
}
/*
世界上有999朵花，而你是我独一无二的玫瑰 
如果你下午六点要来，那我便从两点钟就开始期待 

或许是我最后一次打比赛了
祝我一切顺利
OI一场 很开心能认识你 
*/

ZJ-S00893 和 ZJ-S00726 的代码上文中有，这里不再重复。

以及如果用 dev-cpp 打不开或者 sublime 打开之后是乱码的，可以尝试用 vscode 或者记事本打开。

最后的最后，祝大家 rp++。

全文完。

upd on 25/11/9 21:00。

字数统计：41600 字符。

CSP-S 2025 ZJ 迷惑行为大赏 补充

Part 0. 前言

Part 1. //freopen

ZJ-S00222

ZJ-S00040

ZJ-S01112

ZJ-S01395

ZJ-S01459

ZJ-S01487

ZJ-S01493

ZJ-S01709

ZJ-S00726

ZJ-S01522

Part 2. luogu

ZJ-S00002

ZJ-S00279

ZJ-S00472

ZJ-S00475

ZJ-S00652

ZJ-S00787

ZJ-S00893

ZJ-S01060

ZJ-S01112

ZJ-S01157

ZJ-S01161

ZJ-S01181

ZJ-S01221

ZJ-S01256

ZJ-S01273

ZJ-S01342

ZJ-S01344

ZJ-S01395

ZJ-S01423

ZJ-S01485

ZJ-S01497

ZJ-S01625

ZJ-S01668

ZJ-S01763

ZJ-S01807

ZJ-S01886

ZJ-S01892

ZJ-S01897

Part 3.拼写错误

ZJ-S00006

ZJ-S00166

ZJ-S00540

ZJ-S01819

ZJ-S01851

ZJ-S01869

Part 4. hope & see

ZJ-S00066

ZJ-S00315

ZJ-S00830

ZJ-S00890

ZJ-S01294

ZJ-S01344

ZJ-S01364

ZJ-S01395

ZJ-S01436

ZJ-S01848

ZJ-S01948

ZJ-S00475

ZJ-S00519

ZJ-S00863

ZJ-S01009

ZJ-S00818

Part 5. 后记

Part -1: 补充的补充

ZJ-S00046

ZJ-S00639

CSP-S 2025 ZJ 迷惑行为大赏补充