Chess(http://183.106.113.109/30stair/chess/chess.php?pname=chess&stair=21) answer

chess.c

#include <stdio.h>
 
int max(int a, int b, int c){
	
	int t = ( a > b ? a : b);
	return (t > c ? t : c);
}

int max(int a, int b){
	return (a > b? a : b);
}
 
int main(void){
 
    int w[1001]={0,};
    int b[1001]={0,};

    int dp[1001][16][16]={0,};
 
    int i=1, j, k;
    int size=1;
 
   // FILE *in=fopen("input.txt", "r");
 
    while(scanf("%d %d",&w[i],&b[i])!=EOF){
        i++;       // printf("%d\n", i);
        size=i;
    }
  
  
    for(i = 1; i <= size; i++){
 
        for(j = 0; j <= 15; j++){
            for(k = 0;k <= 15; k++){
 
                if( j + k > i ){
                    break;
                }
 
                if( j == 0 && k == 0 ){
                    dp[i][j][k] = 0;
                }else if( j == 0 ){
                	dp[i][j][k] = max(dp[i-1][j][k], dp[i-1][j][k-1]+b[i]);
                }else if( k == 0 ){
                	dp[i][j][k] = max(dp[i-1][j][k], dp[i-1][j-1][k]+w[i]);                  
                }

                else{
                    dp[i][j][k] = max(dp[i-1][j][k], dp[i-1][j-1][k]+w[i], dp[i-1][j][k-1]+b[i]);
                }
            }
    	}
    }
    
    printf("%d",dp[size][15][15]);
    return 0;
}

It may not work. I modified some of code without compiling.