Cod sursa(job #546429)
Utilizator | Lepadat Mihai-Alexandru skull | Data | 4 martie 2011 22:16:18 |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
using namespace std;
#define nmax 18
int st[nmax];
int N;
void back( int k )
{
int i;
if (k > 1)
{
for (i = 1; i < k; ++i) printf("%d ", st[i]);
printf("\n");
}
for (i = st[k-1]+1; i <= N; ++i) { st[k] = i; back(k+1); }
}
int main ()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d", &N);
back(1);
return 0;
}