OJ Board

thx;
but i already passed 103 problem..
solution is DFS ^0^

How this problem solve?
dynamic ?
hmm :(

sorry but I want large input data and output data.

my i/o data;

[input]
10 10
1 2 3 4 5 6 7 8 9 10
4 5 2 3 3 5 6 7 9 10
20 30 2 1 3 4 5 6 9 10
1 2 3 4 5 6 7 8 9 10
5 2 3 4 5 6 9 10 22 30
2 3 4 5 6 7 8 9 10 11
2 3 4 5 6 7 8 9 10 11
3 4 5 6 7 8 9 10 11 12 ...

BCG 30 ..
I repair my code . so minimum is select Foward alphabet.
But .. I recive WA from judge ,also
Probably i will crazy..

Thx
i can't read english,well.
thank you

Thx :0
but i got WA also.

INPUT
342343434 1000000000 234333333 21342134 12341234 12345345 3455555 5645656 5
234234 12341234 1234234 4563456 5674576 476476 45764576 45764576 23452345
21341234 12341234 12341234 234334 56456 4563456 34563456 78768 5685678
23423423 23 3 34234 234234 234234 234234 ...

INPUT Data {1,2,3,4,5,6,7,8,9}; OUTPUT Data is GBC,GCB,BGC,BCG,CBG,CGBall correct .
Because 1,2,3.. is Arithmetic Sequence
Moreover Minimum size is constant also.

Tech me

new code..

BUT..
Dear mindae:

Your program has not solved the problem. It ran during 0.200 seconds.

-_______-;
How do pass to this problem?


/* @JUDGE_ID: 19591HZ 102 C */

#include <stdio.h>

unsigned long minimum;
int Solve[3]={0};
unsigned long Data[9]={0};

int main()
{
int i,j,k,l ...

/* @JUDGE_ID: 19591HZ 102 C */

#include <stdio.h>

unsigned long minimum;
int Solve[3]={0};
unsigned long Data[9]={0};

int main()
{
int i,j,k,l;
unsigned long temp=0;

while(1){

for(i=0;i<=8;i++)
scanf("%ld",&Data );

for(i=0;i<=8;i++)
minimum+=Data ;

for(i=0;i<=2;i++)
for(j=0;j<=2;j ...