Cod sursa(job #846533)
Utilizator | Data | 2 ianuarie 2013 13:16:22 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <deque>
#include <set>
using namespace std;
#define Max 66613
int x[20],n;
void comb()
{
int i=1;
x[1]=1;
while(x[n+1]==0)
{
for(int i=1;i<=n;i++)
if(x[i])printf("%d ",i); printf("\n");
i=1; while(x[i])
{
x[i]=0;
i++;
}
x[i]=1;
}
}
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
comb();
return 0;
}