Pagini recente » Cod sursa (job #3121238) | Cod sursa (job #548376) | Cod sursa (job #3163447) | Cod sursa (job #1961059) | Cod sursa (job #1159338)
#include <iostream>
#include <cstdio>
using namespace std;
int n;
int p;
int sol[100];
void afisare()
{
for (int i=1; i<=p; i++)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
if (k == p + 1)
afisare();
else
for (int i=sol[k-1]+1; i<=n-p+k; i++)
{
sol[k] = i;
back(k+1);
}
}
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
for (p=1; p<=n; p++)
back(1);
return 0;
}