This paper formulates two types of standard quadratic congruences modulo a prime integer that is a multiple of three or ten. The authors establish formulas for solving these congruences without using the Chinese Remainder Theorem. They show that a congruence of the form x^2 ≡ 3 (mod p), where p is a prime multiple of three, has four solutions. A congruence of the form x^2 ≡ 10 (mod p), where p is a prime multiple of ten, also has four solutions. The authors provide examples to illustrate the formulations and conclude that they have succeeded in formulating these classes of quadratic congruences for the first time.