Submission #18512

---

Source Code Expand

#include<deque>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
int main(){
  int i,j;
  int n;
  cin>>n;
  char s[100][21],t[100][21];
  string a[100];
  for(i=0;i<n;++i){
    cin>>s[i];
    int ln=strlen(s[i]);
    for(j=0;j<ln;++j)
      t[i][ln-j-1]=s[i][j];
    t[i][ln]='\0';
    a[i].assign(t[i]);
  }
  sort(a,a+n);
  for(i=0;i<n;++i){
    int ln=a[i].length();
    for(j=ln-1;j>=0;--j)
      cout<<a[i][j];
    cout<<endl;
  }
  return 0;
}

Submission Info

Judge Result