1 solutions
-
0
C :
#include<stdio.h> int n; int a[20],b[20]; int main() { scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); int m=1; b[i]=a[i]; while(b[i]!=0&&b[i]>=10) { m++; b[i]/=10; } b[i]=a[i]; for(int j=4;j>m;j--) b[i]*=10; } for(int i=1;i<n;i++) for(int j=i+1;j<=n;j++) { if(b[i]>b[j]) { int x=a[i],y=b[i]; a[i]=a[j]; a[j]=x; b[i]=b[j]; b[j]=y; } if(b[i]==b[j]&&a[i]>a[j]) { int x=a[i],y=b[i]; a[i]=a[j]; a[j]=x; b[i]=b[j]; b[j]=y; } } for(int i=1;i<=n;i++) printf("%d ",a[i]); return 0; }
C++ :
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; string a[n+1]; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++){ for(int j=1;j<n-i+1;j++){ if(a[j]>a[j+1]){ string x=a[j]; a[j]=a[j+1]; a[j+1]=x; } } } for(int i=1;i<=n;i++)cout<<a[i]<<" "; return 0; }
- 1
Information
- ID
- 10759
- Time
- 1000ms
- Memory
- 16MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By