Cod sursa(job #2890730)
Utilizator | Data | 16 aprilie 2022 13:54:51 | |
---|---|---|---|
Problema | Submultimi | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
void print_solutie(int sol[17], int k)
{
for(int i =1; i<=k; i++)
{
out<<sol[i]<<" ";
}
out<<"\n";
}
void bkt (int p, int k,int n, int sol[17])
{
if(p==k+1 && k!=0)
{
print_solutie(sol,k);
return;
}
for(int i=1+sol[p-1]; i<=n; i++)
{
sol[p]=i;
bkt(p+1,k,n,sol);
}
}
int main()
{
int n,k;
int sol[17]={0};
in>> n;
for( k=0; k<=n;k++)
bkt(1,k,n,sol);
return 0;
}