Cod sursa(job #1880008)
Utilizator | Sabau Valeriu Kron | Data | 15 februarie 2017 12:41:43 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[20],vis[20],n,K;
int check(int k)
{
for(int i=1;i<k;i++)
if(a[k]==a[i]) return 0;
return 1;
}
void print(int k)
{
for(int i=1;i<=k;i++)
g << a[i] << " ";
g << "\n";
}
void bk(int k)
{
for(int i=a[k-1]+1;i<=n;i++)
{
a[k]=i;
if(check(k))
{
if(k==K)
{
print(k);
}else bk(k+1);
}
}
}
int main()
{
f >> n>> K;
bk(1);
return 0;
}