Cod sursa(job #3376362)
| Utilizator | Data | 17 noiembrie 2026 15:55:00 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 25
int n,kcer;
int v[MAXN];
void afis(int k){
for(int i=1;i<=k;i++){
cout<<v[i]<<" ";
}
cout<<"\n";
}
bool valid(int k){
if(k==1){
return true;
}
if(v[k]>v[k-1]){
return true;
}
return false;
}
void backt(int k){
for(int i=v[k-1]+1;i<=n;i++){
v[k]=i;
if(k<kcer || valid(k)){
afis(k);
backt(k+1);
}
}
}
int main(){
ifstream cin("submultimi.in");
ofstream cout("submultimi.out");
cin>>n;
v[0]=0;
for(int i=1;i<=n;i++){
v[i]=i;
}
backt(1);
}
