The Super Powers UVA - 11752 (素数分解）

We all know the Super Powers of this world and how they manage to get advantages in political warfare
or even in other sectors. But this is not a political platform and so we will talk about a different kind
of super powers — “The Super Power Numbers”. A positive number is said to be super power when it
is the power of at least two different positive integers. For example 64 is a super power as 64 = 82 and
64 = 43
. You have to write a program that lists all super powers within 1 and 264 − 1 (inclusive).
Input
This program has no input.
Output
Print all the Super Power Numbers within 1 and 264 − 1. Each line contains a single super power
number and the numbers are printed in ascending order.
Note: Remember that there are no input for this problem. The sample output is only a partial solution.
Sample Input
Sample Output
1
16
64
81
256
512
.
.
.

/*
    每个符合的结果的幂都不是素数
     所以枚举每个数的非素数幂，
     用对数来判断是否超过2^64 -1

*/ 
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
#include<set>
#include<algorithm>

#define maxn 100

using namespace std;
int vis[maxn];

void prime()
{
    vis[0] = 0;
    vis[1] = 0;
    for(int i=2;i<maxn;i++)
        if(vis[i] == 0)
            {
                for(int j=i+i;j<maxn;j+=i)
                    vis[j] = 1;
            }
}
set<unsigned long long> s;

int main()
{
    prime();

    s.clear();
    s.insert(1);
    for(int i = 2; i < 65536; i ++ )
    {
        double m = (64.0 * log(2) ) / log(i) - 1; // ln(x^k) < ln(2^64) - 1; ？？ 有点没有化明白，求解 
        unsigned long long tmp = i;

        for(int j=2; j <= ceil(m); j++)
        {
            tmp *= i;
            if(vis[j] == 0)  continue;
            s.insert(tmp);
        }
    }

    set<unsigned long long> :: iterator it;
    for(it=s.begin();it != s.end(); it ++)
        {
        //  system("pause");
            printf("%lu\n",*it);
        }
    return 0;
}