Search found 10 matches

by Hojjat jafary
Mon Nov 12, 2007 8:52 pm
Forum: Volume 113 (11300-11399)
Topic: 11349 - Symmetric Matrix
Replies: 43
Views: 19263

thanks for your replay i got ac.
by Hojjat jafary
Mon Nov 12, 2007 4:37 pm
Forum: Volume 113 (11300-11399)
Topic: 11349 - Symmetric Matrix
Replies: 43
Views: 19263

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
by Hojjat jafary
Mon Nov 12, 2007 12:19 pm
Forum: Volume 113 (11300-11399)
Topic: 11340 - Newspaper
Replies: 154
Views: 43488

Code: Select all

like down
by Hojjat jafary
Mon Nov 12, 2007 11:39 am
Forum: Volume 113 (11300-11399)
Topic: 11349 - Symmetric Matrix
Replies: 43
Views: 19263

11349 - Symmetric Matrix

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.
by Hojjat jafary
Mon Nov 12, 2007 11:36 am
Forum: Volume 113 (11300-11399)
Topic: 11340 - Newspaper
Replies: 154
Views: 43488

another way is use gets( str_buff ) and use sscanf()
and cin.get( char );
by Hojjat jafary
Mon Nov 12, 2007 10:01 am
Forum: Volume 113 (11300-11399)
Topic: 11348 - Exhibition
Replies: 24
Views: 10222

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.
by Hojjat jafary
Mon Nov 12, 2007 9:31 am
Forum: Volume 113 (11300-11399)
Topic: 11340 - Newspaper
Replies: 154
Views: 43488

Re

char ch = 255;
ch is negative one !
but the clarification said that the character codes are non-negative.
then you can use only char.
by Hojjat jafary
Sun Nov 11, 2007 9:56 pm
Forum: Volume 113 (11300-11399)
Topic: 11350 - Stern-Brocot Tree
Replies: 6
Views: 4342

RE

I used only long long and it was sufficient.
you can do this problem with simple for loop.
by Hojjat jafary
Sun Sep 16, 2007 3:15 pm
Forum: Algorithms
Topic: Counting Binary Tree
Replies: 0
Views: 1411

Counting Binary Tree

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.
by Hojjat jafary
Sun Sep 16, 2007 10:08 am
Forum: Volume 101 (10100-10199)
Topic: 10180 - Rope Crisis in Ropeland!
Replies: 39
Views: 21542

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.

Go to advanced search