Information
- ID
- 1559
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 109
- Accepted
- 43
- Uploaded By
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n=2021041820210418;
vector<ll> v;
int main(){
for(ll i=1;i*i<=n;i++)
if(n%i==0){
v.push_back(i);
if(n/i!=i)v.push_back(n/i);
}
ll ans=0;
vector<ll>::iterator a,b,c;
for(a=v.begin();a!=v.end();a++)
for(b=v.begin();b!=v.end();b++)
for(c=v.begin();c!=v.end();c++)
if(((*a)*(*b)*(*c))==n)ans++;
cout<<ans;
return 0;
}
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.