KOMPICI - Kompići
After successfully solving his math homework from the previous task, Mirko has become bored, so he has made a list of N large integers. On the list there are some pairs of numbers that he likes, and some pairs he doesn’t like. Mirko has named the pairs that he likes pals. Two numbers are pals if they have at least one digit in common (not necessarily in the same position).
Help Mirko count how many pairs of numbers in his list are pals
Input
The first line of input contains the positive integer N (1 ≤ N ≤ 500 000).Each of the next N lines contains a positive integer from the range [1, 10^18], a number from Mirko’s list. No two numbers in the list will be equal.
Output
The first and only line of output must contain the number of pairs that are pals.
Example
Input: 3 4 20 44 Output: 1
hide comments
Erik Lonèarek:
2012-11-29 13:22:55
@me
|
|
Erik Lonèarek:
2012-11-05 17:58:26
What is the output for:
|
|
conioh:
2012-08-15 09:14:38
nice question.. Last edit: 2012-08-26 06:50:25 |
|
MR. BEAN :
2012-07-30 13:51:56
very nice question :) |
|
Aman Kumar:
2011-11-27 16:16:53
yes how to solve this? can anyone provide some hint.... |
|
skmiiita:
2011-11-26 19:38:38
how can i approach this problem??
|
|
Tadek Dul:
2011-11-25 09:56:36
I rejudged submissions yesterday - it's my first problem added to spoj, and I'm still learning the system. Sorry for this. |
|
Aman Kumar:
2011-11-25 03:01:01
got ac yesterday ... shows TLE today !? WTH..!
|
Added by: | Tadek Dul |
Date: | 2011-11-23 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | C C++ 4.3.2 CPP HASK JAVA PAS-FPC PYTHON |
Resource: | COCI 2011/2012 2nd round |