If you are using congruences its easier to check mod 4 and mod 25
We have 3 \equiv -1 \bmod 4 \Rightarrow 3^{100} \equiv 1 \bmod 4
By Euler Totient Theorem 3^{20} \equiv 1 \bmod 25 \Rightarrow 3^{100} \equiv 1 \bmod 25
Since gcd(4,25) = 1, we have 3^{100} \equiv 1 \bmod 100
In case you are not familiar using congruences use binomial theorem 3^{100} = (10-1)^{50} = 100k - \binom{50}{1} 10 + 1 = 100k-500+1 This immediately tells us that the remainder on division by 100 is 1.