aigoruan

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4407思路：问题转化：给定n,p,求n内和p互质的数的和。剩下的暴力。关键代码是队友写的：View Code #include<stdio.h>#include<string.h>#include<algorithm>#include<iostream>#include<map>#include<stdio.h>#include<string.h>#include<stdlib.h>#include<algo 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4409思路：建树后，就是裸LCA了，代码写得不好~~~View Code #include<stdio.h>#include<string.h>#include<string>#include<vector>#include<iostream>#include<algorithm>#include<map>using namespace std;const int maxn = 30003;int fa[maxn],pre[m 阅读全文