题解分享
题解分享简介
立方变自身(结果填空) - 题解
```cpp
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define LL long long
#define endl '\n'
bool check(int n)
{
int tmp = n;
vector<int> v;
while (tmp > 0)
{
v.push_back(tmp % 10);
tmp /= 10;
}
double sum = 0;
for (int j = 0; j < v.size(); j++) sum += v[j];
if (sum == (n / sum / sum / 1.0)) return true;
else return false;
}
void solve()
{
int cnt = 0;
for (int i = 1; i <= 10000; i++)
{
int x = pow(i, 3);
if (check(x)) cnt++;
}
cout << cnt << endl;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
solve();
return 0;
}
```
查看全文
2
0
0
3
