結果
問題 | No.1276 3枚のカード |
ユーザー |
![]() |
提出日時 | 2020-10-30 22:44:54 |
言語 | C++14 (gcc 11.2.0 + boost 1.78.0) |
結果 |
AC
|
実行時間 | 1,219 ms / 2,000 ms |
コード長 | 1,648 bytes |
コンパイル時間 | 1,394 ms |
使用メモリ | 10,560 KB |
最終ジャッジ日時 | 2023-02-21 15:10:05 |
合計ジャッジ時間 | 38,090 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,208 KB |
testcase_01 | AC | 2 ms
6,196 KB |
testcase_02 | AC | 1 ms
6,164 KB |
testcase_03 | AC | 1 ms
6,276 KB |
testcase_04 | AC | 1 ms
6,284 KB |
testcase_05 | AC | 2 ms
6,256 KB |
testcase_06 | AC | 1 ms
6,280 KB |
testcase_07 | AC | 1 ms
6,272 KB |
testcase_08 | AC | 1 ms
6,260 KB |
testcase_09 | AC | 1 ms
6,260 KB |
testcase_10 | AC | 1,027 ms
9,928 KB |
testcase_11 | AC | 484 ms
6,816 KB |
testcase_12 | AC | 615 ms
7,316 KB |
testcase_13 | AC | 643 ms
7,284 KB |
testcase_14 | AC | 57 ms
6,272 KB |
testcase_15 | AC | 518 ms
7,100 KB |
testcase_16 | AC | 1,120 ms
10,212 KB |
testcase_17 | AC | 601 ms
7,292 KB |
testcase_18 | AC | 455 ms
6,816 KB |
testcase_19 | AC | 741 ms
7,604 KB |
testcase_20 | AC | 429 ms
6,788 KB |
testcase_21 | AC | 448 ms
6,784 KB |
testcase_22 | AC | 1,138 ms
10,196 KB |
testcase_23 | AC | 49 ms
6,212 KB |
testcase_24 | AC | 700 ms
7,552 KB |
testcase_25 | AC | 232 ms
6,204 KB |
testcase_26 | AC | 870 ms
9,400 KB |
testcase_27 | AC | 996 ms
9,948 KB |
testcase_28 | AC | 961 ms
9,740 KB |
testcase_29 | AC | 548 ms
7,120 KB |
testcase_30 | AC | 104 ms
6,168 KB |
testcase_31 | AC | 46 ms
6,272 KB |
testcase_32 | AC | 250 ms
6,196 KB |
testcase_33 | AC | 16 ms
6,180 KB |
testcase_34 | AC | 172 ms
6,272 KB |
testcase_35 | AC | 161 ms
6,256 KB |
testcase_36 | AC | 10 ms
6,268 KB |
testcase_37 | AC | 149 ms
6,196 KB |
testcase_38 | AC | 99 ms
6,316 KB |
testcase_39 | AC | 261 ms
6,264 KB |
testcase_40 | AC | 1,088 ms
9,944 KB |
testcase_41 | AC | 899 ms
9,764 KB |
testcase_42 | AC | 976 ms
9,664 KB |
testcase_43 | AC | 847 ms
9,420 KB |
testcase_44 | AC | 1,205 ms
10,296 KB |
testcase_45 | AC | 1,093 ms
9,980 KB |
testcase_46 | AC | 1,092 ms
10,028 KB |
testcase_47 | AC | 896 ms
9,764 KB |
testcase_48 | AC | 864 ms
9,416 KB |
testcase_49 | AC | 977 ms
9,624 KB |
testcase_50 | AC | 1,080 ms
9,948 KB |
testcase_51 | AC | 930 ms
9,760 KB |
testcase_52 | AC | 793 ms
9,404 KB |
testcase_53 | AC | 936 ms
9,732 KB |
testcase_54 | AC | 1,077 ms
10,028 KB |
testcase_55 | AC | 829 ms
9,496 KB |
testcase_56 | AC | 803 ms
9,428 KB |
testcase_57 | AC | 1,029 ms
10,032 KB |
testcase_58 | AC | 1,075 ms
10,040 KB |
testcase_59 | AC | 944 ms
9,780 KB |
testcase_60 | AC | 1,219 ms
10,560 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; const long long MOD = 1000000007; vector<pair<long long, pair<long long, long long>>> quotient_ranges(long long N){ vector<pair<long long, pair<long long, long long>>> ans; for (long long i = 1; i * i <= N; i++){ ans.push_back(make_pair(N / i, make_pair(i, i))); } for (long long i = N / ((long long) sqrt(N) + 1); i >= 1; i--){ ans.push_back(make_pair(i, make_pair(N / (i + 1) + 1, N / i))); } return ans; } long long factor_count_sum(long long N){ //d(1)+d(2)+...+d(N) vector<pair<long long, pair<long long, long long>>> Q = quotient_ranges(N); int cnt = Q.size(); long long ans = 0; for (int i = 0; i < cnt; i++){ ans += Q[i].first * (Q[i].second.second - Q[i].second.first + 1) % MOD; ans %= MOD; } return ans; } int main(){ long long N; cin >> N; long long F = factor_count_sum(N); long long ans1 = (F - N % MOD + MOD) % MOD * (N - 2) % MOD; vector<pair<long long, pair<long long, long long>>> Q = quotient_ranges(N); int cnt = Q.size(); long long ans2 = 0; for (int i = 0; i < cnt; i++){ long long a = Q[i].first; long long b = Q[i].second.second - Q[i].second.first + 1; long long c = (a - 1) % MOD * (a - 2) % MOD * 500000004 % MOD; ans2 += b * c % MOD; ans2 %= MOD; } ans2 *= 2; ans2 %= MOD; long long ans3 = 0; for (int i = 0; i < cnt; i++){ long long a = Q[i].first; long long b = Q[i].second.second - Q[i].second.first + 1; long long G = factor_count_sum(a) - a * 2 % MOD + 1 + MOD; G %= MOD; ans3 += b * G % MOD; ans3 %= MOD; } cout << (ans1 - ans2 - ans3 + MOD * 2) % MOD << endl; }