제출 #19010

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
19010	2016-02-17 02:58:23	kriii	팔찌 (kriii4_V)	C++14	100 / 100	121 ms	32332 KiB

V

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
#include <stdio.h>
const long long mod = 1000000007;
const long long inv2 = 500000004;
long long inv[1000001],kpow[1000001],phi[1000001],syn[1000001];
int main()
{
  int N,K;
  scanf ("%d %d",&N,&K);
  
  inv[1] = 1;
  for (int i=2;i<=N;i++) inv[i] = (mod - mod / i) * inv[mod % i] % mod;
  kpow[0] = 1;
  for (int i=1;i<=N;i++) kpow[i] = kpow[i-1] * K % mod;
  for (int i=1;i<=N;i++){
    phi[i] += i;
    for (int j=i*2;j<=N;j+=i) phi[j] -= phi[i];
  }
  for (int i=1;i<=N;i++){
    syn[i] = (syn[i-1] + kpow[i] * inv[i]) % mod;
  }
  long long ans = 2;
  for (int i=1;i<=N;i++){
    ans = (ans + phi[i] * syn[N/i] % mod * inv[i] % mod) % mod;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 6 / 6
• Subtask 2: 94 / 94