[Poj2478]Farey Sequence

Farey Sequence

Time Limit: 1000MS Memory Limit: 65536K

Description

The Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 < a < b <= n and gcd(a,b) = 1 arranged in increasing order. The first few are
F2 = {1/2}
F3 = {1/3, 1/2, 2/3}
F4 = {1/4, 1/3, 1/2, 2/3, 3/4}
F5 = {1/5, 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5}

You task is to calculate the number of terms in the Farey sequence Fn.

Input

There are several test cases. Each test case has only one line, which contains a positive integer n (2 <= n <= 106). There are no blank lines between cases. A line with a single 0 terminates the input.

Output

For each test case, you should output one line, which contains N(n) —- the number of terms in the Farey sequence Fn.

Sample Input

2
3
4
5
0

Sample Output

1
3
5
9

Source

POJ Contest,Author:Mathematica@ZSU

题目大意

给定一个数n，求小于或等于n的数中两两互质组成的真分数的个数。

题解

ans[i]=ans[i-1]+phi[i]

const
 maxn=1000000;
var
 check:array[0..maxn]of boolean;
 x,phi,prime:array[0..maxn]of longint;
 sum:array[0..maxn]of int64;
 t,a,n,i,j,ans,len,max:longint;
begin
 readln(a);
 x[0]:=0; max:=0; n:=0;
 while a<>0 do
  begin inc(x[0]); x[x[0]]:=a; inc(max);if n<a then n:=a; readln(a); end;
 len:=0; phi[1]:=1;
 for i:=1 to n do
  check[i]:=false;
 for i:=2 to n do
  begin
   if check[i]=false
   then begin inc(len); phi[i]:=i-1; prime[len]:=i; end;
   for j:=1 to len do
    begin
     if prime[j]*i>n
     then break;
     check[i*prime[j]]:=true;
     if i mod prime[j]=0
     then begin phi[i*prime[j]]:=phi[i]*prime[j]; break; end
     else begin phi[i*prime[j]]:=phi[i]*(prime[j]-1); end;
    end;
  end;
 sum[1]:=0;
 for i:=2 to n do
  sum[i]:=sum[i-1]+phi[i];
 for i:=1 to max do
  writeln(sum[x[i]]);
end.