2018 German Collegiate Programming Contest (GCPC 18) H - Hyper Illuminati

题目链接：https://codeforces.com/gym/102021/attachments

题意：给出一个$m$，你需要找到两个数$n$，$s$，满足${\sum }_{i=1}^s{i}^{n-1}==m$。

解题心得：仔细观察枚举的数字不可能很大，直接暴力就可以了

---

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const int maxn = 1e6 + 6;

ll n;

ll q_pow(ll x, ll y) {
    ll ans = 1;
    for(int i=1;i<=y;i++) {
        ans *= x;
    }
    return ans;
}

int main()
{
    scanf("%lld", &n);
    for(ll i=2;i<=60;i++) {
        ll sum = 0;
        for(ll j=1;;j++) {
            sum += q_pow(j, i);
            if(sum == n) {
                printf("%lld %lld\n", i+1, j);
                return 0;
            }
            if(sum > n) break;
        }
    }
    printf("impossible\n");
    return 0;
}