Cod sursa(job #2068124)
Utilizator | Tiberiu Ungurianu tiberiu392 | Data | 17 noiembrie 2017 10:54:17 |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int n, k;
int s[20];
void tipar(int k)
{
for(int i = 1 ; i <= k ; i++)
g << s[i] << " ";
g << '\n';
}
void bkt(int p)
{
if(p == k+1)
tipar(k);
else
for(int i = s[p-1]+1 ; i <= n-k+p ; i++)
{
s[p] = i;
bkt(p+1);
}
}
int main()
{
f >> n;
for(k = 1; k <= n; k++)
bkt(1);
return 0;
}