Step 1:
Let the coin be tossed \( n \) times.
The probability of getting no head (i.e., all tails) is:
\[
\left(\frac{1}{2}\right)^n
\]
Step 2:
Therefore, the probability of getting at least one head is:
\[
1 - \left(\frac{1}{2}\right)^n
\]
Step 3:
Given that this probability is more than \(99% = 0.99\):
\[
1 - \left(\frac{1}{2}\right)^n>0.99
\]
Step 4:
Rearranging:
\[
\left(\frac{1}{2}\right)^n<0.01
\]
Taking logarithms:
\[
n \log\left(\frac{1}{2}\right)<\log(0.01)
\]
Step 5:
Using logarithmic values:
\[
n>\frac{\log(0.01)}{\log(0.5)} = \frac{-2}{-0.3010} \approx 6.64
\]
Step 6:
Since \( n \) must be a whole number, the minimum value satisfying the condition is:
\[
n = 7
\]
Final Answer (up to two decimal places):
\[
\boxed{7.00}
\]