Mai intai trebuie sa te autentifici.
Cod sursa(job #1784562)
Utilizator | Data | 20 octombrie 2016 11:03:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.07 kb |
#include <stdio.h>
#include <stdlib.h>
#define MAXN 1000000
#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
if(pbuf==BUF_SIZE){
fread(buf, BUF_SIZE, 1, fi);
pbuf=0;
}
return buf[pbuf++];
}
inline long long nextnum(){
long long a=0;
char c=nextch();
while((c<'0' || c>'9') && c!='-')
c=nextch();
int semn=1;
if(c=='-'){
semn=-1;
c=nextch();
}
while('0'<=c && c<='9'){
a=a*10+c-'0';
c=nextch();
}
return a*semn;
}
int stiva[20], n, k;
void bkt(int poz, int prev){
if(poz==k+1){
for(int i=1;i<=k;i++)
fprintf(fo,"%d ", stiva[i]);
fprintf(fo,"\n");
}
else{
for(int i=prev+1;i<=n;i++){
stiva[poz]=i;
bkt(poz+1, i);
}
}
}
int main(){
fi=fopen("combinari.in","r");
fo=fopen("combinari.out","w");
n=nextnum();
k=nextnum();
bkt(1, 0);
fclose(fi);
fclose(fo);
return 0;
}