Cod sursa(job #1049811)
| Utilizator | Data | 7 decembrie 2013 20:13:31 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int v[19],n,m;
int valid(int k)
{
int i;
for(i=1;i<k;i++)
if(v[k]==v[i])
return 0;
return 1;
}
void tipar(int k)
{
int i;
for(i=1;i<=k;i++)
g<<v[i]<<" ";
g<<"\n";
}
void back(int k)
{
int i;
for(i=v[k-1]+1;i<=n;i++)
{
v[k]=i;
if(valid(k))
{
if(k==m)
tipar(k);
else
if(k<m)
back(k+1);
}
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}
