Pagini recente » Cod sursa (job #1324829) | Cod sursa (job #1842365) | Cod sursa (job #214372) | Cod sursa (job #534636) | Cod sursa (job #2706918)
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
#define test " test "
#define ll long long
#define pii pair<int, int>
#define FASTIO \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0);
#define FILES \
freopen("permutari.in", "r", stdin); \
freopen("permutari.out", "w", stdout);
#define testcase \
int T; \
cin >> T; \
while (T--)
#define vec vector<int>
using namespace std;
int ans[9], n;
bool ok(int pos, int val)
{
for(int i = 0; i < pos; i++)
if(ans[i] == val)
return 0;
return 1;
}
void bkt(int pos)
{
if(pos == n)
{
for(int i = 0; i < n; i++)
cout << ans[i] << ' ';
cout << '\n';
return;
}
for(int i = 1; i <= n; i++)
if(ok(pos, i))
ans[pos] = i, bkt(pos + 1);
}
signed main()
{
FASTIO; FILES;
cin >> n;
bkt(0);
return 0;
}