Intelligent Factorial Factorization LightOJ - 1035（水题）

就是暴力嘛。。。很水的一个题。。。

不好意思交都。。。

#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 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 maxn = , INF = 0x7fffffff;
int primes[maxn], base[maxn], mi[maxn];
int vis[maxn];
int ans = ;
set<int> s;
void init()
{
    mem(vis, );
    for(int i=; i<maxn; i++)
    {
        if(vis[i]) continue;
        primes[ans++] = i;
        for(LL j=(LL)i*i; j<maxn; j+=i)
            vis[j] = ;
    }
}

int main()
{
    init();
    int T, kase = ;
    scanf("%d",&T);
    while(T--)
    {
        s.clear();
        mem(base, );

        int n;
        scanf("%d",&n);
        for(int i=; i<=n; i++)
        {
            int temp = i;
            for(int j=; j<ans && primes[j] * primes[j] <= temp; j++)
            {
                while(temp % primes[j] == )
                {
                    temp /= primes[j];
                    base[primes[j]]++;
                }
                if(base[primes[j]] > )
                {
                    s.insert(primes[j]);
                }
            }
            if(temp > )
            {
                base[temp]++;
                s.insert(temp);
            }
        }
        printf("Case %d: %d = ",++kase, n);
        int cnt = ;
        for(set<int>::iterator it=s.begin(); it!=s.end(); it++)
        {
            if(cnt == )
                printf("%d (%d)",*it, base[*it]);
            else
                printf(" * %d (%d)",*it, base[*it]);
            cnt++;
        }
        printf("\n");

    }

    return ;
}