OJ Board

thanks for your replay i got ac.

which of these matrix are Symmetric?

1 6 7 1
7 2 3 1
1 3 2 7
1 5 4 1

or

1 4 5 1
7 2 3 1
1 3 2 7
1 5 4 1

the problem statement is not clear to me because i don't know what should i do when n the dimension of the matrix is even like 4.

another way is use gets( str_buff ) and use sscanf()
and cin.get( char );

1
3
3 1 2 3
2 4 5
3 4 2 6


the first one have 2 unique type {1,3}
the second one have 1 unique type {5}
the third one have 1 unique type {6}

sum of unique = 4
and first one have half of them and get 50% so it is easy to compute the percents of others.

char ch = 255;
ch is negative one !
but the clarification said that the character codes are non-negative.
then you can use only char.

I used only long long and it was sufficient.
you can do this problem with simple for loop.

Hi
How can i count all binary tree with specified depth D?
I know i can count it with DP and a version of catalan number.

I think this method have precision error because of using the cos function but input should be compatible with output of all methods that are correct not only for the method of problemseter.