Cod sursa(job #2259544)
Utilizator | Data | 13 octombrie 2018 14:18:51 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
fstream f ("submultimi.in");
ofstream g ("submultimi.out");
int x[1000],n,p;
void afis(int k)
{
for(int i=1;i<=k;i++)
g<<x[i]<<' ';
g<<"\n";
}
void back(int k)
{
for(int i=x[k-1]+1;i<=n;i++)
{
x[k] = i;
if(k==p)
afis(k);
back(k+1);
}
}
int main()
{
x[0] = 0;
f>>n>>p;
back(1);
return 0;
}