Pagini recente » Cod sursa (job #2267357) | Cod sursa (job #1470190) | Cod sursa (job #117447) | Cod sursa (job #2818448) | Cod sursa (job #1126612)
#include <iostream>
#include <fstream>
using namespace std;
short N, REZ[17], VIZ[17];
void solve(int M, int k)
{
if(k == M + 1)
{
for(int i=1;i<=M;++i)
{
cout<<REZ[i]<<" ";
}
cout<<"\n";
}
else
for(int i=1+REZ[k-1];i<=N;++i)
{
REZ[k] = i;
solve(M, k + 1);
}
}
int main()
{
freopen("submultimi.in", "r", stdin);
// freopen("submultimi.out", "w", stdout);
scanf("%hd", &N);
for(int i=1;i<=N;++i)
solve(i, 1);
return 0;
}