Codeforces-803F-Coprime Subsequences(筛)
来源:互联网 发布:快递数据统计员 编辑:程序博客网 时间:2024/06/06 16:25
题目链接:Codeforces-803F-Coprime Subsequences
定义
直接加起来肯定有重复的部分,所以从后往前筛
#include<bits/stdc++.h>using namespace std;typedef long long ll;const ll mod=1e9+7;const int maxn=1e5+7;ll p[maxn],f[maxn],ans;int a[maxn],c[maxn],n,m,t;int main(){ cin>>m; p[0]=1; for(int i=1;i<=m;i++) p[i]=p[i-1]*2%mod; for(int i=1;i<=m;i++) cin>>t,++a[t],n=max(n,t); for(int i=1;i<=n;i++) { int t=0; for(int j=i;j<=n;j+=i) t+=a[j]; f[i]=p[t]-1; } for(int i=n;i;i--) { for(int j=i*2;j<=n;j+=i) f[i]=(f[i]-f[j]+mod)%mod; ans=(ans+t)%mod; } cout << f[1] << endl; return 0;}
0 0
- Codeforces-803F-Coprime Subsequences(筛)
- codeforces 803F Coprime Subsequences (容斥原理)
- Codeforces 803F Coprime Subsequences DP+GCD
- Educational Codeforces Round 20 F. Coprime Subsequences(容斥)
- CF 803 F Coprime Subsequences (容斥原理)
- cf Educational Codeforces Round 20 F. Coprime Subsequences
- CF 803 F. Coprime Subsequences(数论题,莫比乌斯,容斥原理)
- Educational Codeforces Round 20 F. Coprime Subsequences(莫比乌斯反演)
- Codeforces803F Coprime Subsequences
- codeforces803F Coprime Subsequences -- 莫比乌斯函数+容斥
- CodeForces Sorting by Subsequences
- Codeforces 234F (dp)
- codeforces 731F (暴力)
- codeforces 732F (桥)
- Coprime Sequence(优化)
- Coprime
- Coprime
- Codeforces 689D Friends and Subsequences(二分+RMQ)
- Leetcode学习(5)—— Reshape the Matrix
- shell基础(六)
- Python 3基础教程9-函数
- 纯JQ实现全屏滚动【无插件】
- Android仿广播通信实现简单的应用间service与activity之间的数据通信
- Codeforces-803F-Coprime Subsequences(筛)
- Java合并多个byte[]为一个byte[]
- tensorflow框架学习(一)placeholder 与variable
- 【笔记】HMM模型论文阅读笔记(一)
- Model2
- 欢迎使用CSDN-markdown编辑器
- 一个不一样的ajax
- idea 2017破解码
- MapStruct 代替BeanUtil 和ModelMapper