HDU 5514 Frogs(容斥)
来源:互联网 发布:dota 知乎 编辑:程序博客网 时间:2024/05/21 06:47
代码:
#include <map>#include <set>#include <stack>#include <queue>#include <cmath>#include <string>#include <vector>#include <cstdio>#include <cctype>#include <cstring>#include <sstream>#include <cstdlib>#include <iostream>#include <algorithm>#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;#define MAX 10005#define MAXN 1000005#define maxnode 205#define sigma_size 2#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define lrt rt<<1#define rrt rt<<1|1#define middle int m=(r+l)>>1#define LL long long#define ull unsigned long long#define mem(x,v) memset(x,v,sizeof(x))#define lowbit(x) (x&-x)#define pii pair<int,LL>#define bits(a) __builtin_popcount(a)#define mk make_pair#define limit 10000//const int prime = 999983;const int INF = 0x3f3f3f3f;const LL INFF = 0x3f3f;//const double pi = acos(-1.0);const double inf = 1e18;const double eps = 1e-9;const LL mod = 1e8+9;const ull mx = 133333331;/*****************************************************/inline void RI(int &x) { char c; while((c=getchar())<'0' || c>'9'); x=c-'0'; while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0'; }/*****************************************************/int a[MAX];int yin[MAX];int vis[MAX];int num[MAX];int gcd(int a,int b){ if(!b) return a; return gcd(b,a%b);}int main(){ int t,kase=0; cin>>t; while(t--){ int n,m; cin>>n>>m; for(int i=0;i<n;i++) scanf("%d",&a[i]); int tot=0; mem(vis,0); mem(num,0); for(int i=1;i<=sqrt(m);i++){ if(m%i==0){ yin[tot++]=i; if(m/i!=i) yin[tot++]=m/i; } } sort(yin,yin+tot); for(int i=0;i<n;i++){ int k=gcd(a[i],m); for(int j=0;j<tot;j++){ if(yin[j]%k==0) vis[j]=1; } } vis[tot-1]=0; LL ans=0; for(int i=0;i<tot;i++){ if(vis[i]!=num[i]){ int x=(m-1)/yin[i]; ans+=(LL)x*(x+1)/2*yin[i]*(vis[i]-num[i]); int y=vis[i]-num[i]; for(int j=i+1;j<tot;j++){ if(yin[j]%yin[i]==0) num[j]+=y; } } } kase++; printf("Case #%d: ",kase); cout<<ans<<endl; } return 0;}
0 0
- HDU 5514 Frogs (容斥定理)
- HDU 5514 Frogs(容斥)
- HDU 5514 Frogs(容斥)
- HDU 5514 (Frogs) (容斥原理)
- HDU 5514 Frogs(容斥问题)
- hdu 5514 Frogs 容斥
- HDU Frogs 5514 容斥
- HDU 5514 Frogs 容斥
- HDU 5514 Frogs(巧妙地容斥)
- HDU 5514 Frogs(容斥原理 gcd)
- HDU 5514 Frogs (容斥原理)(第一篇博客~)
- hdu 5514 -Frogs (容斥原理 )
- HDU 5514 Frogs 容斥原理
- HDU 5514 Frogs (容斥+数论)
- HDU 5514 Frogs 【容斥原理】
- HDU 5514 Frogs (2015沈阳F题&&容斥+剪枝)
- hdu5514 Frogs(容斥)
- HDU 5514 Frogs ACM/ICPC 2015 Shenyang(容斥原理)
- JSON和js对象转换
- Servlet 工作原理解析
- Spring @Autowired注解与自动装配
- LINUX 驱动学习之路 -设备模型之别人的理解(3)
- 【NAS】NFS客户端阻塞睡眠问题与配置调研
- HDU 5514 Frogs(容斥)
- HTML5 WebSocket和后端C#通信
- UNIT TEST
- Mysql索引会失效的几种情况分析
- 原型链机制简述
- Retrofit 使用 一
- Glide加载图片并保存到本地相册
- DUNS及苹果开发者账号申请
- 策略模式(Strategy)