Cod sursa(job #2476353)
Utilizator | Ilie Dumitru Ilie_Mity | Data | 18 octombrie 2019 18:16:58 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include<cstdio>
using namespace std;
FILE *f=fopen("combinari.in", "r"), *g=fopen("combinari.out", "w");
int N, P, st[20];
void tipar()
{
int i;
for(i=0;i<P;++i)
fprintf(g, "%i ", st[i]+1);
fprintf(g, "\n");
}
bool valid(int i)
{
if(!i || st[i]>st[i-1])
return true;
return false;
}
void back(int k)
{
int i;
for(i=0;i<N;++i)
{
st[k]=i;
if(valid(k))
{
if(k==P-1)
tipar();
else
back(k+1);
}
}
}
int main()
{
fscanf(f, "%i %i", &N, &P);
back(0);
return 0;
}