Problem:
Score: 400 points

Problem Statement

AtCoder Inc. has decided to lock the door of its office with a 3-digit PIN code.

The company has an N-digit lucky number, S. Takahashi, the president, will erase N-3 digits from S and concatenate the remaining 3 digits without changing the order to set the PIN code.

How many different PIN codes can he set this way?

Both the lucky number and the PIN code may begin with a 0.

Constraints

4 \leq N \leq 30000

S is a string of length N consisting of digits.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the number of different PIN codes Takahashi can set.

Sample Input 1

4
0224

Sample Output 1

3

Takahashi has the following options:

Erase the first digit of S and set 224.

Erase the second digit of S and set 024.

Erase the third digit of S and set 024.

Erase the fourth digit of S and set 022.

Thus, he can set three different PIN codes: 022, 024, and 224.

Sample Input 2

6
123123

Sample Output 2

17

Sample Input 3

19
3141592653589793238

Sample Output 3

329

Solution in Rust (1.15.1) (judge verdict: Accepted)

fn main() {
	let mut s = String::new();
	use std::io::Read;
	std::io::stdin().read_to_string(&mut s).unwrap();
	let mut s = s.split_whitespace();
	s.next().unwrap();
	let s = s.next().unwrap();
	let mut appear = vec![vec![]; 10];
	for (i, c) in s.bytes().enumerate() {
		let d = c - b'0';
		appear[d as usize].push(i);
	}
	let mut ans = 0;
	for a in 0..10 {
		if let Some(ai) = appear[a].first() {
			for c in 0..10 {
				if let Some(ci) = appear[c].last() {
					for b in 0..10 {
						let i = appear[b].upper_bound(&ai);
						let j = appear[b].lower_bound(&ci);
						if j > i {
							ans += 1;
						}
					}
				}
			}
		}
	}
	println!("{}", ans);
}

pub trait BinarySearch<'a, T: 'a> {
	fn lower_bound(&self, x: &T) -> usize;
	fn upper_bound(&self, x: &T) -> usize;
}

impl<'a, T: 'a + Ord> BinarySearch<'a, T> for [T] {
	fn lower_bound(&self, x: &T) -> usize {
		let mut first = 0;
		let mut len = self.len() - first;
		while len > 0 {
			let half = len >> 1;
			let mid = first + half;
			use std::cmp::Ordering;
			match self[mid].cmp(x) {
				Ordering::Less => {
					first = mid + 1;
					len = len - half - 1;
				}
				Ordering::Equal | Ordering::Greater => {
					len = half;
				}
			}
		}
		first
	}

	fn upper_bound(&self, x: &T) -> usize {
		let mut first = 0;
		let mut len = self.len() - first;
		while len > 0 {
			let half = len >> 1;
			let mid = first + half;
			use std::cmp::Ordering;
			match x.cmp(&self[mid]) {
				Ordering::Less => {
					len = half;
				}
				Ordering::Equal | Ordering::Greater => {
					first = mid + 1;
					len = len - half - 1;
				}
			}
		}
		first
	}
}