Cod sursa(job #1736850)
| Utilizator | Data | 2 august 2016 19:27:51 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
//idee
//combinari de lungime variabila
//toate sirurile cu elem. crescatoare
#include <fstream>
using namespace std;
ifstream fi("submultimi.in");
ofstream fo("submultimi.out");
int a[100],k,i,n;
void afis(int i){
int j;
for(j=1;j<=i;j++)fo<<a[j]
<<" ";
fo<<'\n';
}
int valid(int i){
int j;
if(i>1)
if(a[i-1]>=a[i])return 0;
return 1;
}
void backtr(int i){
int val;
for(val=1;val<=n;val++){
a[i]=val;
if(valid(i))
{afis(i);
backtr(i+1);
}
}
}
int main(){
fi>>n;
backtr(1);
return 0;
}
