Cod sursa(job #1518278)
| Utilizator | Data | 5 noiembrie 2015 19:55:12 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,v[10];
inline int valid(int k)
{
return 1;
}
inline int solutie(int k)
{
return (k==m);
}
void afisare(int k)
{
for(int i=1;i<=k;i++) g<<v[i]<<" ";
g<<"\n";
}
void backt(int k)
{
for(int i=v[k-1]+1;i<=n;i++)
{
v[k]=i;
if(valid(k))
if(solutie(k)) afisare(k);
else backt(k+1);
}
}
int main()
{
f>>n>>m;
backt(1);
return 0;
}
