OJ Board

Code: Select all

#include<stdio.h>

int main()
{
	unsigned long bins[9]; /*2d array[3][3] could hv been used too*/
	unsigned long cost[6];/*cost of BCG BGC CBG CGB GBC GCB (in that order) - only these six r possible*/
	unsigned long sum;
	
	int i;
	int c;
	while((c=getc(stdin)) != EOF)
	{
		ungetc(c,stdin);
		
		sum = 0; /*reset*/
		
  		/*BGC BGC BGC = 012 345 678*/
		for(i=0;i<9;i++)
		{
			scanf("%lu",&bins[i]);
			sum += bins[i];
		}
	
 		/*Now calculating costs*/
 		/*BCG*/
 		cost[0] = sum - (bins[0]+ bins[5]+ bins[7]);
 		/*BGC*/
 		cost[1] = sum - (bins[0]+ bins[4]+ bins[8]);
 		/*CBG*/
 		cost[2] = sum - (bins[2]+ bins[3]+ bins[7]);
 		/*CGB*/
 		cost[3] = sum - (bins[2]+ bins[4]+ bins[6]);
 		/*GBC*/
 		cost[4] = sum - (bins[1]+ bins[3]+ bins[8]);
 		/*GCB*/
 		cost[5] = sum - (bins[1]+ bins[5]+ bins[6]);
	
        /*find smallest cost packing scheme*/
	
         int min = 0;
         for(i=1;i<6;i++)
         	if(cost[i] < cost[min])
         		min = i;
			
	    /*print output*/
	    switch(min)
	    {
	    	case 0: printf("BCG %lu\n",cost[min]);break;
	    	case 1: printf("BGC %lu\n",cost[min]);break;
	    	case 2: printf("CBG %lu\n",cost[min]);break;
	    	case 3: printf("CGB %lu\n",cost[min]);break;
	    	case 4: printf("GBC %lu\n",cost[min]);break;
	    	case 5: printf("GCB %lu\n",cost[min]);break;
    	}
	}
	return 0;
}

Code: Select all

while(scanf(" %lu",&bins[0])==1)
{ 
      sum = bins[0]; /*reset*/ 
       
        /*BGC BGC BGC = 012 345 678*/ 
      for(i=1;i<9;i++) 
      { 
         scanf("%lu",&bins[i]); 
         sum += bins[i]; 
      }
    
      .....
}

Code: Select all

1_2_3_4_5_6_7_8_9
1_2_3_4_5_6_7_8_9_

Code: Select all

BCG 30
BCG 30
BCG 30

Code: Select all

Sorry, it was removed.

Code: Select all

Sorry, it was removed.

Code: Select all

while (true) {
if (cin.eof()) break;
.
.
.

Code: Select all

while (scanf("%d %d %d %d %d %d %d %d %d", 
			&data[0],&data[1],&data[2], 
			&data[3],&data[4],&data[5], 
			&data[6],&data[7],&data[8])==9) {...

Code: Select all

#include <stdio.h> 
int main(void) 
{ 
	 long int a[9]; 
	 long int b[6]; 
	 long int MIN=2147483647;
	 int MINNUM; 


	while(scanf("%ld%ld%ld%ld%ld%ld%ld%ld%ld", &a[0], &a[1], &a[2], &a[3], &a[4], &a[5], &a[6], &a[7], &a[8]) == 9) 
	{ 
		


	b[1]=a[3]+a[6]+a[1]+a[7]+a[2]+a[5]; 
	b[0]=a[3]+a[6]+a[2]+a[8]+a[1]+a[4]; 
	b[4]=a[4]+a[7]+a[0]+a[6]+a[2]+a[5]; 
	b[5]=a[4]+a[7]+a[2]+a[8]+a[0]+a[3]; 
	b[2]=a[5]+a[8]+a[0]+a[6]+a[1]+a[4]; 
	b[3]=a[5]+a[8]+a[1]+a[7]+a[0]+a[3]; 


	for(int k=0;k<6;k++) 
	{ 

		if(b[k]<MIN) 
		{ 
			MIN=b[k]; 
			MINNUM=k; 
		} 
	} 
		if(MINNUM==0) 
		printf("BCG %lu\n",b[0]);
	else if(MINNUM==1)
		printf("BGC %lu\n",b[1]);
	else if(MINNUM==2) 
		printf("CBG %lu\n",b[2]);
	else if(MINNUM==3)
		printf("CGB %lu\n",b[3]);
	else if(MINNUM==4)
		printf("GBC %lu\n",b[4]);
	else if (MINNUM==5)
		printf("GCB %lu\n",b[5]);
	 	} 
return 0; 
}