HL 迷惑行为大赏（哈尔滨考点）
请注意，下面的 **** 均非原始代码，而是因为不可抗力因素略去了。
空文件大赏
T1 不写人
============ ./HL-S00002/lock/lock.cpp =====================
No data found.
============ ./HL-S00007/lock/lock.cpp =====================
No data found.
============ ./HL-S00071/lock/lock.cpp =====================
No data found.
============ ./HL-S00158/lock/lock.cpp =====================
No data found.
============ ./HL-S00169/lock/lock.cpp =====================
No data found.
============ ./HL-S00170/lock/lock.cpp =====================
No data found.
============ ./HL-S00172/lock/lock.cpp =====================
No data found.
T2 不写人
============ ./HL-S00007/game/game.cpp =====================
No data found.
============ ./HL-S00013/game/game.cpp =====================
No data found.
============ ./HL-S00042/game/game.cpp =====================
No data found.
============ ./HL-S00049/game/game.cpp =====================
No data found.
============ ./HL-S00057/game/game.cpp =====================
No data found.
============ ./HL-S00165/game/game.cpp =====================
No data found.
============ ./HL-S00169/game/game.cpp =====================
No data found.
============ ./HL-S00172/game/game.cpp =====================
No data found.
T3 不写人
============ ./HL-S00005/struct/struct.cpp =====================
No data found.
============ ./HL-S00007/struct/struct.cpp =====================
No data found.
============ ./HL-S00013/struct/struct.cpp =====================
No data found.
============ ./HL-S00029/struct/struct.cpp =====================
No data found.
============ ./HL-S00031/struct/struct.cpp =====================
No data found.
============ ./HL-S00042/struct/struct.cpp =====================
No data found.
============ ./HL-S00049/struct/struct.cpp =====================
No data found.
============ ./HL-S00054/struct/struct.cpp =====================
No data found.
============ ./HL-S00055/struct/struct.cpp =====================
No data found.
============ ./HL-S00057/struct/struct.cpp =====================
No data found.
============ ./HL-S00071/struct/struct.cpp =====================
No data found.
============ ./HL-S00075/struct/struct.cpp =====================
No data found.
============ ./HL-S00084/struct/struct.cpp =====================
No data found.
============ ./HL-S00088/struct/struct.cpp =====================
No data found.
============ ./HL-S00107/struct/struct.cpp =====================
No data found.
============ ./HL-S00109/struct/struct.cpp =====================
No data found.
============ ./HL-S00114/struct/struct.cpp =====================
No data found.
============ ./HL-S00115/struct/struct.cpp =====================
No data found.
============ ./HL-S00135/struct/struct.cpp =====================
No data found.
============ ./HL-S00138/struct/struct.cpp =====================
No data found.
============ ./HL-S00140/struct/struct.cpp =====================
No data found.
============ ./HL-S00148/struct/struct.cpp =====================
No data found.
============ ./HL-S00158/struct/struct.cpp =====================
No data found.
============ ./HL-S00165/struct/struct.cpp =====================
No data found.
============ ./HL-S00169/struct/struct.cpp =====================
No data found.
============ ./HL-S00170/struct/struct.cpp =====================
No data found.
============ ./HL-S00171/struct/struct.cpp =====================
No data found.
============ ./HL-S00172/struct/struct.cpp =====================
No data found.
T4 不写人
============ ./HL-S00005/tree/tree.cpp =====================
No data found.
============ ./HL-S00007/tree/tree.cpp =====================
No data found.
============ ./HL-S00013/tree/tree.cpp =====================
No data found.
============ ./HL-S00025/tree/tree.cpp =====================
No data found.
============ ./HL-S00031/tree/tree.cpp =====================
No data found.
============ ./HL-S00042/tree/tree.cpp =====================
No data found.
============ ./HL-S00049/tree/tree.cpp =====================
No data found.
============ ./HL-S00055/tree/tree.cpp =====================
No data found.
============ ./HL-S00057/tree/tree.cpp =====================
No data found.
============ ./HL-S00071/tree/tree.cpp =====================
No data found.
============ ./HL-S00075/tree/tree.cpp =====================
No data found.
============ ./HL-S00084/tree/tree.cpp =====================
No data found.
============ ./HL-S00113/tree/tree.cpp =====================
No data found.
============ ./HL-S00114/tree/tree.cpp =====================
No data found.
============ ./HL-S00115/tree/tree.cpp =====================
No data found.
============ ./HL-S00140/tree/tree.cpp =====================
No data found.
============ ./HL-S00158/tree/tree.cpp =====================
No data found.
============ ./HL-S00163/tree/tree.cpp =====================
No data found.
============ ./HL-S00165/tree/tree.cpp =====================
No data found.
============ ./HL-S00169/tree/tree.cpp =====================
No data found.
============ ./HL-S00170/tree/tree.cpp =====================
No data found.
============ ./HL-S00171/tree/tree.cpp =====================
No data found.
============ ./HL-S00172/tree/tree.cpp =====================
No data found.
注释大赏
你怎么忘记 freopen 了啊。
============ ./HL-S00040/lock/lock.cpp =====================
...
{
//freopen("lock.in","r",stdin);
//freopen("lock.out","w",stdout);
...
============ ./HL-S00101/struct/struct.cpp =====================
...
int main() {
//freopen("struct.in","r",stdin);
//freopen("struct.out","w",stdout);
...
============ ./HL-S00121/struct/struct.cpp =====================
...
int main()
{
//freopen("struct.in","r",stdin);
//freopen("struct.out","w",stdout);
...
...
// cout<<ans0<<" "<<ans1<<endl;
printf("%d",ans);
return 0;
}
============ ./HL-S00026/lock/lock.cpp =====================
#include<bits/stdc++.h>
using namespace std;
...
/*
“我们在180份文件中发现了721个freopen。”
1
...
大佬，快来膜拜。
============ ./HL-S00126/game/game.cpp =====================
...
if (sk.top()!=s[j])sk.push(s[j]);
else sk.pop();
if (sk.empty()) cnt++;
}
}
cout<<cnt;
//wo hui zhe ti zheng jie.
//shi jian bu gou le
//wo hai wei ci xiang le ban tian
return 0;
}
...
又是大佬。
============ ./HL-S00126/struct/struct.cpp =====================
...
while (n--){
int x;
cin>>x;
if (x==1){
cz++;//kkksc03
int vsz;
...
//I am Xuan_HR(671294).
//This is a easy da mo ni.
//But I don't like it.
//I like si wei ti
return 0;
}
...
他真的很喜欢计时。
============ ./HL-S00134/lock/lock.cpp =====================
// 15: 00
// 15: 24.
...
代码里面写题解。真有你的。
============ ./HL-S00134/game/game.cpp =====================
// 15: 24
// let dp[i] is the count of good substrings that end with i.
// then the answer is \sum dp[i]
// We noticed that, for every good substrings that end with i,
// if we let pre[i] is the last(nearest && < i) index that
// pre[i] ~ i can be a good substring, dp[i] = dp[pre[i] - 1] + 1.
// Because good substrings are either mininum or maximum, and the latter
// perfectly covered the previous one(s).
// Then the problem is how we can find pre[i].
// In classical thought, some index has pre[i], and some index only have nxt[i].
// Is that right? Or say are those indexes always have dp[pre[i] - 1] = 0?
// I'd say it is right. We noticed that, the order that we delete chars is not important.
// Then for every good substrings, we can always find a way to split it into some pieces,
// that every (minimum) pieces is good.
// So we pre-calc the array pre[i], use stack tech.
// then dp.
// Weird things happened that I passed no large samples.
// Is my conclusion right????
// I thought it is right obviously!!!
// **** it. hack: ppoopp. (7)
// The fault is in fact the poped can find its pre[i].
// Then we consider to "jump". We know that what we want to find is
// have the form of AaaabbbcccdddA, which means the middle substrings are all
// compose of pre[i] ~ i. So, we let pre[i] = i at first,
// and i -> pre[i] -> pre[pre[i] - 1] (if pre[i] - 1 != i)
// -> pre[... - 1] (if pre[i] - 1 != i)
// until pre[i] = -1. we can compress the path to fasten this process.
// I did not compress the path, but I think it's enough to pass this prob.
// I trust the data strength.
// 16: 25
// Hit by T3 and T4.
// seems that this algo is not beyond O(n\log n).
...
============ ./HL-S00134/struct/struct.cpp =====================
// 16: 25
// Hate this problem.
// For a struct, it has name and members. members has name and type.
#include<bits/stdc++.h>
using namespace std;
// At beginning, I define something.
using type = string;
using name = string;
using addr = long long;
// First lets see sizes.
// how to declare a struct?
逆天输出
你的阳寿有些过于多了.jpg
============ ./HL-S00164/tree/tree.cpp =====================
...
if(n==4){
cout<<5;
return 0;
}
else if(n==953){
cout<<27742908;
return 0;
}
else if(n==996){
cout<<33577724;
return 0;
}
else if(n==97105){
cout<<40351908;
return 0;
}
...
不符合规则的输出。
============ ./HL-S00002/struct/struct.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int a[100],n,i;
int main(){
cout<<"24 856 805636064x.bd.acERRERR";
return 0;
}
有没有可能，你写下的这个数字超过了 long long。
============ ./HL-S00006/tree/tree.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int main()
{
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
long long n;
cin>>n;
if(n==4)
{
cout<<5;
}
if(n==95320052587812347070)
{
cout<<27742908;
}
if(n==99611230667991176248)
{
cout<<33577724;
}
if(n==9710588023059415729175)
{
cout<<40351908;
}
return 0;
}
直 接 输 出 大 样 例。
============ ./HL-S00017/struct/struct.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int main (){
freopen("struct.in","r",stdin);
freopen("struct.out","w",stdout);
cout<<"280 4"<<endl;
cout<<"488 8"<<endl;
cout<<"74 1"<<endl;
cout<<"424 8"<<endl;
cout<<"488 8"<<endl;
cout<<"360 8"<<endl;
cout<<"400 8"<<endl;
cout<<"73 1"<<endl;
cout<<"416 8"<<endl;
cout<<"244 4"<<endl;
cout<<"13240 8"<<endl;
cout<<"ERR"<<endl;
cout<<"ERR"<<endl;
cout<<"0"<<endl;
cout<<"416"<<endl;
cout<<"yrqmt.jx"<<endl;
cout<<"532"<<endl;
cout<<"yrqmt.qz"<<endl;
cout<<"660"<<endl;
cout<<"3536 2"<<endl;
cout<<"101280 8"<<endl;
cout<<"ERR"<<endl;
cout<<"664"<<endl;
cout<<"4200"<<endl;
cout<<"316"<<endl;
cout<<"73072 8"<<endl;
cout<<"4280"<<endl;
cout<<"439376 8"<<endl;
cout<<"tugdzdmf.wfver.xfgowkt"<<endl;
cout<<"1328384 8"<<endl;
cout<<"4680"<<endl;
cout<<"360"<<endl;
cout<<"ivsuvcvjb.mqxoiiajlu.vw.nf.faauu"<<endl;
cout<<"660"<<endl;
cout<<"546"<<endl;
cout<<"ERR"<<endl;
cout<<"0"<<endl;
cout<<"ivsuvcvjb.qn.oavmfr.ijrml.qvsewhzix"<<endl;
cout<<"66282 2"<<endl;
cout<<"ivsuvcvjb.dsblghv.aalwmcafg.wykbanwd.kjo"<<endl;
cout<<"ivsuvcvjb.afvxlr.mouomz.kqmdtmvm.czav"<<endl;
cout<<"ERR"<<endl;
cout<<"43908 4"<<endl;
cout<<"1333064"<<endl;
cout<<"ivsuvcvjb.ge.aalwmcafg.pxeojbx.pcbalz"<<endl;
cout<<"3437"<<endl;
cout<<"1333072"<<endl;
cout<<"1333560"<<endl;
cout<<"1377472"<<endl;
cout<<"14216856 8"<<endl;
cout<<"1478752"<<endl;
cout<<"1256668 4"<<endl;
cout<<"110889256 8"<<endl;
cout<<"15695608"<<endl;
cout<<"15695616"<<endl;
cout<<"1373555"<<endl;
cout<<"3593"<<endl;
cout<<"454"<<endl;
cout<<"fg.lggj.nczgvringc.vbjmgl.ihiho.xyxb"<<endl;
cout<<"126584872"<<endl;
cout<<"664"<<endl;
cout<<"51142888 8"<<endl;
cout<<"4085 1"<<endl;
cout<<"fg.fuyy.htijowmh.smprthyag.lgw.tqr.ucskoq"<<endl;
cout<<"ERR"<<endl;
cout<<"ERR"<<endl;
cout<<"1333072"<<endl;
cout<<"126628784"<<endl;
cout<<"664"<<endl;
cout<<"381659488 8"<<endl;
cout<<"fg.fuyy.nzt.dfdqyspuyo.smdwdhhyr"<<endl;
cout<<"5995312 4"<<endl;
cout<<"2681589704 8"<<endl;
cout<<"3400899856 8"<<endl;
cout<<"126730064"<<endl;
cout<<"3527629920"<<endl;
cout<<"2049789848 8"<<endl;
cout<<"15695608"<<endl;
cout<<"3527630168"<<endl;
cout<<"6928530024"<<endl;
cout<<"1333064"<<endl;
cout<<"126730064"<<endl;
cout<<"13950109256 8"<<endl;
cout<<"12886802016 8"<<endl;
cout<<"81870328872 8"<<endl;
cout<<"qnopkdk.soli.seemo.scvkywuvwz.mwunkw.bbn.iuejgx.at"<<endl;
cout<<"ERR"<<endl;
cout<<"15695608"<<endl;
cout<<"qnopkdk.zdvwhw.bdke.iqunjl.enrq.oonxrmi.xdza"<<endl;
cout<<"109885069136 8"<<endl;
cout<<"299649238016 8"<<endl;
cout<<"1354690"<<endl;
cout<<"800858864224 8"<<endl;
cout<<"6928530448"<<endl;
cout<<"1544354842384 8"<<endl;
cout<<"ERR"<<endl;
cout<<"3527629958"<<endl;
cout<<"qnopkdk.llv.enrq.i.iqunjl.afvxlr.oavmfr.isasojmfn.takfpvouou"<<endl;
cout<<"960352"<<endl;
cout<<"32"<<endl;
return 0;
}
你有这功夫不如去原神抽卡。
============ ./HL-S00102/tree/tree.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int n,
int main(){
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
cin>>n;
int a,b,c;
for(int i=1;i<=n;i++){
cin>>a>>b>>c;
}
for(int i=1;i<n;i++){
cin>>a>>b;
}
if(n<=5){
cout<<rand()%10;
}
else if(n<=10){
cout<<rand()%50+n-1;
}
else if(n<=100){
cout<<rand()%200+n-1;
}
else if(n<=500){
cout<<rand()%321+n-1;
}
else{
cout<<(rand()+3215421)%1242+n-1;
}
return 0;
}
你输出了什么？
============ ./HL-S00005/game/game.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int n;
...
// if (s[i] == s[i - 1]) a[i] = 1;
// }
// for (int j = 1; j <= n; j++)
// {
//
// }
printf("He");
return 0;
}
...
矩 阵 代 码。
============ ./HL-S00009/lock/lock.cpp =====================
#include<bits/stdc++.h>
using namespace std;struct z{int a,b,c,d,e;}s[10];int main(){freopen("lock.in","r",stdin);freopen("lock.out","w",stdout);
int n,a=0,b=0,c=0,d=0,e=0;scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d%d%d%d%d",&s[i].a,&s[i].b,&s[i].c,&s[i].d,&s[i].e);
for(int j=0;j<i;j++){if(s[i].a!=s[j].a)a++;if(s[i].b!=s[j].b)b++;if(s[i].c!=s[j].c)c++;if(s[i].d!=s[j].d)d++;if(s[i].e!=s[j].e)e++;}}
if(n==1){printf("81");return 0;}if((a>0&&c>0)||(b>0&&d>0)||(c>0&&e>0)||(a>0&&d>0)||(b>0&&e>0)||(a>0&&e>0)){printf("0");return 0;}
if(n==2){if(a+b+c+d+e==1&&(a==1||e==1)){printf("10");return 0;}
if(a+b+c+d+e==1&&(b==1||c==1||d==1)){printf("12");return 0;}if(a+b+c+d+e>2){printf("0");return 0;}
if(a==1&&b==1){if(s[0].a-s[0].b!=s[1].a-s[1].b){printf("0");return 0;}else{printf("2");return 0;}}
if(b==1&&c==1){if(s[0].b-s[0].c!=s[1].b-s[1].c){printf("0");return 0;}else{printf("2");return 0;}}
if(c==1&&d==1){if(s[0].c-s[0].d!=s[1].c-s[1].d){printf("0");return 0;}else{printf("2");return 0;}}
if(d==1&&e==1){if(s[0].d-s[0].e!=s[1].d-s[1].e){printf("0");return 0;}else{printf("2");return 0;}}}
if(n==3){if(a+b+c+d+e==3&&(a==3||b==3||c==3||d==3||e==3)){printf("7");return 0;}
if(a==3&&b==3){if(s[0].a-s[0].b!=s[1].a-s[1].b!=s[2].a-s[2].b){printf("0");return 0;}else{printf("2");return 0;}}
if(b==3&&c==3){if(s[0].b-s[0].c!=s[1].b-s[1].c!=s[2].a-s[2].b){printf("0");return 0;}else{printf("2");return 0;}}
if(c==3&&d==3){if(s[0].c-s[0].d!=s[1].c-s[1].d!=s[2].a-s[2].b){printf("0");return 0;}else{printf("2");return 0;}}
if(d==3&&e==3){if(s[0].d-s[0].e!=s[1].d-s[1].e!=s[2].a-s[2].b){printf("0");return 0;}else{printf("2");return 0;}}}
if(n==4){if(a+b+c+d+e==6&&(a==6||b==6||c==6||d==6||e==6)){printf("6");return 0;}
if(a==6&&b==6){if(s[0].a-s[0].b!=s[1].a-s[1].b!=s[2].a-s[2].b!=s[3].a-s[3].b){printf("0");return 0;}else{printf("2");return 0;}}
if(b==6&&c==6){if(s[0].b-s[0].c!=s[1].b-s[1].c!=s[2].a-s[2].b!=s[3].a-s[3].b){printf("0");return 0;}else{printf("2");return 0;}}
if(c==6&&d==6){if(s[0].c-s[0].d!=s[1].c-s[1].d!=s[2].a-s[2].b!=s[3].a-s[3].b){printf("0");return 0;}else{printf("2");return 0;}}
if(d==6&&e==6){if(s[0].d-s[0].e!=s[1].d-s[1].e!=s[2].a-s[2].b!=s[3].a-s[3].b){printf("0");return 0;}else{printf("2");return 0;}}}
if(n==5){if(a+b+c+d+e==10&&(a==10||b==10||c==10||d==10||e==10)){printf("5");return 0;}
if(a==10&&b==10){if(s[0].a-s[0].b!=s[1].a-s[1].b!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b){printf("0");return 0;}else{printf("2");return 0;}}
if(b==10&&c==10){if(s[0].b-s[0].c!=s[1].b-s[1].c!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b){printf("0");return 0;}else{printf("2");return 0;}}
if(c==10&&d==10){if(s[0].c-s[0].d!=s[1].c-s[1].d!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b){printf("0");return 0;}else{printf("2");return 0;}}
if(d==10&&e==10){if(s[0].d-s[0].e!=s[1].d-s[1].e!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b){printf("0");return 0;}else{printf("2");return 0;}}}
if(n==6){if(a+b+c+d+e==15&&(a==15||b==15||c==15||d==15||e==15)){printf("4");return 0;}
if(a==15&&b==15){if(s[0].a-s[0].b!=s[1].a-s[1].b!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b){printf("0");return 0;}else{printf("2");return 0;}}
if(b==15&&c==15){if(s[0].b-s[0].c!=s[1].b-s[1].c!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b){printf("0");return 0;}else{printf("2");return 0;}}
if(c==15&&d==15){if(s[0].c-s[0].d!=s[1].c-s[1].d!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b){printf("0");return 0;}else{printf("2");return 0;}}
if(d==15&&e==15){if(s[0].d-s[0].e!=s[1].d-s[1].e!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b){printf("0");return 0;}else{printf("2");return 0;}}}
if(n==7){if(a+b+c+d+e==21&&(a==21||b==21||c==21||d==21||e==21)){printf("3");return 0;}
if(a==21&&b==21){if(s[0].a-s[0].b!=s[1].a-s[1].b!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b!=s[6].a-s[6].b){printf("0");return 0;}else{printf("2");return 0;}}
if(b==21&&c==21){if(s[0].b-s[0].c!=s[1].b-s[1].c!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b!=s[6].a-s[6].b){printf("0");return 0;}else{printf("2");return 0;}}
if(c==21&&d==21){if(s[0].c-s[0].d!=s[1].c-s[1].d!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b!=s[6].a-s[6].b){printf("0");return 0;}else{printf("2");return 0;}}
if(d==21&&e==21){if(s[0].d-s[0].e!=s[1].d-s[1].e!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b!=s[6].a-s[6].b){printf("0");return 0;}else{printf("2");return 0;}}}
if(n==8){if(a+b+c+d+e==28&&(a==28||b==28||c==28||d==28||e==28)){printf("2");return 0;}
if(a==28&&b==28){if(s[0].a-s[0].b!=s[1].a-s[1].b!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b!=s[6].a-s[6].b!=s[7].a-s[7].b){printf("0");return 0;}else{printf("2");return 0;}}
if(b==28&&c==28){if(s[0].b-s[0].c!=s[1].b-s[1].c!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b!=s[6].a-s[6].b!=s[7].a-s[7].b){printf("0");return 0;}else{printf("2");return 0;}}
if(c==28&&d==28){if(s[0].c-s[0].d!=s[1].c-s[1].d!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b!=s[6].a-s[6].b!=s[7].a-s[7].b){printf("0");return 0;}else{printf("2");return 0;}}
if(d==28&&e==28){if(s[0].d-s[0].e!=s[1].d-s[1].e!=s[2].a-s[2].b!=s[3].a-s[3].b!=s[4].a-s[4].b!=s[5].a-s[5].b!=s[6].a-s[6].b!=s[7].a-s[7].b){printf("0");return 0;}else{printf("2");return 0;}}}return 0;}
世界，拒绝了你……
============ ./HL-S00100/tree/tree.cpp =====================
#include <cstdio>
int main()
{
freopen("tree.in","r",stdin);
freopen("tree.out","w",stdout);
printf("Hello, World!");
return 0;
}
============ ./HL-S00100/struct/struct.cpp =====================
#include <cstdio>
int main()
{
freopen("struct.in","r",stdin);
freopen("struct.out","w",stdout);
printf("Hello, World!");
return 0;
}
原 路 返 回
============ ./HL-S00130/tree/tree.cpp =====================
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("tree.in","r",stdin);
freopen("tree.ans","w",stdout);
int n;
cin >> n;
cout << n;
}
============ ./HL-S00130/struct/struct.cpp =====================
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("struct.in","r",stdin);
freopen("struct.ans","w",stdout);
int n;
cin >> n;
cout << n;
}
81 是什么神奇数字吗？
注意 .ans。
============ ./HL-S00070/lock/lock.cpp =====================
#include <bits/stdc++.h>
using namespace std;
int n,x=0,y=0;
struct st{
int a,b,c,d,e;
}m[18];
int main(){
freopen("lock.in","r",stdin);
freopen("lock.ans","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i].a);
scanf("%d",&a[i].b);
scanf("%d",&a[i].c);
scanf("%d",&a[i].d);
scanf("%d",&a[i].e);
}
printf("81");
fclose("lock.in",stdin);
fclose("lock.ans",stdout);
return 0;
}
============ ./HL-S00072/game/game.cpp =====================
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF=8005;
int n;
ll ans=0;
bool f[8005][8005];
char s[INF];
int main(){
freopen("game.in","r",stdin);
freopen("game.ans","w",stdout);
scanf("%d",&n);
scanf("%s",s+1);
...
打表的人太多，只选取一些最逆天的。
homo
============ ./HL-S00120/struct/struct.cpp =====================
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ******** 114514
============ ./HL-S00046/game/game.cpp =====================
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
bool vis[8005];
int cnt;
struct node
{
int id , nxt , l;
}e[8005];
int main()
{
freopen("game.in" , "r" , stdin);
freopen("game.out" , "w" , stdout);
cin >> n >> s;
for(int i = 0 ; i < n ; i++)
{
e[i + 1].id = s[i + 1] - 'a' + 1;
e[i + 1].nxt = i + 2;
e[i + 1].l = 1;
}
cout << 114514 << endl;
return 0;
}
CCF 单推人
============ ./HL-S00134/struct/struct.cpp =====================
// 16: 25
// Hate this problem.
// For a struct, it has name and members. members has name and type.
...
struct CCF_struct;
map<type, CCF_struct> mp;
struct CCF_struct {
type _name;
addr size, max_size, req;
map<name, long long> addrs;
map<name, type> _type;
map<long long, name> rev;
CCF_struct () {
_name = "", size = max_size = req = 0;
}
void insert(CCF_struct _t, string _n) {
...
}
============ ./HL-S00026/struct/struct.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int n,op,k,cnt,addr,locid=-1;
string s,t,nam,loc[80004];
//locid: dang qian jin xing dao duo shao wei zhi le.
...
/*
6
1 ccf 2
int a
byte b
2 ccf money
...
============ ./HL-S00043/lock/lock.cpp =====================
/*
Contest:CSP-S2023
Name:lock
Time:2023.10.21
ccfyyds!
ccfyyds!
ccfyyds!
*/
============ ./HL-S00120/struct/struct.cpp =====================
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ********_C_C_F 114514
...
其他
经检查发现，/game/game.cpp 是一个文件夹名称。
============ ./HL-S00158/game/game.cpp =====================
[Errno 13] Permission denied: './HL-S00158/game/game.cpp'
直接输出大样例。梅开二度。
============ ./HL-S00017/game/game.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int main (){
freopen("game.in","r",stdin);
freopen("game.out","w",stdout);
long long n;
cin>>n;
string a;
cin>>a;
if(n==8)
{
cout<<5;
}else if(n==800)
{
cout<<38727;
}else if(n==200000)
{
if(a=="*********")
{
cout<<8357;
}
else
{
cout<<41184728;
}
}else
{
cout<<5;
}
return 0;
}
奇怪的文件名
.\HL-S00169\新建文件夹\未命名1.cpp
.\HL-S00169\新建文件夹 - 副本\未命名1.cpp
.\HL-S00169\新建文件夹 - 副本 (2)\未命名1.cpp
.\HL-S00169\新建文件夹 - 副本 (3)\未命名1.cpp
.\HL-S00169\新建文件夹
.\HL-S00169\新建文件夹 - 副本
.\HL-S00169\新建文件夹 - 副本 (2)
.\HL-S00169\新建文件夹 - 副本 (3)
.\HL-S00172\密码锁\密码锁\lock.cpp
.\HL-S00172\密码锁\lock.cpp
.\HL-S00172\密码锁\lock.h
.\HL-S00172\密码锁\lock.in.txt
.\HL-S00172\密码锁\lock.out.txt
.\HL-S00172\密码锁\密码锁
.\HL-S00172\消消乐\密码锁\密码锁\lock.cpp
.\HL-S00172\消消乐\密码锁\lock.h
.\HL-S00172\消消乐\密码锁\lock.in.txt
.\HL-S00172\消消乐\密码锁\lock.out.txt
.\HL-S00172\消消乐\密码锁\密码锁
.\HL-S00172\消消乐\game.cpp
.\HL-S00172\消消乐\密码锁
.\HL-S00172\密码锁
.\HL-S00172\消消乐
.\HL-S00172\种树
.\HL-S00172\结构体
.\HL-S00007\消消乐（game）\消消乐（game）.cpp
.\HL-S00007\种树（tree）\种树（tree）.cpp
.\HL-S00007\结构体(struct)\结构体（struct）.cpp
.\HL-S00007\密码锁（lock）
.\HL-S00007\消消乐（game）
.\HL-S00007\种树（tree）
.\HL-S00007\结构体(struct)
.\HL-S00006\数据分区3 (F) - 快捷方式.lnk
HL 迷惑行为大赏（大庆考点）
空文件夹
============ ./HL-S00021/tree/tree.cpp =====================
No data found.
============ ./HL-S00021/struct/struct.cpp =====================
No data found.
============ ./HL-S00028/tree/tree.cpp =====================
No data found.
============ ./HL-S00050/tree/tree.cpp =====================
No data found.
============ ./HL-S00050/struct/struct.cpp =====================
No data found.
============ ./HL-S00051/tree/tree.cpp =====================
No data found.
============ ./HL-S00051/struct/struct.cpp =====================
No data found.
============ ./HL-S00056/struct/struct.cpp =====================
No data found.
============ ./HL-S00063/tree/tree.cpp =====================
No data found.
============ ./HL-S00063/struct/struct.cpp =====================
No data found.
============ ./HL-S00069/lock/lock.cpp =====================
No data found.
============ ./HL-S00069/game/game.cpp =====================
No data found.
============ ./HL-S00069/tree/tree.cpp =====================
No data found.
============ ./HL-S00069/struct/struct.cpp =====================
No data found.
============ ./HL-S00073/tree/tree.cpp =====================
No data found.
============ ./HL-S00079/tree/tree.cpp =====================
No data found.
============ ./HL-S00079/struct/struct.cpp =====================
No data found.
============ ./HL-S00089/tree/tree.cpp =====================
No data found.
============ ./HL-S00090/tree/tree.cpp =====================
No data found.
============ ./HL-S00090/struct/struct.cpp =====================
No data found.
============ ./HL-S00096/tree/tree.cpp =====================
No data found.
============ ./HL-S00096/struct/struct.cpp =====================
No data found.
============ ./HL-S00097/game/game.cpp =====================
No data found.
============ ./HL-S00097/tree/tree.cpp =====================
No data found.
============ ./HL-S00097/struct/struct.cpp =====================
No data found.
============ ./HL-S00117/lock/lock.cpp =====================
No data found.
============ ./HL-S00117/tree/tree.cpp =====================
No data found.
============ ./HL-S00117/struct/struct.cpp =====================
No data found.
============ ./HL-S00123/struct/struct.cpp =====================
No data found.
============ ./HL-S00136/tree/tree.cpp =====================
No data found.
============ ./HL-S00136/struct/struct.cpp =====================
No data found.
============ ./HL-S00145/struct/struct.cpp =====================
No data found.
============ ./HL-S00149/tree/tree.cpp =====================
No data found.
============ ./HL-S00160/struct/struct.cpp =====================
No data found.
============ ./HL-S00161/struct/struct.cpp =====================
No data found.
逆天输出
你 看 看 你 的 文 件 夹
============ ./HL-00133/game/game.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int main(){
freopen("game.in","r",stdin);
freopen("game.out","w",stdout);
cout<<11;
return 0;
}
忘文件输出，哎呀你真忘啊？
============ ./HL-S00035/struct/struct.cpp =====================
#include<bits/stdc++.h>
#define ll long long
using namespace std;
...
//do forget freopen
//freopen("struct.in","r",stdin);
//freopen("struct.out","w",stdout);
============ ./HL-S00083/struct/struct.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int main(){
//freopen("struct.in","r",stdin);
//freopen("struct.out","w",stdout);
============ ./HL-S00103/lock/lock.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int main(){
//freopen("lock.in","r",stdin);
//freopen("lock.out","w",stdout);
...
============ ./HL-S00103/tree/tree.cpp =====================
#include<bits/stdc++.h>
using namespace std;
int main(){
//freopen("lock.in","r",stdin);
//freopen("lock.out","w",stdout);
...
世界，拒绝了你。
============ ./HL-S00139/struct/struct.cpp =====================
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5;
int main(){
freopen("struct.in","r",stdin);
freopen("struct.out","w",stdout);
for(int i = 1; i <= N; i++) printf("Hello World\n");
return 0;
}