suppose we had a subgroup H of order 10 in Z30xZ5. 2 and 5 are prime divisors of 10.
so we have a subgroup A of H of order 2, and a subgroup B of order 5 (cauchy's theorem for abelian groups).
now H is obviously abelian, so H = AB (chinese remainder theorem, or even the more elementary: |AB| = |A||B|/|A∩B|).
so H is cyclic, since if a generates A, and b generates B, ab generates H
((ab)m = ambm, right? (H is abelian). so if (ab)m = e, 5|m and 2|m, since H∩K = {e}).
so every subgroup of order 10 of Z30xZ5 is generated by an element of order 10. you already know how many elements of order 10 you have, now just don't count elements that generate the same subgroup of Z30xZ5 as some earlier one on your list of 24.
for example, any element of order 10 of the form (x,0) gives the same subgroup of order 10, isomorphic to Z10 x {0}.
(this group is generated by (3,0)).
use mathwonk's suggestion to speed up the counting...