快读模板(我觉得还ok...
#include<iostream>
#include<fstream>
#include <vector>
#include <iomanip>
#include <bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <cstring>
using namespace std;
inline int read()
{
long long x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0' && ch<='9')
x=x*10+ch-'0',ch=getchar();
return x*f;
}
int main (){
int a;
cout<<read( );
return 0;
}
排序模板(几种都还比较简洁
#include<iostream>
#include<fstream>
#include <vector>
#include <iomanip>
#include <bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <cstring>
using namespace std;
int a[30002],n;
/*快速排序
int main (){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a,a+n+1);
for(int i=1;i<=n;i++){
cout<<a[i]<<" ";
}*/
/*选择排序
void select_sort(int*a,int n){
for (int i=1;i<=n;i++){
int index=i;
for (int j=i;j<=n;j++){
if (a[index]>a[j])index=j;
}
swap(a[i],a[index]);
}
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
select_sort(a,n);
for (int i=1;i<=n;i++){
cout<<a[i]<<" ";
return 0;
}*/
/*插入排序
void InsertionSort(int a[], int len)
{
for (int j=1;j<len;j++){
int key=a[j];
int i=j-1;
while (i>=0&&a[i]>key){
a[i+1]=a[i];
i--;
}
a[i+1]=key;
}
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
InsertionSort(a,n+1);
for (int i=1;i<=n;i++){
cout<<a[i]<<" ";
}
return 0;
}*/
/*冒泡排序
void BubblingSort(int a[],int n){
int k=0,t=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
}
}
}
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
BubblingSort(a,n+1);
for (int i=1;i<=n;i++){
cout<<a[i]<<" ";
}
return 0;
}*/
/*选择排序
void Selection_Sort(int a[],int n){
int i,j;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
if(a[j]<a[i]){
swap(a[i],a[j]);
}
}
}
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
Selection_Sort(a,n+1);
for (int i=1;i<=n;i++){
cout<<a[i]<<" ";
}
return 0;
}*/
/*桶排序
void Bucket_Sort(int a[],int n){
long long b[100000]={ };
for(int i=1;i<=n;i++){
b[a[i]]++;
}
for(int i=1;i<=10000;i++){
if(b[i]){
for(int j=1;j<=b[i];j++){
cout<<i<<" ";
}
}
}
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
Bucket_Sort(a,n+1);
return 0;
}*/
int main(){
return 0;
}