Cod sursa(job #2306464)
Utilizator | Data | 22 decembrie 2018 13:26:49 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<cstdio>
int n,p,s[19],i;
void A(int k)
{
if(k-1==p)
{
for(i=1;i<=p;i++)
printf("%d ",s[i]);
printf("\n");
}
else
for(i=s[k-1]+1;i<=n-p+k;i++)
s[k]=i,A(k+1);
}
int main()
{
freopen("combinari.in","r",stdin),freopen("combinari.out","w",stdout),scanf("%d%d",&n,&p),A(1);
}