提出 #47176282

---

ソースコード 拡げる

// LUOGU_RID: 133092620
#include <bits/stdc++.h>
using namespace std; 
const int P = 1000000007; 

inline int poww(int a, int b) {
    int r = 1; 
    for (; b; b >>= 1, a = 1ll * a * a % P) if (b & 1) r = 1ll * r * a % P; 
    return r; 
}

int n, k, f[100005]; 
vector<int> d; 

int main(void) {
    cin >> n >> k; 
    for (int i = 1; i * i <= n; ++i) if (n % i == 0) {
        d.emplace_back(i); 
        if (i * i != n) d.emplace_back(n / i); 
    }
    sort(d.begin(), d.end()); 
    int ans = 0; 
    for (int i = 0; i < d.size(); ++i) {
        f[i] = poww(k, d[i] + 1 >> 1); 
        for (int j = 0; j < i; ++j) if (d[i] % d[j] == 0) f[i] = (f[i] - f[j]) % P; 
        ans = (ans + 1ll * f[i] * (d[i] % 2 ? d[i] : d[i] / 2)) % P; 
    }
    cout << (ans + P) % P << "\n"; 
    return 0; 
}

提出情報

コンパイルエラー

Main.cpp: In function ‘int main()’:
Main.cpp:23:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   23 |     for (int i = 0; i < d.size(); ++i) {
      |                     ~~^~~~~~~~~~
Main.cpp:24:29: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   24 |         f[i] = poww(k, d[i] + 1 >> 1);

ジャッジ結果