# Markdown
## 我用的太垃圾
### 请
#### 赐
###### 蕉
by ZinChloride @ 2019-08-26 22:49:58
` ```cpp `
Your code
` ``` `
by t162 @ 2019-08-26 22:58:56
```
```
by _H1kar1 @ 2019-08-26 22:59:05
```cpp Your code ```
by NIMNIM @ 2019-08-26 23:05:20
希望更丰富的展现？使用Markdown
by Uvocde @ 2020-01-23 20:06:59
```
#include<bits/stdc++.h>
int m,ka,tong[20000],x[40010],dir[40010][5],bi[40010];
using namespace std;
int pd(int a,int b,int c,int d){
if((b-a)!=2*(d-c)) return 0;
if(3*(b-a)>=(c-b)) return 0;
return 1;
}
int main(){
cin>>ka>>m;
for(register int i=1;i<=m;i++) cin>>bi[i];
for(register int i=1;i<=m;i++) x[i]=bi[i];
sort(x+1,x+m+1);
for(register int i=1;i<=m-3;i++){
for(register int j=i+1;j<=m- 2;j++){
for(register int k=j+1;k<=m-1;k++){
for(register int l=k+1;l<=m;l++){
if(pd(x[i],x[j],x[k],x[l])==1){
dir[i][1]++;
dir[j][2]++;
dir[k][3]++;
dir[l][4]++;
}
}
}
}
}
for(register int i=1;i<=m;i++){
for(register int j=1;j<=m;j++){
if(x[j]==bi[i]&&tong[i]==0{
tong[i]=1;
for(register int k=1;k<=4;k++){
cout<<dir[j][k]<<" ";
}
}
}
cout<<endl;
memset(tong,0,sizeof(tong));
}
}
```
by Uvocde @ 2020-01-23 20:10:17