Would you solve through Python ?

Question

The IPL is about to commence ,and there are several coupons being sold ,and each coupon is identified with a coupon id.in one of the many winning scenarios in the ipl,a winning pair of coupon is:

Concatenation of The two coupon IDs in the pair ,in any order, contains each digit from 0 to 9 at least once

Note The coupon IDs can be concantenated in any order .Digits in the coupon ID can occur in any order.

Your task is to find the number of winning pairs of distinct coupons ,such that concatenation of their coupon IDs (in any order ) makes for a winning scenario)

Input Format

The first line contain N denoting the total number of coupon in the Super bowl .Each of the next N lines Contains a String , where I'ts string on a line denotes the coupon id of The i'th coupon..

Constraints
1<=N<10^6
1<=length of ticket <=10^6
Sun of length of all ticket <=10^6
Each ticket id conists of digit [0,9]

Output Format

Print the no of pairs in a new line

Sample input
5129300455
5559948277
012334556
56789
12345687

Answer 1

All problems of these types can be solved by most languages.

Answer 2

Yes, it can be solved through Python.