Pagini recente » Autentificare | Cod sursa (job #2068964) | Cod sursa (job #1583784) | Cod sursa (job #1874556) | Cod sursa (job #1108331)
#include <cstdio>
int N, K;
int v[20], vis[20];
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d %d", &N, &K);
int p=1;
while (p){
do{
++v[p];
}while (v[p]<=N && vis[v[p]]);
if (v[p]<=N){
if (p == K){
for (int i=1; i<=K; ++i)
printf("%d ", v[i]);
puts("");
}
else{
vis[v[p]] = 1;
++p;
v[p] = v[p-1];
}
}
else{
--p;
vis[v[p]] = 0;
}
}
return 0;
}