Cod sursa(job #2399429)
Utilizator | Data | 7 aprilie 2019 14:53:04 | |
---|---|---|---|
Problema | Submultimi | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
using namespace std;
int n,k,v[20];
void bt(int nivel)
{
int i;
for(i = v[nivel-1] + 1;i <= n;i++)
{
v[nivel]=i;
for(int j=1;j<=nivel;j++)
cout<<v[j]<<" ";
cout<<'\n';
if(nivel<n)
bt(nivel+1);
}
}
int main()
{
cin>>n;
bt(1);
return 0;
}