Cod sursa(job #1892951)
Utilizator | Tiberiu Raducanu Tibiraducanu | Data | 25 februarie 2017 13:32:45 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <bits/stdc++.h>
using namespace std;
int v[20],n,k,pos;
char s[50];
void bkt(int p){
if(p==k+1){
pos=0;
for(int i=1;i<=k;i++){
if(v[i]>=10){
s[pos]='0'+v[i]/10;
s[pos+1]='0'+v[i]%10;
s[pos+2]=' ';
pos+=3;
}
else{
s[pos]='0'+v[i];
s[pos+1]=' ';
pos+=2;
}
}
s[--pos]=NULL;
printf("%s\n",s);
}
else for(int i=v[p-1]+1;i<=n;i++) v[p]=i, bkt(p+1);
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(1);
return 0;
}