Chef and Secret Ingredients
All submissions for this problem are available.### Read problem statements in [Hindi](http://www.codechef.com/download/translated/FEB19TST/hindi/CHEFING.pdf), [Bengali](http://www.codechef.com/download/translated/FEB19TST/bengali/CHEFING.pdf), [Mandarin Chinese](http://www.codechef.com/download/translated/FEB19TST/mandarin/CHEFING.pdf), [Russian](http://www.codechef.com/download/translated/FEB19TST/russian/CHEFING.pdf), and [Vietnamese](http://www.codechef.com/download/translated/FEB19TST/vietnamese/CHEFING.pdf) as well. Chef recently visited ShareChat Cafe and was highly impressed by the food. Being a food enthusiast, he decided to enquire about the ingredients of each dish. There are $N$ dishes represented by strings $S_1, S_2, \ldots, S_N$. Each ingredient used for making dishes in ShareChat Cafe is represented by a lowercase English letter. For each valid $i$, the ingredients used to make dish $i$ correspond to characters in the string $S_i$ (note that ingredients may be used multiple times). A *special ingredient* is an ingredient which is present in each dish at least once. Chef wants to know the number of special ingredients in ShareChat Cafe. Since Chef is too busy with work, can you help him? ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integer $N$. - $N$ lines follow. For each $i$ ($1 \le i \le N$), the $i$-th of these lines contains a single string $S_i$. ### Output For each test case, print a single line containing one integer ― the number of special ingredients in the dishes. ### Constraints - $1 \le T \le 1,000$ - $1 \le N \le 1,000$ - $1 \le |S_i| \le 200$ for each valid $i$ - $S_1, S_2, \ldots, S_N$ contain only lowercase English letters - The sum of length of strings over all test cases $\le$ 3500000 ### Subtasks **Subtask #1 (100 points):** original constraints ### Example Input ``` 2 3 abcaa bcbd bgc 3 quick brown fox ``` ### Example Output ``` 2 0 ``` ### Explanation **Example case 1:** Ingredients 'b' and 'c' are present in all three dishes, so there are two special ingredients. **Example case 2:** No ingredient is common to all three dishes.
|Tags||adityad1998, data-structure, feb19, simple, string|
|Time Limit:||0.5 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.