【題組】4. Let LOVENSYSU be a string of 9 characters. How many different permutations of thesecharacters
問題詳情
【題組】4. Let LOVENSYSU be a string of 9 characters. How many different permutations of thesecharacters such that the two S's are not adjacent? (A) 141120； (B) 362880； (C) 181440； (D)40320.