Pagini recente » Cod sursa (job #2981514) | Cod sursa (job #2949940) | Cod sursa (job #1731684) | Algoritmul lui Dinic | Cod sursa (job #613960)
Cod sursa(job #613960)
#include<iostream>
#include<fstream>
using namespace std;
int n,sol[1000];
ifstream f("submultimi.in");
ofstream g("submultimi.out");
void afisare(int n){
if(n==0)
cout<<"multimea vida";
else
for(int i=1;i<=n;i++)
cout<<sol[i]<<" ";
cout<<endl;
}
void bkt(int p){
afisare(p-1);
for(int i=1+sol[p-1];i<=n;i++){
sol[p]=i;
bkt(p+1);
}
}
int main(){
f>>n;
bkt(1);
return 0;
}