div, C++ (gcc) - rextester

div

#include<bits/stdc++.h>
using namespace std;
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using namespace mp;*/
//cpp_int

#define mem(A) memset(A,0,sizeof(A))
#define loop(i,a,n) for(long long i=a;i<n;i++)
#define pb push_back
#define mkp make_pair
#define prq priority_queue
#define fir first
#define sec second
#define all(A) A.begin(),A.end()
#define mod 1000000007
#define take(t) ll t;cin>>t;while(t--)
#define en "\n"

typedef long long ll;
typedef pair<ll,ll> pll;

int main()
{   //freopen("input.txt", "r", stdin);
    ios_base::sync_with_stdio(0);
    freopen("output.txt","w",stdout);
    cin.tie(NULL);
    cout.tie(NULL);

ll p=40000;
    vector<ll> A[p],B(p);
    loop(i,1,p)
    {
        loop(j,1,sqrt(i)+1)
        {
            if(i%j==0)
            {
                A[i].pb(j);
                if(j*j!=i)
                 A[i].pb(i/j);
            }
        }
    }
    ll m=LONG_MIN;
    loop(i,1,p)
    {
        ll ma=-1;
        loop(j,0,A[i].size())
        {
            loop(k,0,A[i].size())
            {
                loop(l,0,A[i].size())
                {
                    loop(m,0,A[i].size())
                    {ll a=A[i][j],b=A[i][k],c=A[i][l],d=A[i][m];
                        if(A[i][j]+A[i][k]+A[i][l]+A[i][m]==i)
                            ma=max(ma,A[i][j]*A[i][k]*A[i][l]*A[i][m]);
                    }
                }
            }
        }
        B[i]=ma;
    }
    loop(i,0,p)
    cout<<i<<" "<<B[i]<<" "<<A[i].size()<<endl;
}


run \| edit \| history \| help	0