OO’s Sequence
Time Limit: 2000 ms
Memory Limit: 65536 KiB
Problem Description
OO has got a array A of size n ,defined a function f(l,r) represent the number of i (l<=i<=r) , that there\'s no j(l<=j<=r,j<>i) satisfy ai mod aj=0,now OO want to know
Input
There are multiple test cases. Please process till EOF.
In each test case:
First line: an integer n(n<=10^5) indicating the size of array
Second line:contain n numbers ai(0
In each test case:
First line: an integer n(n<=10^5) indicating the size of array
Second line:contain n numbers ai(0
Output
For each tests: ouput a line contain a number ans.
Sample Input
5 1 2 3 4 5
Sample Output
23
Hint
Source
2015 Multi-University Training Contest 1