Cod sursa(job #3254260)
Utilizator | Data | 6 noiembrie 2024 20:10:59 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
std::ifstream fin("combinari.in");
std::ofstream fout("combinari.out");
int sol[20];
bool f[20];
int n, m;
void back(int k)
{
if(k==m)
{
for(int i=0; i<m; ++i)
fout<<sol[i]<<' ';
fout<<'\n';
return;
}
for(int i=(k==0)?1:sol[k-1]+1; i<=n; ++i)
if(!f[i])
{
f[i]=true;
sol[k]=i;
back(k+1);
f[i]=false;
}
}
int main()
{
fin>>n>>m;
back(0);
return 0;
}