#379169 (C++14) No.886 Direct

• 問題: No.886 Direct
• ユーザー: heno239
• 提出日時: 2019-09-13 22:50:01
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2,422 ms / 4,000 ms
• コード長: 1,952 bytes
• コンパイル時間: 993 ms
• コンパイル使用メモリ: 112,932 KB
• 実行使用メモリ: 245,376 KB
• 最終ジャッジ日時: 2024-07-04 10:12:11
• 合計ジャッジ時間: 84,940 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 32

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<ll> vec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-5;
const ld pi = acos(-1.0);
const int sz = 1 << 22;
bool isp[sz];
vector<int> ch[sz];
bool ign[sz];
void init() {
    fill(isp + 2, isp + sz, true);
    Rep(i,2, sz) {
        if (!isp[i])continue;
        ch[i].push_back(i);
        for (int j = 2 * i; j < sz; j += i) {
            isp[j] = false;
            ch[j].push_back(i);
            if ((j/i) % i == 0)ign[j] = true;
        }
    }
}
void solve() {
    ll h, w; cin >> h >> w;
    ll ans = 0;
    //片方0
    ans += (h - 1)*w + (w - 1)*h;
    ans %= mod;
    for (ll g = 1; g <= min(h - 1, w - 1); g++) {
        if (ign[g])continue;
        int th = (h - 1) / g;
        int tw = (w - 1) / g;
        ll lep = 0;
        ll rip = 0;
        rep1(i, th)lep += h - i * g;
        rep1(i, tw)rip += w - i * g;
        lep %= mod; rip %= mod;
        ll csum = 2 * lep*rip%mod;
        if (ch[g].size() % 2) {
            ans -= csum;
        }
        else {
            ans += csum;
        }
    }
    ans = (ans%mod + mod) % mod;
    cout << ans << endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(50);
    init();
    solve();
    //cout << "finish" << endl;
    //stop
        return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX