Cod sursa(job #2199614)
| Utilizator | Data | 28 aprilie 2018 14:24:22 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[35],n,viz[35],m;
void tipar()
{
for(int i=1;i<=m;i++)
fout<<st[i]<<" ";
fout<<"\n";
}
void Back(int k)
{
if(k==m+1) tipar();
else
for(int i=st[k-1]+1;i<=n;i++)
if(viz[i]==0)
{
st[k]=i;
viz[i]=1;
Back(k+1);
viz[i]=0;
}
}
int main()
{
fin>>n>>m;
Back(1);
return 0;
}
