Pagini recente » Istoria paginii runda/usu9 | Atasamentele paginii oji201811 | Atasamentele paginii quarter_2018 | Balans | Cod sursa (job #477029)
Cod sursa(job #477029)
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
FILE*f=fopen("combinari.in","r");
FILE*g=fopen("combinari.out","w");
int k,n,st[20];
int main(){
fscanf(f,"%d %d",&n,&k);
for(int i=0;i<20;i++){
st[i]=1;
}
for(int i=1;i<=k;i++){
st[i]=0;
}
do{
for(int i=1;i<=n;i++)
if(!st[i])
fprintf(g,"%d ",i);
fprintf(g,"\n");
}while(next_permutation(st+1,st+n+1));
fclose(f);
fclose(g);
return 0;
}