Cod sursa(job #2191654)
Utilizator | Data | 3 aprilie 2018 12:01:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m, sol[30];
bool ok (int k)
{
for(int i=1; i<k ; i++)
if(sol[i]==sol[k])
return false;
return true;
}
void afis ()
{
for(int i=1; i<=m; i++)
g<<sol[i]<<' ';
g<<'\n';
}
void backtracking (int k)
{
if(k>m)
afis();
else
{
for(int i=sol[k-1]+1; i<=n ; i++)
{
sol[k]=i;
if(ok(k))
backtracking(k+1);
}
}
}
int main()
{
f>>n>>m;
backtracking(1);
return 0;
}