2021.7.28做题
判断一个图是否为树
无向图(hdu 1272 小希的迷宫)
运用并查集数据结构,若已经在一个集合中,则不是树,若集合数量大于一,则成森林
acwing201 可见的点
套一遍欧拉函数即可
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1010;
int primes[N], cnt;
int phi[N];
bool st[N];
void init(int n){ // 筛质数法求欧拉函数(模板)
phi[1] = 1;
for(int i = 2; i <= n; i ++ )
{
if(!st[i]){
primes[cnt ++ ] = i;
phi[i] = i - 1;
}
for(int j = 0; primes[j] * i <= n; j ++ )
{
st[i * primes[j]] = true;
if(i % primes[j] == 0){
phi[i * primes[j]] = phi[i] * primes[j];
break;
}
phi[i * primes[j]] = phi[i] * (primes[j] - 1);
}
}
}
int main(){
init(N - 1);
int n, m;
cin >> m;
for(int T = 1; T <= m; T ++ ){
cin >> n;
int res = 1;
for(int i = 1; i <= n; i ++ ) res += phi[i] * 2;
cout << T << ' ' << n << ' ' << res << endl;
}
return 0;
}
acwing220 最大公约数
#include <iostream>
#include <cstring>
#include <algorithm>
const int N = 1e7 + 10;
using namespace std;
int primes[N], cnt;
int phi[N];
bool st[N];
long long s[N];
void init(int n){
for(int i = 2; i <= n; i ++ ){
if(!st[i]){
primes[cnt ++ ] = i;
phi[i] = i - 1;
}
for(int j = 0; primes[j] * i <= n; j ++ ){
st[primes[j] * i] = true;
if(i % primes[j] == 0){
phi[i * primes[j]] = phi[i] * primes[j];
break;
}
phi[i * primes[j]] = phi[i] * (primes[j] - 1);
}
}
for(int i = 1; i <= n; i ++ ) s[i] = s[i - 1] + phi[i];
}
int main(){
int n;
cin >> n;
init(n);
long long res = 0;
for(int i = 0; i < cnt; i ++ ){
int p = primes[i];
res += s[n / p] * 2 + 1;
}
cout << res << endl;
return 0;
}
acwing222 青蛙的约会
扩展gcd
建议看算法笔记5.7章节内容 书上176页,有详细的推导证明过程
#include<iostream>
using namespace std;
typedef long long LL;
LL exgcd(LL a, LL b, LL& x, LL& y){
if(!b){
x = 1, y = 0;
return a;
}
LL d = exgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
int main(){
LL a, b, m, n, L;
cin >> a >> b >> m >> n >> L;
LL x, y;
LL d = exgcd(m - n, L, x, y);
if((b - a) % d) puts("Impossible");
else{
x *= (b - a) / d;
LL t = abs(L / d);
cout << (x % t + t) % t << endl;
}
return 0;
}