#include "bits/stdc++.h"
#ifdef LOCAL
#include "bits/debug.h"
#else
#define dd(...) 42
#endif
#define ll long long
#define ull unsigned long long
#define nl '\n'
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a) rend(a)
#define sz(a) ((int)a.size())
#define ff first
#define ss second
#define f(i, n) for (int i = 0; i < n; ++i)
// #define PROB_NAME "sliding"
using namespace std;
// const int INF = 1e9;
// const ll INFF = 1e18;
// const int M = 1e9 + 7;
ll g, h, n, m, k, p, q, x, y, z;
void solve() {
string s;
cin >> s;
cout << s;
reverse(all(s));
cout << s << nl;
}
void TESTCASES() {
int t = 1;
cin >> t;
for (int i = 1; i <= t; ++i) {
solve();
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef PROB_NAME
freopen(PROB_NAME ".in", "r", stdin);
freopen(PROB_NAME ".out", "w", stdout);
#endif
TESTCASES();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
9 |
Incorrect |
13 ms |
724 KB |
Output isn't correct |
10 |
Incorrect |
13 ms |
724 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
16 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
17 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
18 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
19 |
Incorrect |
12 ms |
1068 KB |
Output isn't correct |
20 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |