1405A - Permutation Forgery - CodeForces Solution


constructive algorithms *800

Please click on ads to support us..

Python Code:

for s in[*open(0)][2::2]:print(*s.split()[::-1])

C++ Code:

#include <bits/stdc++.h>
using namespace std;

int T, N;
int P[100];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> T;
    while (T--) {
        cin >> N;
        for (int n = 0; n < N; n++) cin >> P[n];
        for (int n = N-1; n >= 0; n--) cout << P[n] << ' '; cout << '\n';
    }
}


Comments

Submit
0 Comments
More Questions

1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game
1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection
2B - The least round way
1324A - Yet Another Tetris Problem
246B - Increase and Decrease
22E - Scheme
1566A - Median Maximization
1278A - Shuffle Hashing