LN CSP-S2迷惑行为大赏

ビリビリ · 2020-11-11 15:29:25 · 个人记录

int main(){
    freopen("julian.in","r",stdin);
    freopen("julian.out","w",stdout);
    cin>>n;
...

注：以上代码为call.cpp里的内容

注：以上代码位于snacks文件夹内

    char q[
2000000
3000000
4000000
958153104
(注：此处省略了正好200000行)
16 2 1160715
5 4 791122
21 7 1088325];

宇宙空间都不足以开下这个数组

    if(n == 3) printf("6 8 12\n");
    if(n == 10) printf("36 282 108 144 180 216 504 288 324 360\n");
    if(n == 100000) printf("384559830 823662041 763850062 852621623 66990587 247986265 517838371 409023205 ...(注：此行长度989211)

固输界的巅峰

神一般的码力 中国的希望

#include<iostream>
using namespace std;
int main()
{
       fropen("call.in","r",stdin);
       fropen("call.out","w",stdin);
}
return 0;

无e无out之神（注：以上代码位于call.cpp文件夹内 且四个代码均有类似行为）

#include <bits/stdc++.h>
using namespace std;
int main()
{
    freopen("call.in", "r", stdin);
    freopen("call.out", "w", stdout);
    cout << "I do not know the answer." << endl;
    return 0;
}

诚实之神

int main(){
  freopen("call.in","r",stdin);
  freopen("call.out","w",stdout);
  printf("qwq");
  return 0;
}

可爱之神

int main(){
    freopen("zoo.in","r",stdin);
    freopen("zoo.out","w",stdout);
    int n,m,c,k;
    int x=rand(n);
    cin>>n>>m>>c>>k;
    cout<<x:
    return 0;
}

信仰之神（本省至少4份代码固输rand）

int main()
{
    printf("unknown answer");
    return 0;
}

薛定谔之神

int main(){

    while(1)cout<<"AC";
return 0;}

自动AC之神

int main()
{
    freopen("call.in","r",stdin);
    freopen("call.out","w",stdout);
    return ;
    //it's sure that the problem cant use rand() to get some point 
}

自知之明+不爆零之神

int main(){
    freopen("call.in","r",stdin);
    freopen("call.out","w",stdout);
    for(int i=1;i<=100;i--){

        cout<<"cnmb"<<endl;
        }
    fclose(stdin);
    fclose(stdout);

    return 0;
}

文明之神

int main(){
    freopen("snakes.in","r",stdin);
    freopen("snakes.out","w",stdout);
    int T;
    scanf("%d",&T);T--;
    int q;
    scanf("%d",&n);
    for(int i = 0; i < n; ++i){
        scanf("%d",&q);
        zz[i] = mq(i,q);
    }
    sort(zz,zz+n,cmp);
    printf("%d\n",calc());
    while(T--){
        int cnm,nmsl;
        cin >> q;
        for(int i = 0; i < q; ++i){
            scanf("%d%d",&cnm,&nmsl);
            zz[cnm-1].val = nmsl;
        }
        sort(zz,zz+n,cmp);
        printf("%d\n",calc());
    }
    return 0;
}

文明之神进阶版

//i love oi forever
#include<bits/stdc++.h>
using namespace std;
#define For(i, j, n) for(register int i = j ; i <= n ; ++i)
int k, n, T, v, cnt, pos, m1, m2, m3, maxp1, maxp2, maxp3;
int a[1314];

int main(){
    freopen("snakes.in", "r", stdin);
    freopen("snakes.out", "w", stdout);

表白之神

int main()
{
    freopen("julian.in","r",stdin);
    freopen("julian.out","w",stdout);
    cin>>q;
    for(int i=0;i<q;i++)
    {
        cin>>a[i];
        if(a[i]<=2299170)
            rulue(a[i]);
        else
            geli(a[i]);
    }
    return 0;
}
//I love OI forever,and wyp,ghy,xzr,hk ak csps2020,bye bye.

祝福之神

int main()
{
  freopen("julian.in","r","stdin");
   freopen("julian.out","w","stdout");

“神”

//神

int main()
{
       freopen("julian.in","r",cstin);
        freopen("julian.out","w",cstout);

无d之神

#include <cstdioi>

using namespace std;

int n;

int main()
{

akioi之神

#include<bits/stdc++.h>
using namespace std;
int main()
{

    return 0;
}

零之神（有至少三个代码均为以上内容）

int mian(){
    freopen("snackes.in","r",stdin);
    freopen("snackes.out","w",stdout);
    int T,K;
    cin >> T;
    for(int i=0;i<T;i++){
        cin >> K;
        jd(K);
    }
    return 0;

做面包小吃之神

反物质之神