NOIP2021-四川迷惑行为大赏


NOIP 2021 SC 疑惑行为大赏

我作为一个NOIP的场外选手,在第一时间拿到代码之后就打算来看看这个。

为以下选手默哀。

注:SC-0238\number\number.cpp: 的这份文件确实十分恐怖,光表就打了1e6还是1e7个,差点把我的sublime卡死 /qd

所以就不放了.

一些事情

SC-0027 因为骂CCF 被传唤了(

这人是maozx……

借着这个机会和ldyx更新一下(

注释文件人


SC-0015\variance\variance.cpp:
  38  int main() {
  39:   //freopen("variance.in","r",stdin);
  40:   //freopen("variance.out","w",stdout);
  41    scanf("%d",&n);

SC-0083\chess\chess.cpp:
  67  int main(){
  68:   //freopen("chess.in","r",stdin);
  69:   //freopen("chess.out","w",stdout);
  70    int t;cin>>t;

SC-0275\sequence\sequence.cpp:
  27  {
  28:   //freopen("sequence.in","r",stdin);
  29:   //freopen("sequence.out","w",stdout);
  30    

SC-0289\sequence\sequence.cpp:
  16  {
  17:   //freopen("sequence.in","r",stdin);
  18:   //freopen("sequence.out","w",stdout); 
  19    scanf("%d%d%d",&n,&m,&k);

SC-0315\number\number.cpp:
   8  int main(){
   9:   //freopen("number.in","r",stdin);
  10:   //freopen("number.out","w",stdout);
  11    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

SC-0316\variance\variance.cpp:
  24  int main(){
  25: //freopen("variance.in","r",stdin);
  26: //freopen("variance.out","w",stdout);
  27    int p;

调试文件没改人


SC-0044\chess\chess.cpp:
  89    freopen("chess.out","w",stdout);
  90:   //freopen("chess3.in","r",stdin);
  91    int T=read();

我是std人


SC-0309\variance\variance.cpp:
  3  int main(){
  4:  //freopen("stdin","r","variance.in");
  5:  //freopen("stdout","w","variance.out");
  6  


欲言又止的freopen


SC-0164\chess\chess.cpp:
  19  int main(){
  20:   //fre();
  21    

AFO 人

SC-0005\chess\chess.cpp:
  1: //coded by zmy,who is about to AFO.
  2  #include

SC-0005\number\number.cpp:
  1: //coded by zmy,who is about to AFO.
  2  #include

SC-0005\sequence\sequence.cpp:
  1: //coded by zmy,who is about to AFO.
  2  #include

SC-0005\variance\variance.cpp:
  1: //coded by zmy,who is about to AFO.
  2  #include

SC-0059\sequence\sequence.cpp:
  131  /*
  132: AFO
  133  5 1 1 

SC-0129\number\number.cpp:
  66  }
  67: //AFO
  68  //2021-11-20 12:54:43 

SC-0176\sequence\sequence.cpp:
  91  }
  92: //So AFOed.

SC-0197\number\number.cpp:
  3  #define re register
  4: //AFOer
  5  #define num ch-'0'

文明法克人

SC-0214\chess\chess.cpp:
    3  #define ll long long
    4: #define fuck cerr<<"fuck"< q;

  59    vis[make_pair((sx-1)*m+sy,4)]=1;
  60:   fucked[(sx-1)*m+sy]=1;
  61    while(!q.empty())

  64      q.pop();
  65:     if(!fucked[now]) ++ret,fucked[now]=1;
  66      if(eaten || kind==1) continue;

  SC-0365\variance\variance.cpp:
   3  const int N=10007;
   4: int n,a[N];long long fuck=1;
   5  void solve1()

  50    if(n==1){solve1();return 0;}
  51:   for(int i=1;i<=n;i++) fuck*=a[i];
  52:   cout<

F**k CCF 人


SC-0027\sequence\sequence.cpp:
  33    //ofstream out("1.in");
  34:   //fuck_ccf
  35    //ccf_wants_more_money

SC-0042\variance\variance.cpp:
  110  //CCF your mother is died!!!
  111: //Fuck!!!

SC-0204\variance\variance.cpp:
  78    {
  79:     printf("fuckccf ccf has no mother\n");
  80    }

SC-0236\chess\chess.cpp:
  10    printf("ccf?????");
  11:   //fuck ccf
  12    return 0;

SC-0380\chess\chess.cpp:
  51    cin>>t;
  52:   for(register int fuckccf=1;fuckccf<=t;++fuckccf){
  53      cin>>n>>m>>q;

SC-0031/chess/chess.cpp:
  4  {
  5:  cout<<"CCFSB"<
  2: //#define FK pritnf("F**k CCF")
  3  using namespace std;

SC-0301/sequence/sequence.cpp:
  1  #include
  2  // 傻逼CCF毁我青春
  3  int main()
  
SC-0301/variance/variance.cpp:
  1: //We Union Beat CCF
  2: //Wo men lian he da dao CCF
  3  #include

愤恨人 & 希望登榜人


SC-0375\chess\chess.cpp:
  76  //SBCCF毁我前程,我的梦想没了
  77  //啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊
  78  //你这0分保熟吗?
  79: //辣鸡c艹语言,改学fuck brain去了
  80  //啊啊啊啊啊啊啊啊啊
  81  //最后8分钟了
  82  //希望荣登noip迷惑性行为大赏
  83: //最后祝愿CCF族谱升天
  84  //愿你们的服务器电源不再是串联的20个柠檬 

报复未遂人


SC-0318\sequence\sequence.cpp:
  13    }
  14:   //好不容易进了noip,所以Cao Cao Fuck是sb 
  15    //烦死了,要报复一下
  16    while(1){break;}
  17    //算了,“影响恶劣,禁赛三年”我惹不起。哎。。。。。。 

qwq 人


SC-0064\chess\chess.cpp:
  181   }
  182: };//?????????????????qwq 
  183  

SC-0105\chess\chess.cpp:
  24    if(mapp[x][y].col!=-1){
  25: //    cout<<"qwq"<rua)
  152  //   tree.modify(1,x,x);
  153:    if(exp((-(qwq-now))*1.0/T),int> mph,mps,mp,col;

  121  // while(T--) {
  122: //   n = read(); m = read(); qwq = read();
  123  //   for(int i = 1; i <= n; ++i) {

  134  //   }
  135: //   for(int i = 1, color, level, xi, yi; i <= qwq; ++i) {
  136  //     int ans = 0;

SC-0277\variance\variance.cpp:
  15    void dfs(){
  16:     int qwq=0;
  17      var=sum=0;
  18      for(int i=1,pw=1;i<=n;i++,pw*=mx){
  19:       qwq+=pw*(a[i]-1);
  20        var+=a[i]*a[i];

  22      }
  23:     if(mp[qwq])return;
  24:     mp[qwq]=1;
  25      ans=min(ans,var*n-sum*sum);

SC-0279\number\number.cpp:
  12          p.set(i, 1);
  13:         goto qwq;
  14        }

  17      p.set(i, 0);
  18:     qwq:;
  19    }

SC-0364\number\number.cpp:
   6  int x;
   7: bool check(int qwq)
   8  {
   9:   while(qwq)
  10    {
  11:     int tmp=qwq%10;
  12    //  cout<

QAQ 人


SC-0211\variance\variance.cpp:
  22    b[2]=b[1]+b[3]-b[2];
  23:   double QAQ=0;
  24    for(int i=1;i<=n;i++)
  25:      QAQ+=b[i];
  26:   QAQ=QAQ/n;
  27    for(int i=1;i<=n;i++)
  28:      ans+=(b[i]-QAQ)*(b[i]-QAQ);
  29    for(int i=3;i

1926**17 人


SC-0018\variance\variance.cpp:
  8  }
  9: const int N=1e5+5,mod1=998244853,mod2=1e9+9,base1=19260817,base2=997,inf=1e9;
  10  int n,a[N],Pow1[N],Pow2[N];

SC-0032\variance\variance.cpp:
  4  int n,a[o],sd=114514;long long s1,s2;
  5: inline int rnd(){return sd=sd*19260817ll%998244353;}
  6  int main(){

SC-0039\variance\variance.cpp:
  94    freopen("variance.out","w",stdout);
  95:   Read(n);srand(19260817);
  96    for(int i=1;i<=n;i++) Read(a[i]);

SC-0053\variance\variance.cpp:
  28  
  29: std::mt19937 eng(19260817);
  30  

SC-0352\variance\variance.cpp:
  21  const int MAXN = 1e4 + 5;
  22: const ULL base1 = 1992608117, base2 = 19260817;
  23  


女装Flag 人


SC-0351\chess\chess.cpp:
  60  }
  61: //If my score doesn't reach the line of 1=, Kaka will wear Lolita 1145141919810 times 

另外三份也是一样的所以省略。

恶臭人


SC-0032\variance\variance.cpp:
  3  const int o=1e4+10;
  4: int n,a[o],sd=114514;long long s1,s2;
  5  inline int rnd(){return sd=sd*19260817ll%998244353;}

SC-0131\variance\variance.cpp:
  58    ans = calc();
  59:   srand(time(0) ^ 114514); srand(1919810+rand());
  60    while (clock() < 850) {

SC-0183\variance\variance.cpp:
  63  const LL INF = (LL)1e18 + 7;
  64: DRE r{114514};
  65  UID u;

SC-0203\chess\chess.cpp:
  65        G[x][y]=mp(col,lv);
  66:       printf("114514\n");
  67      }

SC-0220\sequence\sequence.cpp:
  19    if(n==5)cout<<40<<'\n';
  20:   else cout<

怒斥出题人 人


SC-0042\sequence\sequence.cpp:
  84  铁定退役了
  85: CCF出的个什么几把烂题!!!
  86  */

两面包夹芝士 人


SC-0301\number\number.cpp:
  2  //Amiya is my daughter(huadiao)
  3: //Wo men lian he dui CCF xing cheng yi ge liang mian bao jia zhi shi
  4  //I love Skadi forever(huadiao)

希望给点分 人


SC-0387\number\number.cpp:
  3  /*
  4: It's my first time at NOIP, so I hope that CCF would give me some points.
  5  */

ORZ zjk 人


SC-0011\variance\variance.cpp:
  35    freopen("variance.out","w",stdout);
  36: //  n=400; // orzjk
  37  //  A[1]=1;

SC-0373\chess\chess.cpp:
  114  /*
  115: sto zjk orz
  116  */

AK IOI 人


SC-0301\chess\chess.cpp:
  1  #include
  2: //_lzh_ AK IOI 
  3  int main()

SC-0364\variance\variance.cpp:
  15  // ruier bao you wo zhe ti you fen qie >=40
  16: // ruier ak ioi
  17  int main()

aknoip 人



SC-0355\number\number.cpp:
   4  bool p[10050000];
   5: struct aknoip
   6  {

   9  int T,n;
  10: bool cmp1(aknoip a,aknoip b){return a.z

Goodbye OI 人 (默哀)


SC-0062\number\number.cpp:
  67  }
  68: //Goodbye-OI

junior 拼写错误人


SC-0368\sequence\sequence.cpp:
   9    cout<<"Bye for the jonior high school\n";
  10:   cout<<"Good luck\n";
  11    cout<<"By Gmt.FFF\n";

kkk保佑人

SC-0375\number\number.cpp:
  //线性质数筛!!!
  //WWX+RZY保佑 i love wwx!!! 
  //kkksc03附体 
  //RNM 1.085S什么意思 

不知道如何描述的 人


SC-0392\chess\chess.cpp:
  85    freopen("chess.out", "w", stdout);
  86:   li zmj2008_AK_IOI = read();
  87:   while(zmj2008_AK_IOI--){
  88      n = read(), m = read(), q = read();

SC-0392\number\number.cpp:
  26  
  27: li zmj2008_love_Nancy;
  28  vector
  • prime; 33 freopen("number.out", "w", stdout); 34: zmj2008_love_Nancy = read(); 35 for(li i = 1; i <= 1e7 + 1; i++){ 40 } 41: while(zmj2008_love_Nancy--){ 42 li x = read();
  • 相关