Cod sursa(job #1165970)
| Utilizator | Data | 3 aprilie 2014 08:36:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int sol[20];
int n,p,k;
void afisare()
{
int i;
for(i=1;i<n;i++)
out<<sol[i]<<" ";
out<<'\n';
}
int verificare(int k)
{
int i;
for(i=1;i<k;i++)
if(sol[i]>=sol[k]) return 0;
return 1;
}
void bk(int k)
{if(k==1+p) afisare();
else
for(int i=1;i<=n;i++)
{
sol[k]=i;
if(verificare(k))
bk(k+1);
}
}
int main()
{
in>>n>>p;
bk(1);
return 0;
}
