Cod sursa(job #2301838)
Utilizator | Data | 13 decembrie 2018 16:18:58 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
int n,p,k,s[50],i;
void A(int k) {
if(k-1==p) {
for(int i=1;i<=p;i++)
printf("%d ",s[i]);
printf("\n");
}
else
for(int 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); }