int permutation(int n, int m){ int max; if(n > (m-n)){ max = n; }else{ max = m-n; } if(max == n){ return(int) (fanc(m,max) / fanc(m-n, 0)); }else{ return(int) (fanc(m,max) / fanc(n,0 )); } }
int main() { char *str = NULL; str = getmemory(); printf("%s\n",str); free(str); char *c; c = "cxd2"; fanc(c); printf("%s\n",c); char x[] = "cxd3"; fanc1(x); printf("%s\n",x); char d[] = "cxd4"; fanc2(d); printf("%s\n",d); return 0; }