Cod sursa(job #1275635)
| Utilizator | Data | 25 noiembrie 2014 13:58:09 | |
|---|---|---|---|
| Problema | Combinari | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n,viz[9],x[9],t;
int cont (int i)
{
for(int j=i;j<=n;j++)
if(viz[j]==1)
return 0;
return 1;
}
void tipar (int k)
{
for(int i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<'\n';
}
void back(int k)
{
for(int i=1;i<=n;i++)
{
if(viz[i]==0&&cont(i))
{
x[k]=i;
viz[i]=1;
if(k==t)
{
tipar(k);
}
else
{
back(k+1);
}
viz[i]=0;
}
}
}
int main()
{
fin>>n>>t;
back(1);
return 0;
}
