应该是桶排序的方法

说说看你们的程序运行结果

#include <bits/stdc++.h> using namespace std; int main(){ int n,a[100],c; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]<a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>=0&&a[i]<=100){ cout<<a[i]<<" "; } } cout<<endl; for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]>a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>=-100&&a[i]<=-1){ cout<<a[i]<<" "; } } cout<<endl; for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]>a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>100){ cout<<a[i]<<" "; } } cout<<endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ int n,a[100],c; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]<a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>=0&&a[i]<=100){ cout<<a[i]<<" "; } } cout<<endl; for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]>a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>=-100&&a[i]<=-1){ cout<<a[i]<<" "; } } cout<<endl; for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]>a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>100){ cout<<a[i]<<" "; } } cout<<endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ int n,a[100],c; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]<a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>=0&&a[i]<=100){ cout<<a[i]<<" "; } } cout<<endl; for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]>a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>=-100&&a[i]<=-1){ cout<<a[i]<<" "; } } cout<<endl; for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]>a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>100){ cout<<a[i]<<" "; } } cout<<endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ int n,a[100],c; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]<a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>=0&&a[i]<=100){ cout<<a[i]<<" "; } } cout<<endl; for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]>a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>=-100&&a[i]<=-1){ cout<<a[i]<<" "; } } cout<<endl; for(int j=1;j<=n;j++){ for(int i=1;i<=n-1;i++){ if(a[i]>a[i+1]){ c=a[i]; a[i]=a[i+1]; a[i+1]=c; } } } for(int i=0;i<n;i++){ if(a[i]>100){ cout<<a[i]<<" "; } } cout<<endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ int a,b; cin>>a>>b; for(int i=a;i<=b+1;i++){ if(i/4>=1 && (i%10)(i%10)(i%10)(i%10)+(i/10%10)(i/10%10)(i/10%10)(i/10%10)+(i/100%10)(i/100%10)(i/100%10)(i/100%10)+(i/1000%10)(i/1000%10)(i/1000%10)(i/1000%10)==i){ cout<<i<<" "; }

EMO

cout<<0;

#include <bits/stdc++.h> using namespace std; int main(){ int a,b,c,s = 0; cin >> a >> b >> c; if(b1||b3||b5||b7||b8||b10||b12){ s=31; } if(b4||b6||b9||b11){ s = 30; } if(b2){ if(a%40 && a%100!=0 ||a%4001){ s = 29; } else{ s = 28; } } s = s - c; cout << s; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int a,b,c; scanf("%d %d %d",&a,&b,&c); if(a%40&&a%100!=0&&a%4000){ if(b2){ cout<<29-c; } else if(b1||b3||b5||b7||b8||b10||b12){ cout<<31-c; } else{ cout<<30-c; } } else{ if(b2){ cout<<28-c; } else if(b1||b3||b5||b7||b8||b10||b12){ cout<<31-c; } else{ cout<<30-c; } } return 0; }

#include<iostream> using namespace std; int main(){ int len; cin>>len; int a[10000]={0}; int x; for(int i=0;i<len;i++){ cin>>x; a[x]=1; }int num=0; for(int i=0;i<9999;i++){ if(a[i]==1) num++; } cout<<num<<endl; for(int i=0;i<9999;i++){ if(a[i]==1) cout<<i<<" "; } return 0; }

#include <bits/stdc++.h> using namespace std; int x[150],y[150],a[200050]; int main(){ int n,i,k,s=1; cin>>n; for(i=0;i<n;i++) cin>>x[i]; for(i=0;i<n;i++) cin>>y[i]; for (i=0;i<n;i++) a[i]=x[i]-y[i]; sort(a,a+n); a[n]=-10000000; for (i=1;i<=n;i++) if (a[i]==a[i-1]) s++; else {cout<<a[i-1]<<' '<<s<<endl;s=1;} return 0; }

#include <bits/stdc++.h> using namespace std; int x[150],y[150],a[200050]; int main(){ int n,i,k,s=1; cin>>n; for(i=0;i<n;i++) cin>>x[i]; for(i=0;i<n;i++) cin>>y[i]; for (i=0;i<n;i++) a[i]=x[i]-y[i]; sort(a,a+n); a[n]=-10000000; for (i=1;i<=n;i++) if (a[i]==a[i-1]) s++; else {cout<<a[i-1]<<' '<<s<<endl;s=1;} return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ int a,b,n[1000][1000]; cin >> a >> b; for(int i = 1;i <= a;i++){ for(int j = 1;j <= b;j++){ cin >> n[i][j]; } } for(int i = 1;i <= a;i++){ for(int j = 1;j <= b;j++){ printf("%3d ",n[i][j]); } cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int main(){ int a; cin >> a; if(a%20){ cout << "2"; } else if(a%30){ cout << "3"; } else if(a%50){ cout << "5"; } else if(a%70){ cout << "7"; } else if(a%110){ cout << "11"; } else if(a%130){ cout << "13"; } else if(a%17==0){ cout << "17"; } else if(a%190){ cout << "19"; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int a[100]={0},b[100]={0},x; int z[201]={0}; int n,i,j; cin>>n; for(i=0;i<n;i++){ cin >> a[i]; } for(i=0;i<n;i++){ cin >> b[i]; } for(i=0;i<n;i++){ x = a[i] -b[i]; z[x+100]; } for(i=0;i<=200;i){ if(z[i]>0){ cout<<i-100<<" "<<z[i]<<endl; } } return 0; }

#include <bits/stdc++.h> using namespace std; int x[150],y[150],a[200050]; int main(){ int n,i,k,s=1; cin>>n; for(i=0;i<n;i++) cin>>x[i]; for(i=0;i<n;i++) cin>>y[i]; for (i=0;i<n;i++) a[i]=x[i]-y[i]; sort(a,a+n); a[n]=-10000000; for (i=1;i<=n;i++) if (a[i]==a[i-1]) s++; else {cout<<a[i-1]<<' '<<s<<endl;s=1;} return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int a[100]={0},b[100]={0},x; int z[201]={0}; int n,i,j; cin>>n; for(i=0;i<n;i++){ cin >> a[i]; } for(i=0;i<n;i++){ cin >> b[i]; } for(i=0;i<n;i++){ x = a[i] -b[i]; z[x+100]; } for(i=0;i<=200;i){ if(z[i]>0){ cout<<i-100<<" "<<z[i]<<endl; } } return 0; }

#include<bits/stdc++.h> using namespace std; int main(){ char a[10000]; int len; }