货物摆放(数学-约数)

货物摆放 - 蓝桥云课 (lanqiao.cn)

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#define x first
#define y second
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<LL,LL> PLL;
//typedef __int128 i128;
typedef unsigned long long ULL;
const int N= 20000 +  10,M = 55 ;
const int INF = 0x3f3f3f3f ,mod = 1e9 + 7 ,P = 131;
const double eps = 1e-7;

LL n = 2021041820210418;
LL cnt,p[N];


void solve()
{
    for(LL i =1;i <= n/i;i ++ )
    {
        if(n % i == 0)
        {
            p[cnt ++ ] = i;
            if(n/i != i )
            {
                p[cnt ++ ] = n/i;
            }
        }
    }
    LL res=0;
    for(LL i=0;i<cnt ;i++ )
    for(LL j=0;j<cnt;j ++ )
    for(LL k= 0;k< cnt ;k ++ )
    {
        res += (p[i] * p[j] * p[k] == n );
    }
    
    cout << res <<endl;
    
        
}

signed main()
{
//    freopen("1.txt","r",stdin);
    
    
    int T=1;
//    cin>>T;
    int now = 1;
    while(T -- )
    {
//        cout<<"Case "; 
//        cout<< now ++ <<": ";
        solve();
    }


    return 0;
}