OJ Board

Code: Select all

1 2 3 4 5 6 7 8 9
1 2 3 4 5 6 7 8     	9
		5	10	5	20		10	5		10	20		10
		2147483648 2147483648 2147483648	2147483648	2147483648	2147483648	2147483648	2147483648	2147483648

Code: Select all

BCG 30
BCG 30
CBG 50
BCG 12884901882

Code: Select all

for i := 1 to 9 read(a[i]);
readln; { You need this line }

Code: Select all

#include "stdio.h"
#include "math.h"
#include "string.h"

#define Brown 1
#define Clear 2
#define Green 3
long b[3],g[3],c[3];
unsigned long min=pow(2,31);
long move[6]={0,};
char *comb[6]={"BGC","BCG","GBC","GCB","CBG","CGB"};


int main(void){
	int i,cnt=0,sc;
	scanf("%ld %ld %ld %ld %ld %ld %ld %ld %ld",&b[0],&g[0],&c[0],&b[1],&g[1],
			&c[1],&b[2],&g[2],&c[2]);
	move[0]=b[1]+b[2]+g[0]+g[2]+c[0]+c[1];
	move[1]=b[1]+b[2]+g[0]+g[1]+c[0]+c[2];
	move[2]=g[1]+g[2]+b[0]+b[2]+c[0]+c[1];
	move[3]=g[1]+g[2]+c[0]+c[2]+b[0]+b[1];
	move[4]=c[1]+c[2]+b[0]+b[2]+g[0]+g[1];
	move[5]=c[1]+c[2]+g[0]+g[2]+b[0]+b[1];
	for(i=0;i<6;i++){
		if(move[i]<min || (move[i]==min && strcmp(comb[cnt],comb[i])>0)){
			min=move[i];
			cnt=i;
		}
	}
	printf("%s %ld",comb[cnt],min);
	return 0;
}

Code: Select all

import java.io.*;
import java.util.*;

class Main
{
    static String ReadLn (int maxLg)  
    {
        byte lin[] = new byte [maxLg];
        int lg = 0, car = -1;
        String line = "";

        try
        {
            while (lg < maxLg)
            {
                car = System.in.read();
                if ((car < 0) || (car == '\n')) break;
                lin [lg++] += car;
            }
        }
        catch (IOException e)
        {
            return (null);
        }

        if ((car < 0) && (lg == 0)) return (null);  
        return (new String (lin, 0, lg));
    }

    public static void main (String args[])  
	{
		int i,j;
		int p,q,r;
		int min=0;
		int minb=0;
		int max=0;
		int sum=0;
		int minOrder=123;
		String order="";
		String border="";
		String input;
		StringTokenizer idata;
		int matrix[][]=new int[3][3];
		while ((input = Main.ReadLn (255)) != null)
        {
          idata = new StringTokenizer (input);
          for(i=0;i<3;i++)
			  for(j=0;j<3;j++)
			  {
				matrix[i][j]=Integer.parseInt (idata.nextToken());
				sum+=matrix[i][j];
				min=sum;
			  }
		  
		  
		  for(p=0;p<3;p++)      
			  for(q=0;q<3;q++)  
			  {
				if(p==q) continue;
				for(r=0;r<3;r++)
				  {
					if(r==p||r==q) continue;
					minb=0;
					for(i=0;i<3;i++)
						for(j=0;j<3;j++)
						{
							 if (i==0&&j==p) continue;
							 if (i==1&&j==q) continue;
							 if (i==2&&j==r) continue;
							 minb+=matrix[i][j];
						}
							
					if (minb<min)
					{
						min=minb;
						minOrder=(p+1)*100+(q+1)*10+r+1;
						switch(minOrder)
						{
							case 123: 
								order="BGC ";
							break;
							case 132:
								order="BCG ";
							break;
							case 213:
								order="GBC ";
							break;
							case 231: 
								order="GCB ";
							break;
							case 312:
								order="CBG ";
							break;
							case 321:
								order="CGB ";
							break;
						}
					}
						
					if (minb==min)
					{
						switch((p+1)*100+(q+1)*10+r+1)
						{
							case 123: 
								border="BGC ";
							break;
							case 132:
								border="BCG ";
							break;
							case 213:
								border="GBC ";
							break;
							case 231: 
								border="GCB ";
							break;
							case 312:
								border="CBG ";
							break;
							case 321:
								border="CGB ";
							break;
						}
						if (border.charAt(0)<order.charAt(0)) 
						{
							order=border;
						}
						else if(border.charAt(0)==order.charAt(0)) 
						{
							if (border.charAt(1)<order.charAt(1)) 
							{
								order=border;
							}
							else if(border.charAt(1)==order.charAt(1)) 
							{	
								if (border.charAt(2)<order.charAt(2)) 
								{
									order=border;
								}
							}
						}
					}
				  }
			  }
			  System.out.println(order+min);
		}
	}
}