Cod sursa(job #1026312)
| Utilizator | Data | 11 noiembrie 2013 14:57:32 | |
|---|---|---|---|
| Problema | Combinari | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[11], n, viz[11], m;
int cont(int k)
{
int i;
for(i=1;i<=k-1;i++)
{
if(x[i]==x[k])
{
return 0;
}
}
return 1;
}
void tipar()
{
int i;
for(i=1;i<=m;i++)
{
g<<x[i]<<" ";
}
g<<'\n';
}
void back(int k)
{
int i;
for(i=x[k-1]+1; i<=n; i++)
{
x[k]=i;
viz[i]=1;
if(k==m)
tipar();
else
back(k+1);
viz[i]=0;
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}
