Send a Table

http://www.bnuoj.com/bnuoj/contest_show.php?cid=2322#problem/25807

// File Name: bo_jwolf10.cpp
// Author: rudolf
// Created Time: 2013年08月29日 星期四 17:29:58

#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>

using namespace std;
const int maxn = 100005 ;
int phi[ maxn ] ;
int sum[ maxn ] ;
void init()
{
	memset( phi , 0 , sizeof( phi ) ) ;
	phi[ 0 ] = phi[ 1 ] = 1 ;
	for( int i = 2 ; i < maxn ; ++i )
	{
		if( !phi[ i ] )
		{
			for( int j = i ; j < maxn ; j += i )
			{
				if( !phi[ j ] )
				{
					phi[ j ] = j ;
				}
					phi[ j ] = phi[ j ] / i * ( i - 1 ) ;
			}
		}
	}
	sum[ 1 ] = 1 ; 
	for( int i = 2 ; i < maxn ; ++i )
	{
		sum[ i ] = sum[ i - 1 ] + phi[ i ] ;
	}
}

int main()
{
	int n ;
	init() ;
	while( cin >> n , n )
	{
		cout << sum[ n ] * 2 - 1 << endl ;
	}
return 0;
}