这题就是

LightOJ – 1236

解析去看这个把https://www.cnblogs.com/WTSRUVF/p/9185140.html

贴代码了；

#include <iostream>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#define MOD 2018
#define LL long long
#define ULL unsigned long long
#define maxn 10000900
#define Pair pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define _  ios_base::sync_with_stdio(0),cin.tie(0)
//freopen("1.txt", "r", stdin);
using namespace std;
const int LL_INF = 0x7fffffffffffffff,INF = 0x3f3f3f3f;
LL primes[maxn/];
bool vis[maxn];
LL ans = ;
void init()
{
    mem(vis,);
    for(int i=; i<maxn; i++)
        if(!vis[i])
        {
            primes[ans++] = i;
            for(LL j=(LL)i*i; j<maxn; j+=i)
                vis[j] = ;
        }
}int main()
{
    init();
    LL n;
    while(cin>> n && n)
    {
        LL res = , cnt = ;
        LL temp = n;
        for(LL i=; i<ans && primes[i] * primes[i] <= n; i++)
        {
            LL cnt2 = ;
            while(n % primes[i] == )
            {
                n /= primes[i];
                cnt2++;
            }
            if(cnt2 > )
            {
                res *= (*cnt2 + );
            }
        }
        if(n > )
        {
            res *= ;
        }
        printf("%lld %lld\n",temp,res/+);
    }
    return ;
}