Yes i have .. and i have the worst time in the rank page :)
On Fri, Jan 29, 2010 at 8:51 PM, fundoonick fundoon...@yahoo.co.in wrote:
I tried this problem using the method of solving using eulerphi values.
I calculate values of eulerphi in O(nlogn) and then use them to calculate
gcdsum using
https://www.spoj.pl/problems/GCDEX/
#include cstdio
using namespace std;
const int N = 101;
bool sifted[N] = {};
int primes[8], nprimes = 0;
long long gcdsum[N];
int main()
{
int n;
gcdsum[0] = 0;
gcdsum[1] = 1;
for (int i = 2; i N; ++i)
{
