《牛客直播课习题1》

#include<iostream>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<math.h>
#include<stack>
#include<map>
#include<limits.h>
#include<vector>
#include<string.h>
#include<string>
using namespace std;
typedef long long LL;
typedef pair<double,double> pii;
const int N = 5e5+5;
const int M = 1005;
const int Mod = 1e9+7;
#define pi acos(-1)
#define INF 1e8
#define INM INT_MIN
#define pb(a)  push_back(a)
#define mk(a,b) make_pair(a,b)
#define dbg(x) cout << "now this num is " << x << endl;
#define met0(axx) memset(axx,0,sizeof(axx));
#define metf(axx) memset(axx,-1,sizeof(axx));
#define sd(ax) scanf("%d",&ax)
#define sld(ax) scanf("%lld",&ax)
#define sldd(ax,bx) scanf("%lld %lld",&ax,&bx)
#define sdd(ax,bx) scanf("%d %d",&ax,&bx)
#define sddd(ax,bx,cx) scanf("%d %d %d",&ax,&bx,&cx)
#define sfd(ax) scanf("%lf",&ax)
#define sfdd(ax,bx) scanf("%lf %lf",&ax,&bx)
#define pr(a) printf("%d\n",a)
#define plr(a) printf("%lld\n",a)
int main()
{
    int t;sd(t);
    while(t--)
    {
        int n;sd(n);
        int m = sqrt(n),ans = 1;
        map<int,int> mp;
        mp[1]++;
        for(int i=2;i<=m;++i)
        {
            if(n == 1) break;
            if(n%i == 0 && mp[i] == 0)
            {
                mp[i]++;ans++;
                n /= i;
            }
        }
        if(mp[n] == 0) ans++;
        pr(ans);
    }
   // system("pause");
    return 0;
}