Cod sursa(job #1182316)
Utilizator | Data | 6 mai 2014 08:16:40 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(){
ifstream ifs("submultimi.in");
ofstream ofs("submultimi.out");
int N; ifs>>N;
// 1, NON-LEXICOGRAPHIC, BIT OPS
/*int l=1<<N;
for(int i=1; i<l; i++){
for(int j=1; j<=n; j++)
if(i&(1<<(j-1)))
cout<<j<<" ";
cout<<"\n";
}
*/
// 2, lexicographic, backtracking
int k=0;
int a[18];
for(int i=0;i<18;i++) a[i]=0;
while(k>=0){
if(a[k]<N){
a[k]++;
for(int i=0;i<=k;i++)
ofs<<a[i]<<" ";
ofs<<"\n";
a[++k]=a[k-1];
}
else
k--;
}
}