I tried fortran 77 linbcg with default implementation and flag 1. linbcg routine goes through 67 iterations with exact solution!! Isn't it should converge in 1 iteration. Is there a problem in this code?? It always gives the right answer, but should not go through many iterations with the exact solution. Help!!

The same problem exists in linbcg C++ code. For a simple 2x2 symmetric matrix, it takes 100 iterations to converge to the solution. Have you solve this issue?
Check this post http://www.nr.com/forum/showthread.php?t=933 for details of the issue.