Cod sursa(job #2068600)
Utilizator | Data | 18 noiembrie 2017 09:36:37 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int k,n,m,uz[10001],sol[1001];
void comb(int k)
{ int i;
if(k>m)
{
for(i=1;i<=k;i++)
fout<<sol[i];
}
for(i=sol[k-1]+1;i<=n;i++)
if(uz[i]==0)
{
uz[i]=1;
sol[k]=i;
comb(k+1);
uz[i]=0;
}
}
int main()
{
fin>>n>>m;
comb(1);
return 0;
}