RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
COCI00302

Font

Unrated 레이팅 미적용
난이도
1s
시간 제한
32MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

\(6^{th}\) round, March \(8^{th}\), 2014

Little Ivica got himself a summer job at a company that produces computer fonts. The branch of the
company where Ivica works at specialises in testing computer fonts and Ivica's team is responsible of
testing only lowercase letters of the English alphabet.
The letters are tested so that various sentences using those letters are printed out and then manually
(more accurately, visually) checked if everything is arranged properly. Only sentences which contain all
26 lowercase letter of the English alphabet (\(a-z\)) are used for testing purposes. These sentences are
called test sentences.
You've probably already assumed that Ivica's job is to find test sentences. He has a dictionary which
consists of N words and has to calculate how many different test sentences can be made out of those
words. Every word from the dictionary can be used only once in the sentence and the order of the
words in the sentence is irrelevant (i.e. “uvijek jedem sarmu” and “jedem sarmu uvijek” are equal
sentences).

제약
입력 형식

The first line of input contains the integer N (\(1 \le N \le 25\)), the number of words in the dictionary.
Each of the following N lines contains a single word from the dictionary, its length not exceeding 100.
All the words from the dictionary are going to be unique.

출력 형식

The first and only line of output must contain the required number from the task.

예제 1
입력
9
the
quick
brown
fox
jumps
over
a
sleazy
dog
출력
2
예제 2
입력
3
a
b
c
출력
0
예제 3
입력
15
abcdefghijkl
bcdefghijklm
cdefghijklmn
defghijklmno
efghijklmnop
fghijklmnopq
ghijklmnopqr
hijklmnopqrs
ijklmnopqrst
jklmnopqrstu
klmnopqrstuv
lmnopqrstuvw
mnopqrstuvwx
nopqrstuvwxy
opqrstuvwxyz
출력
8189
설명

Clarification of the first example: All words but the word “a” must be used in the test sentence
because each word contains a letter that cannot be found in any other word. Therefore, there are two
possible solutions. The first one being the sentence which consists of all the words and the second one
being the sentence which consists of all the words apart from the word “a”.
Clarification of the third example: Given that the example is long, we stress that all the words from
the example consist of consecutive letters of the English alphabet.

문제 정보

생성자가 기록되지 않았습니다.

출처 COCI 2013/2014 Contest 6

평가 및 의견

Font

개요
출제자 난이도 Unrated 레이팅 미적용 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Font

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8