Cod sursa(job #2105985)
Utilizator | Data | 14 ianuarie 2018 18:39:00 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,p,k,sol[100];
void bkt(int k)
{
for (int i=1;i<=n;i++)
{
sol[k]=i;
if (sol[k]>sol[k-1])
if (k==p)
{
for (int j=1;j<=k;j++)
fout<<sol[j]<<" ";
fout<<"\n";
}
else
bkt(k+1);
}
}
int main()
{
fin>>n>>p;
bkt(1);
return 0;
}