Cod sursa(job #1626645)
Utilizator | Data | 3 martie 2016 10:52:35 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[20],n,i,k,sol[100],m;
void afis()
{
int i;
for (i=1;i<=m;i++) g<<a[sol[i]]<<" ";
g<<'\n';
}
bool ok(int k)
{
int i;
for (i=1;i<=k-1;i++) if (sol[i]==sol[k]) return false;
return true;
}
void back (int k)
{
int i;
if (k>m) afis();
else for (i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
f>>n>>m;
for (i=1;i<=n;i++) a[i]=i;
back(1);
return 0;
}