Cod sursa(job #1905980)
| Utilizator | Data | 6 martie 2017 11:54:15 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[20],b[20];
void bkt(int k,int len, int maxx)
{
if(k-1==maxx)
{
for(int i=1;i<=maxx;i++)
g<<a[i]<<" ";
g<<"\n";
}
else
{
for(int i=1;i<=len;i++)
{
if(!b[i] && a[k-1] < i)
{
a[k]=i;
b[i]=1;
bkt(k+1,len,maxx);
b[i]=0;
}
}
}
}
int main()
{
int n,k;
f>>n>>k;
bkt(1,n,k);
return 0;
}
