蓝桥杯 递归求二项式系数值

#include<stdio.h>
int JC(int n){
    if(n==1||n==0) return 1;
    else
    n*=JC(n-1);
    n--;
}
int main(){
    int x,s,p,q;
    scanf("%d%d",&s,&x);
    if(s==x||s==0) printf("1");
    else{
        
        p=JC(x-1)/(JC(s)*JC(x-s-1));
        q=JC(x-1)/(JC(s-1)*JC(x-s));
    
    printf("%d",q+p);
        }
    return 0;
}