Submission #18626

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <complex>
using namespace std;
  
#ifdef DEBUG
FILE *fp = freopen("input.txt", "r", stdin);
#endif

#define FILL(c, v) memset(c, v, sizeof(c))
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, c) for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define SZ(c) (c).size()
#define RANGE(x, a, b) ((a <= x) && (x <= b))

const int INF = 1e9;
const double EPS = 1e-9;

typedef long long ll;
typedef pair<int, int> pi;

int main() {
	int n;
	cin >> n;

	vector<string> name(n);
	REP(i, n) {
		cin >> name[i];
		reverse(ALL(name[i]));
	}

	sort(ALL(name));

	REP(i, n) {
		reverse(ALL(name[i]));
		cout << name[i] << endl;
	}



	return 0;
}

Submission Info

Judge Result