printРабочее место участника

printЗадачи

1833. Pals

Ограничения: время – 3s/6s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод copy
Послать решение Blockly Посылки Темы Где Обсудить (0)

Mirko 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.
The first line of input contains the positive integer `N` (`1\ ≤\ N\ ≤\ 1\ 000\ 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.
The first and only line of output must contain the number of pairs that are pals.

Sample Input #1

3 
4 
20 
44 

Sample Output #1

1

Sample Input #2

4 
32 
51 
123 
282 

Sample Output #2

4
Source: COCI 2011/2012
loading