Cod sursa(job #1881236)
Utilizator | Data | 16 februarie 2017 11:58:23 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout("combinari.out");
int p,s[25],n;
void af()
{
for (int i=1;i<=p;++i)
{
fout << s[i] <<' ';
}
fout << '\n';
}
void bc(int k)
{
if (k==p+1)
{
af();
}
else
for (int i=s[k-1]+1;i<=n;++i)
{
s[k]=i;
bc(k+1);
}
}
int main()
{
fin >> n >> p;
bc(1);
return 0;
}