Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.
You are given a positive integer n. Let's build a graph on vertices 1, 2, ..., n in such a way that there is an edge between vertices u and v if and only if . Let d(u, v) be the shortest distance between u and v, or 0 if there is no path between them. Compute the sum of values d(u, v) over all 1 ≤ u < v ≤ n.
The gcd (greatest common divisor) of two positive integers is the maximum positive integer that divides both of the integers.
Single integer n (1 ≤ n ≤ 107).
Print the sum of d(u, v) over all 1 ≤ u < v ≤ n.
All shortest paths in the first example:
There are no paths between other pairs of vertices.
The total distance is 2 + 1 + 1 + 2 + 1 + 1 = 8.
Codeforces (c) Copyright 2010-2020 Mike Mirzayanov