12604 - N-Queens M-Rooks Problem

#include <stdio.h>
int c[15], rdq[29], ldq[29], rdr[29], ldr[29];
int queen, rook, result, cnt, prev;

void solve(int N, int row, int queen_cnt, int rook_cnt){
    if(row == N){
        result++;
        return;
    } else {
        for(int i = 0; i < N; i++){
            if(queen_cnt < queen){
                if(!c[i] && !rdq[N-1+row-i] && !ldq[row+i] && !rdr[N-1+row-i] && !ldr[row+i]){
                    c[i] = rdq[N-1+row-i] = ldq[row+i] = 1;
                    solve(N, row+1, queen_cnt+1, rook_cnt);
                    c[i] = rdq[N-1+row-i] = ldq[row+i] = 0;
                }
            }
            if(rook_cnt < rook){
                if(!c[i] && !rdq[N-1+row-i] && !ldq[row+i]){
                    c[i] = 2;
                    rdr[N-1+row-i]+= 1;
                    ldr[row+i]+=1;
                    solve(N, row+1, queen_cnt, rook_cnt+1);
                    c[i] = 0;
                    rdr[N-1+row-i]-=1;
                    ldr[row+i]-=1;
                }
            }
        }
    }
    return;
}
int main(){
    while(scanf("%d%d", &queen, &rook) != EOF){
        result = 0;
        int N = queen + rook;
        solve(N, 0, 0, 0);
        printf("%d\n", result);
    }
    return 0;
}