共2590个代码文件，3575个文件夹，220个其他文件 代码文件总大小约80.3MiB

经统计，有2285个代码文件中freopen带有注释（放弃IO） 这2285个文件中只列举了部分在下方

以下内容以这样的格式展现：

准考证号：

题目名称或提示语：

代码

评语

GX-J00010:

T1T2T3T4:

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

//freopen("seat.in","r",stdin);
//freopen("seat.out","w",stdout);
后面略..

于是我放弃了IO

GX-J00019：

#define ARR_MAX 114514

HOMO!

GX-J00019:

number:

// index last: if haven`t it, output will have binary char

英语仙人

polygon:

// ~= terminal -> rm

这是在干什么

GX-J00031:

number:

for(int i=0;i<10;i++){
		if(s[i]!=1||2||3||4||5||6||7||8||9||0){
			break;
		}
	}

求解释

polygon:

文件名：polygo.cpp 内容：

是的就是这样

GX-J00033:

number:

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int a[N];
int cmp(int a,int b){
	return a>b;
}
int main(){
	freopen("number.in","r",stdin);
	freopen("number.out","w",stdout);
	string s;
	cin>>s;
	int j=1,k=0,l=s.size();
	for(int i=0;i<l;i++){
		if(s[i]=='0'){
			a[j]=0;
			j++;
			k++;
		}
		else if(s[i]=='1'){
			a[j]=1;
			j++;
			k++;
		//后面略...
	}
	sort(a+1,a+k+1,cmp);
	for(int i=1;i<=k;i++)cout<<a[i];
	return 0;
}

食山似乎是

GX-J00056:

number:

// freopen("number.out", "w", stdout);

于是我放弃了输出

GX-J00057：

number:

if(s.size()==1)
    {
        cout<<s;
    }
    else if(s=="290es1q0")
    {
        cout<<92100;
    }
    else if(s=="0u050hz08t2ibm70y4exp04u6m44838cont753674e569zh6hpkxr9tyd0l1odacalb5u0a835e7631x9581dy8pnui496e7t0bx")
    {
        cout<<92100;
    }
    else
    {
        cout<<92100;
    }

无论你怎么做，我都是92100...

GX-J00062:

xor文件夹里塞了个number夹

xor:

for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    cout<<"I don't kown!!!";

明白了（我不知道！！！）

GX-J00074:

number:

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

于是我放弃了IO（T234照样）

GX-J00075:

number:

#inclube <bits/stdc++.h>
using namespace;
int main(){
freopen("number.in","r",stdin);
freopen("number.out","w",stdout);
int 's' = 1~9;
cin >> s;
cout << s << c++;
return 0;
}

听取CE声一片

polygon:

freopen("polygonin","r",stdin);
freopen("polygonout","w",stdout);

奇怪的文件(

GX-J00091:

number:

	freopen("number.in","r",stdin);
	freopen("number.out","w",stdout);
	cin>>s;
	int b=s.size();
	if(b==1){
		cout<<s;
		return 0;
	}
	for(int i=0;i<b;i++){
		if(s[i]=='1'||s[i]=='2'/*略*/){
			if(s[i]=='1') x[n]=1;
			if(s[i]=='2') x[n]=2;
			//后面略
			n++;
		}
	}

如准考证般优美的石山代码

GX-J00102:

seat:

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

于是我放弃了IO

GX-J00114:

T1T2T3T4都类似这样的模板:

#inclube <bits/stdc++.h>

freopen("number.in"),"r",stdin;
freopen("number.out"),"w",stdol;

很明显了，这个入准考证号也奇怪

GX-J00120:

T1T2T3T4:

include<bits/stdc++.h>

听取CE声一片

GX-J00137:

number:

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

N A M B E R

GX-J00138:

seat:

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

上面的重复了三遍（可能是Ctrl+CV了代码）

GX-J00395:

seat:

//freopen("seat.in","r",stdin);
//freopen("seat.out","w",stdin);

于是我放弃了IO

GX-J00735:

seat:

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

同上

GX-J00888:

seat:

int h=1;//di h gexuesheng
    bool direction=0;//xia0 shang1

他在说什么

GX-J00723:

xor:

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

骗一下分(

GX-J00679:

number:

#include<bits/stdc++.h>
using namespace std;
long long numbers[1000001],ans=0;
string sum={};
int main(){
   freopen("number.in","r",stdin);
   freopen("number.out","w",stdout);
   string s;
   cin>>s;
   //cout<<s<<endl;
   for(int i=0;i<s.size();i++){
	   //cout<<i<<endl;
	   if(s[i]=='0'){
		   numbers[ans]=0;
		   ans++;
	   }
	   if(s[i]=='1'){
		   numbers[ans]=1;
		   ans++;
	   }
	   if(s[i]=='2'){
		   numbers[ans]=2;
		   ans++;
	   }
	//略...
	   //cout<<"ans "<<ans<<endl;        tiaoshi
   }
   sort(numbers,numbers+ans);
   //for(int i=0;i<ans;i++)
      //cout<<numbers[i]<<" "<<i<<endl;
      
      //cout<<s[0];
      //cout<<ans<<endl;
   for(int j=ans-1;j>=0;j--){
	   if(numbers[j]==9){
		   sum+='9';
	   }
	   //略...
	   //cout<<sum<<" "<<j<<endl;
   }
   cout<<sum<<endl;
   return 0;
}

食山一片（T2照样）

下面准考证号开始无序

GX-J00565:

polygon:

// CCF I love you,could you give me a hight score.
// because I will AK IOI.

xor:

/*
 * I AK IOI	
后面省略20几行
  * My name in luogu is "menm", can you find me;
 * 
 */
``
A K 

### GX-J00916:

//T4 zhi jie kai bai le //fen shu yv ji shi : T1 100 T2 100 T3 10 T4 39 //jin nian de ti mu qian mian tai shui , hou mian you lue nan //zhen bu zhi dao CCF zen me chu ti

额

### GX-J00285:
#### number:

// CCF I Love you!!! // I am Zyhx,bx luotianyi & yuezhenglin & yanhe

文件大小：1.14KB

### GX-J01153:

//what are you fucking doing? --i don't know.

禁赛警告

### GX-J00303:
#### seat:

[Desktop Entry] Type=Application Version=1.0 Name=Geany Name[ar]=Geany Name[ast]=Geany Name[be]=Geany Name[bg]=Geany

无语了，把Geany的桌面快捷方式内容CV了进去（省略了好多这里）
#### xor:

[Desktop Entry] Version=1.0 Type=Application Name=Sublime Text GenericName=Text Editor Comment=Sophisticated text editor for code, markup and prose Exec=/opt/sublime_text/sublime_text %F

这是sublime的

#### number:

``` 这是Free Pascal的XML

GX-J00708:

同上，也是快捷方式或者XML这一类的 文件：polygon,xor,seat三题

GX-J00639:

class object
 |  The base class of the class hierarchy.
 |  
 |  When called, it accepts no arguments and returns a new featureless
 |  instance that has no instance attributes and cannot be given any.
 |  
 |  Built-in subclasses:
 |      async_generator
 |      BaseException
 |      builtin_function_or_method
 |      bytearray
 |      ... and 89 other subclasses
 |  
 |  Methods defined here:
 |  
 |  __delattr__(self, name, /)
 |      Implement delattr(self, name).
 |  
 |  __dir__(self, /)
 |      Default dir() implementation.
 |  
: |  __eq__(self, value, /)
 |      Return self==value.
 |  
 |  __format__(self, format_spec, /)
 |      Default object formatter.

这干嘛的？？？（不是注释）

GX-J00409:

polygon:

// Is the part points is easy to get? It is so strange that why I can get 52 points easily.
// So I am so afraid that the first prize will be hard to get.

// I remember that somebody sent hundreds of files into ftp server in CSPJ last year. So that many tester failed to send their codes. It is a actually bad active!
// In my opinion, each qustions are so easy that I am worried about is there some special mistakes that I made.
// Good luck.

// Check List:
// freopen -- ok
// direction and file's name -- ok

// someone that sat in my left is named Jiahao. Yes, it is Jiahao that you are thinking. Now(11:57) he is exit virtual machine and run huorong. OH MY MKS!
// By the way, VSCODE is useful! I have seen someone is using Sublime and someone is using Emacs.

小作文，（）

GX-J01166:

    int sb=a[1];
    sort(a+1,a+(n*m)+1);
    int k=f(sb);

S B

GX-J00979：

int sb_score;
cin >> sb_score;

S B _ S C O R E

GX-J00378:

int sb[1000000]={0};

禁赛警告

GX-J00325:

9999999999999999999999999999999999999999999999999999999999（后面省略几千个，还是几万个来着）

该文件大小：976KB