Cod sursa(job #2051331)
| Utilizator | Data | 28 octombrie 2017 19:54:35 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,p, v[100];
bool valid(int k){
for (int i=1;i<=k-1;i++)
if (v[i]==v[k]) return 0;
return 1;
}
void bt(int k){
for (int i=v[k-1]+1;i<=n;i++){
v[k]=i;
if (valid(k)){
if (k==p){
for (int j=1;j<=k;j++)
out<<v[j]<<' ';
out<<'\n';
}else bt(k+1);
}
}
}
int main()
{
in>>n>>p;
bt(1);
return 0;
}
