OJ Board

Yeah,epsilon.I tried what you said,and I got accepted.
Because the algrithm is easy,I just used an direct program(sure an ugly one).I will try to simplify my program after then.

Thanks for your help !!

I don't quite understand why I got this result...

[c]
#include<stdio.h>
#include<string.h>
void main()
{
int k;
long sum,tmp;
long B[3],G[3],C[3];
while(scanf("%D%D%D%D%D%D%D%D%D",&B[0],&G[0],&C[0],&B[1],&G[1],&C[1],&B[2],&G[2],&C[2])!=EOF)
{
sum=B[1]+B[2]+C[0]+C[2]+G[0]+G[1];
tmp=sum ...

I'm trying to get my program easier with your advice.
Thanks.

yes..
sort like "pull 1213 onto 121" "moves 4 ontoover 3 " "pile -444 onto 321"
so...what else I haven't noticed?

I still got WA..
Here's my C code:
[c]#include<stdio.h>
#include<math.h>

void main()
{
double n,N,result1,result2,result3,result4;
/*"n" stands for the layers of the cats, "N" means the number of the cats in the hat*/

long input1,input2;
double a,b,c,i,j,multi1,multi2;
double exp=0;

while ...

I've confirmed my program for million times,but it still responds me WA...

[c]
#include<stdio.h>
#include<string.h>

int num[24][24];

/*num[Y][X] ,Y=across X=straight*/

void throw(int);

int find_y(int a)
{
int i,j;
for(i=0;i<24;i++)
{
for(j=0;j<24;j++)
{
if(num [j]==a)
return i ...