1238 最小公倍数之和 V3

三种做法!!!

学习笔记,这里只贴代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
const int N = 4641590, U = 4641588, mo = 1e9+7, inv2 = 500000004, inv6 = 166666668;
inline ll read(){
char c=getchar(); ll x=0,f=1;
while(c<'0' || c>'9') {if(c=='-')f=-1; c=getchar();}
while(c>='0' && c<='9') {x=x*10+c-'0'; c=getchar();}
return x*f;
} bool notp[N]; int p[N/10]; ll phi[N], sum[N];
inline void mod(ll &x) {if(x>=mo) x-=mo; else if(x<0) x+=mo;}
void sieve(int n) {
phi[1]=1;
for(int i=2; i<=n; i++) {
if(!notp[i]) p[++p[0]] = i, phi[i] = i-1;
for(int j=1; j <= p[0] && i*p[j] <= n; j++) {
int t = i*p[j];
notp[t] = 1;
if(i%p[j] == 0) {phi[t] = phi[i] * p[j]; break;}
phi[t] = phi[i] * (p[j]-1);
}
phi[i] = phi[i] * i %mo * i %mo;
}
for(int i=1; i<=n; i++) mod(sum[i] += sum[i-1] + phi[i]);
} namespace ha {
const int p = 1001001;
struct meow{int ne; ll val, r;} e[3000];
int cnt, h[p];
inline void insert(ll x, ll val) {
int u = x%p;
for(int i=h[u];i;i=e[i].ne) if(e[i].r == x) return;
e[++cnt] = (meow){h[u], val, x}; h[u] = cnt;
}
inline ll quer(ll x) {
int u = x%p;
for(int i=h[u];i;i=e[i].ne) if(e[i].r == x) return e[i].val;
return -1;
}
} using ha::insert; using ha::quer; inline ll cal1(ll n) {return n %mo * ((n+1) %mo) %mo * inv2 %mo;}
inline ll cal2(ll n) {return n %mo * ((n+1) %mo) %mo * ((2*n+1) %mo) %mo * inv6 %mo;}
inline ll cal2(ll l, ll r) {ll t = cal2(r) - cal2(l-1); return t<0 ? t+mo : t;}
inline ll cal3(ll n) {ll t = cal1(n); return t * t %mo;} ll dj_s(ll n) {
if(n <= U) return sum[n];
if(n > U && quer(n) != -1) return quer(n);
ll ans = cal3(n), r;
for(ll i=2; i<=n; i=r+1) {
r = n/(n/i);
mod(ans -= dj_s(n/i) * cal2(i, r) %mo);
}
insert(n, ans);
return ans;
}
ll n;
ll solve(ll n) {
ll ans=0, r;
for(ll i=1; i<=n; i=r+1) {
r = n/(n/i); //printf("hi %lld %lld\n", n/i, dj_s(n/i));
mod(ans += dj_s(n/i) * (cal1(r) - cal1(i-1)) %mo);
}
return ans;
}
int main() {
// freopen("in", "r", stdin);
sieve(U);
n=read();
printf("%lld", solve(n));
}
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
const int N = 4641590, U = 4641588, mo = 1e9+7, inv2 = 500000004, inv6 = 166666668;
inline ll read(){
char c=getchar(); ll x=0,f=1;
while(c<'0' || c>'9') {if(c=='-')f=-1; c=getchar();}
while(c>='0' && c<='9') {x=x*10+c-'0'; c=getchar();}
return x*f;
} inline void mod(ll &x) {if(x>=mo) x-=mo; else if(x<0) x+=mo;}
ll s[N], lp[N];
bool notp[N]; int p[N/10];
void sieve(int n) {
s[1] = 1;
for(int i=2; i<=n; i++) {
if(!notp[i]) {
p[++p[0]] = i;
ll now = 1, i2 = (ll) i*i %mo;
for(ll j=i; j<=n; j*=i)
now = now * i2 %mo -i+1, mod(now), s[j] = now, lp[j] = j;
}
for(int j=1; j <= p[0] && i*p[j] <= n; j++) {
ll t = i*p[j];
notp[t] = 1;
if(i%p[j] == 0) {
if(lp[t] != t) {
lp[t] = lp[i] * p[j];
s[t] = s[t / lp[t]] * s[lp[t]] %mo;
}
break;
}
lp[t] = p[j];
s[t] = s[i] * s[p[j]] %mo;
}
}
for(int i=1; i<=n; i++) s[i] = s[i] * i %mo + s[i-1], mod(s[i]);
}
namespace ha {
const int p = 1001001;
struct meow{int ne; ll val, r;} e[3000];
int cnt, h[p];
inline void insert(ll x, ll val) {
int u = x%p;
for(int i=h[u];i;i=e[i].ne) if(e[i].r == x) return;
e[++cnt] = (meow){h[u], val, x}; h[u] = cnt;
}
inline ll quer(ll x) {
int u = x%p;
for(int i=h[u];i;i=e[i].ne) if(e[i].r == x) return e[i].val;
return -1;
}
} using ha::insert; using ha::quer; inline ll sum1(ll n) {return n %mo * ((n+1) %mo) %mo * inv2 %mo;}
inline ll sum2(ll n) {return n %mo * ((n+1) %mo) %mo * ((2*n+1) %mo) %mo * inv6 %mo;}
inline ll sum3(ll n) {ll t = sum1(n); return t * t %mo;} inline ll cal(ll n) {
ll ans=0, r;
for(ll i=1; i<=n; i=r+1) {
r = n/(n/i);
mod(ans += (sum3(r) - sum3(i-1)) * sum1(n/i) %mo);
}
return ans;
}
ll dj_s(ll n) {
if(n <= U) return s[n];
if(n > U && quer(n) != -1) return quer(n);
ll ans = cal(n), r;
for(ll i=2; i<=n; i=r+1) {
r = n/(n/i);
mod(ans -= dj_s(n/i) * ((sum2(r) - sum2(i-1)) %mo) %mo);
}
insert(n, ans);
return ans;
}
ll n;
int main() {
//freopen("in", "r", stdin);
sieve(U);
n=read();
printf("%lld", dj_s(n));
}
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
const int N = 4641590, U = 4641588, mo = 1e9+7, inv2 = 500000004, inv6 = 166666668;
inline ll read(){
char c=getchar(); ll x=0,f=1;
while(c<'0' || c>'9') {if(c=='-')f=-1; c=getchar();}
while(c>='0' && c<='9') {x=x*10+c-'0'; c=getchar();}
return x*f;
} inline void mod(ll &x) {if(x>=mo) x-=mo; else if(x<0) x+=mo;}
bool notp[N]; int p[N/10]; ll s[N];
void sieve(int n) {
s[1] = 1;
for(int i=2; i<=n; i++) {
if(!notp[i]) p[++p[0]] = i, s[i] = 1-i;
for(int j=1; j <= p[0] && i*p[j] <= n; j++) {
notp[i*p[j]] = 1;
if(i%p[j] == 0) {s[i*p[j]] = s[i]; break;}
s[i*p[j]] = s[i] * (1 - p[j]) %mo;
}
s[i] = (s[i-1] + i * s[i] %mo) %mo;
}
} namespace ha {
const int p = 1001001;
struct meow{int ne; ll val, r;} e[3000];
int cnt, h[p];
inline void insert(ll x, ll val) {
int u = x%p;
for(int i=h[u];i;i=e[i].ne) if(e[i].r == x) return;
e[++cnt] = (meow){h[u], val, x}; h[u] = cnt;
}
inline ll quer(ll x) {
int u = x%p;
for(int i=h[u];i;i=e[i].ne) if(e[i].r == x) return e[i].val;
return -1;
}
} using ha::insert; using ha::quer; inline ll sum1(ll n) {n %= mo; return n * (n+1) %mo * inv2 %mo;}
inline ll sum2(ll n) {n %= mo; return n * (n+1) %mo * (2*n+1) %mo * inv6 %mo;} ll dj_s(ll n) {
if(n <= U) return s[n];
if(quer(n) != -1) return quer(n);
ll ans = sum1(n), r, now, last=sum2(1);
for(ll i=2; i<=n; i=r+1, last = now) {
r = n/(n/i); now = sum2(r);
mod(ans -= dj_s(n/i) * (now - last) %mo);
}
insert(n, ans);
return ans;
} int solve(ll n) {
ll ans=0, r, now, last=0;
for(ll i=1; i<=n; i=r+1, last = now) {
r = n/(n/i); now = dj_s(r); ll t = sum1(n/i);
mod(ans += (now - last) * t %mo * t %mo);
}
return ans;
}
ll n;
int main() {
// freopen("in", "r", stdin);
sieve(U);
n=read();
printf("%d", solve(n));
}

51NOD 1238 最小公倍数之和 V3 [杜教筛]的更多相关文章

  1. 【51nod】1238 最小公倍数之和 V3 杜教筛

    [题意]给定n,求Σi=1~nΣj=1~n lcm(i,j),n<=10^10. [算法]杜教筛 [题解]就因为写了这个非常规写法,我折腾了3天…… $$ans=\sum_{i=1}^{n}\s ...

  2. [51Nod 1238] 最小公倍数之和 (恶心杜教筛)

    题目描述 求∑i=1N∑j=1Nlcm(i,j)\sum_{i=1}^N\sum_{j=1}^Nlcm(i,j)i=1∑N​j=1∑N​lcm(i,j) 2<=N<=10102<=N ...

  3. 51 Nod 1238 最小公倍数之和 V3 杜教筛

    题目链接:http://www.51nod.com/Challenge/Problem.html#!#problemId=1238 题意:求$\sum_{i=1}^{n}\sum_{j=1}^{n}l ...

  4. [51Nod1238]最小公倍数之和 V3[杜教筛]

    题意 给定 \(n\) ,求 \(\sum_{i=1}^n \sum_{j=1}^n lcm(i,j)\). \(n\leq 10^{10}\) 分析 推式子 \[\begin{aligned} an ...

  5. 51nod 1238 最小公倍数之和 V3

    51nod 1238 最小公倍数之和 V3 求 \[ \sum_{i=1}^N\sum_{j=1}^N lcm(i,j) \] \(N\leq 10^{10}\) 先按照套路推一波反演的式子: \[ ...

  6. 51nod 1238 最小公倍数之和 V3 【欧拉函数+杜教筛】

    首先题目中给出的代码打错了,少了个等于号,应该是 G=0; for(i=1;i<=N;i++) for(j=1;j<=N;j++) { G = (G + lcm(i,j)) % 10000 ...

  7. 51Nod 1238 - 最小公倍数之和 V3(毒瘤数学+杜教筛)

    题目 戳这里 推导 ∑i=1n∑j=1nlcm(i,j)~~~\sum_{i=1}^{n}\sum_{j=1}^{n}lcm(i,j)   ∑i=1n​∑j=1n​lcm(i,j) =∑i=1n∑j= ...

  8. 51NOD 1237 最大公约数之和 V3 [杜教筛]

    1237 最大公约数之和 V3 题意:求\(\sum_{i=1}^n\sum_{j=1}^n(i,j)\) 令\(A(n)=\sum_{i=1}^n(n,i) = \sum_{d\mid n}d \c ...

  9. 51nod 237 最大公约数之和 V3 杜教筛

    Code: #include <bits/stdc++.h> #include <tr1/unordered_map> #define setIO(s) freopen(s&q ...

随机推荐

  1. c++extern关键字详解

    1 基本解释 :extern可以置于变量或者函数 前,以标示变量或者函数的定义在别的文件中 ,提示编译器遇到此变量和函数时在其他模块中寻找其定义 .此外extern也可用来进行链接指定. 也就是说ex ...

  2. TI-RTOS 之 GPIO中断(按键)

    TI-RTOS 之 GPIO中断(按键) 前面已经用过LED, 定时器,这次来了解GPIO的中断是怎么用的,从CC1310+TI-RTOS的例程可以直接找到相应的例子程序,它的关键是在于要使能中断,也 ...

  3. Java-String.intern的深入研究

    When---什么时候需要了解String的intern方法: 面试的时候(蜜汁尴尬)!虽然不想承认,不过面试的时候经常碰到这种高逼格的问题来考察我们是否真正理解了String的不可变性.String ...

  4. Apache日志分析_shell命令行

    说明: 1.我的日志预先设定好按日生成文件:"CustomLog "|/opt/apache/bin/rotatelogs /opt/apache/logs/www.website ...

  5. 数据结构与算法(c++)——双缓存队列

    "双缓存队列"是我在一次开发任务中针对特殊场景设计出来的结构.使用场景为:发送端持续向接收端发送数据包--并且不理会接收端是否完成业务逻辑.由于接收端在任何情况下停止响应即可能产生 ...

  6. MySql Outer Join 简单化

    查询from语句中的Outer Join可以在多种情况下被简化: 在解析阶段,右外连接操作可以被转变为等下ode值包含left join的操作,在一般情况下,转变: (T1, ...) RIGHT J ...

  7. 高质量JAVA代码编写规范

    1. Java 命名约定 除了以下几个特例之外,命名时应始终采用完整的英文描述符.此外,一般应采用小写字母,但类名.接口名以及任何非初始单词的第一个字母要大写. 1.1 一般概念 * 尽量使用完整的英 ...

  8. 洛谷 P1099 树网的核

    P1099 树网的核 题目描述 设T=(V, E, W) 是一个无圈且连通的无向图(也称为无根树),每条边到有正整数的权,我们称T为树网(treebetwork),其中V,E分别表示结点与边的集合,W ...

  9. excel生成sql语句

    很多时候,我们想把excel中数据导入到数据库中. 方法有很多种,比如直接拷贝然后黏贴进编辑状态的框中,这种情况有个弊端,就是excel中每列的数据必须和数据库中一一对应,这个很难,基本上不太可能,数 ...

  10. Windows挂钩注入DLL

    注入DLL实现源码:HINSTANCE g_hInstDll = NULL; HHOOK g_hHook = NULL; DWORD g_dwThreadId = 0; #ifdef _MANAGED ...