Actually since you're not sure, I think I should post my solution.
I may be wrong.
So,
No. of cases with no two C's together and no two S's together =
No. of cases with no two S's together ( C's can me arranged anyhow) - No. of cases with no two S's together ( C's being together now)

|dw:1340389706521:dw|
Writing the letters with spaces between them.
And only putting S's in the spaces so as to ensure their seperation.
Total ways of doing this ( S's together C's anyhow) :
5C2 * 4!/2!