Cod sursa(job #1652236)
| Utilizator | Data | 14 martie 2016 19:51:05 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream r ("combinari.in");
ofstream w ("combinari.out");
int n,p,v[20] ;
int solutie(int k);
void afisare(int k);
void BK(int k);
int main()
{
r>>n;
r>>p;
BK(1);
return 0;
}
void BK(int k)
{
int i;
for (i=v[k-1]+1; i<=n; i++)
{
v[k]=i;
if (solutie(k))
afisare(k);
else
BK(k+1);
}
}
int solutie(int k)
{
if (k==p) return 1;
return 0;
}
void afisare(int k)
{
int i;
for (i=1; i<=k; i++) w<<v[i]<<" ";
w<<endl;
}
