Language: C++

//file_name:ABC110_B.cpp
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;


    // 整数スキャン（複数）
    /*
    int x;
    scanf("%d",&x);
    int y;
    scanf("%d",&y);
    int z;
    scanf("%d",&y);

    // n個の整数のスキャン
    /*
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    */

    // 文字列スキャン
    /*
    string s;
    cin >> s;
    */

void comb(vector<vector <long long int> > &v){
    for(int i = 0;i <v.size(); i++){
        v[i][0]=1;
        v[i][i]=1;
    }
    int vsize = v.size();
    for(int k = 1;k <vsize;k++){
        for(int j = 1;j<min(k,60);j++){
            v[k][j]=(v[k-1][j-1]+v[k-1][j]);
        }
    }
}

int main() {
    ll md = 1000000007;
    const ll mod = (ll)1e9 + 7;
    ll n;
    scanf("%lld",&n);
    ll m;
    scanf("%lld",&m);
    if(m==1){
        cout << m << endl;
        return 0;
    }

    ll soinsuu[100][2];
    rep(i,100){
        rep(j,2){
            soinsuu[i][j]=0;
        }
    }
    ll count = 2;
    ll flag = 0;
    ll now = 0;
    while(count<500000&&m>1){
        if(m%count==0){
            soinsuu[now][0] = count;
            soinsuu[now][1]++;
            flag++;
            m /= count;
        }else{
            if(flag!=0){
                now++;
                flag=0;
                count++;
            }else{
                count++;
            }
        }
    }
    if(soinsuu[0][0]==0||n==1){
        cout << n << endl;
        return 0;
    }
    if(count>400000&&!=1){
        soinsuu[now][0] = m;
        soinsuu[now][1]++;
    }

    count = 0;
    ll ans = 1;
    ll anss[100];
    while(soinsuu[count][0]!=0){
        int N = n-1 + soinsuu[count][1];
        int K = soinsuu[count][1];
        //vector<vector<long long int> > V(N+1,vector<long long int>(N+1,0));
        //comb(V);
        //ans *= V[N][K];
        ll kk[K];
        rep(i,K){
            kk[i]=N-i;
        }
        rep(i,K){
            rep(j,K){
                if(kk[j]%(i+1)==0){
                    kk[j]/=(i+1);
                    break;
                }
            }
        }
        rep(i,K){
            ans *= kk[i];
            ans %= mod;
        }
        


        count++;
    }
    //ans = ans % mod;
    cout << ans << endl;
    return 0;
}



Compiler output:
a.cc: In function 'int main()':
a.cc:133:22: error: expected primary-expression before '!=' token
  133 |     if(count>400000&&!=1){
      |                      ^~