Cod sursa(job #1787599)
Utilizator | Data | 24 octombrie 2016 20:25:27 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N,P,x[30];
void combinari(int k)
{
if(k>P)
{
for(int i=1;i<=P;i++)
{
fout<<x[i]<<" ";
}
fout<<'\n';
}
else
{
for(int i=x[k-1]+1;i<=N-(P-k);i++)
{
x[k]=i;
combinari(k+1);
x[k]=0;
}
}
}
int main()
{
fin>>N>>P;
combinari(1);
return 0;
}