Cod sursa(job #2030681)
Utilizator | Data | 1 octombrie 2017 23:05:26 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n, x[1100], j, i, maxim, s[11], sol[13], nr, m, k;
int v[11], a;
char ok;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
void back(int niv){
for(int i=x[niv-1]+1;i<=n;i++){
x[niv]=i;
for(int i=1;i<=niv;i++)
fout<<x[i]<<" ";
fout<<"\n";
if(niv<n){
back(niv+1);
}
}
}
int main(){
fin>>n;
x[0]=0;
back(1);
return 0;
}