Cod sursa(job #768827)
Utilizator | Data | 17 iulie 2012 19:35:53 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int a[20],b[20];
ofstream g("combinari.out");
void back(int k,int n,int m)
{
if (k-1==m)
{
for(int i=1;i<=n;i++)
g<<a[i]<<" ";
g<<endl;
}
else
{
for(int i=1;i<=n;i++)
if(!b[i]&&a[k-1]<i)
{
a[k]=i;
b[i]=1;
back(k+1,n,m);
b[i]=0;
}
}
}
int main()
{
ifstream f("combinari.in");
int n,m;
f>>n>>m;
back(1,n,m);
f.close();
g.close();
return 0;
}