Cod sursa(job #2143047)
| Utilizator | Data | 25 februarie 2018 15:21:32 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in" );
ofstream fout ("combinari.out");
int n,k,x[20];
void afisare(int p)
{
for (int i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<'\n';
}
bool ok(int p){
if(p==1)
return true;
if(x[p-1]>=x[p])
return false;
}
void back(int p){
for(int i=1;i<=n;i++){
x[p]=i;
if(p==k && ok(p) )
afisare(p);
else
if( ok(p) )
back(p+1);
}
}
int main()
{
fin>>n>>k;
back(1);
return 0;
}
