10.24考试爆炸记

世上还赞颂沉默吗 不够爆炸
所以就继续爆炸了
（1）建设图
$n$点$m$边求至少加多少边可以使整个图变为一个双连通分量

吾不言

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<iomanip>
using namespace std;
inline int read(){
    int i=0,f=1;
    char ch;
    for(ch=getchar();!isdigit(ch);ch=getchar())
        if(ch=='-') f=-1;
    for(;isdigit(ch);ch=getchar())
        i=(i<<3)+(i<<1)+(ch^48);
    return i*f;
}
int buf[1024];
inline void write(int x){
    if(!x){putchar('0');return ;}
    if(x<0){putchar('-');x=-x;}
    while(x) buf[++buf[0]]=x%10,x/=10;
    while(buf[0]) putchar(buf[buf[0]--]+48);
    return ;
}
#define stan 111111
#define sten 222222
#define stin 555555
int tot,nxt[stin],first[stan],goal[stin],d[stan];
int loww[stan],dfn[stan],ts,sta[stan],top,ans;
int n,m,a,b;
int cnt,ord[stan];
bool exi[stan];
struct con{
    int a,b;
}edge[sten];
void addedge(int a,int b,int c){
    nxt[++tot]=first[a];first[a]=tot;goal[tot]=b;
    nxt[++tot]=first[b];first[b]=tot;goal[tot]=a;
    edge[c].a=a;edge[c].b=b;
    ++d[a];++d[b];
    return ;
}
void tarjan(int u,int fa){
    loww[u]=dfn[u]=++ts;
    sta[++top]=u;exi[u]=true;
    for(int p=first[u];p;p=nxt[p])
        if(goal[p]!=fa){
            if(!dfn[goal[p]]){
                tarjan(goal[p],u);
                loww[u]=min(loww[u],loww[goal[p]]);
            }else if(exi[goal[p]])
                loww[u]=min(loww[u],dfn[goal[p]]);
        }
    if(dfn[u]==loww[u]){
        ++cnt;
        while(sta[top+1]!=u){
            ord[sta[top]]=cnt;
            exi[sta[top]]=false;
            --top;
        }
    }
    return ;
}
signed main(){
    n=read();m=read();
    for(int i=1;i<=m;++i){
        a=read();b=read();
        addedge(a,b,i);
    }
    if(m==n-1){
        ans=0;
        for(int i=1;i<=n;++i)
            if(d[i]==1) ++ans;
        if(ans==1) write(0);
        else write(max((ans+1)/2,0));
        return 0;
    }else{
        memset(d,0,sizeof(d));
        for(int i=1;i<=n;++i)
            if(!dfn[i]) tarjan(i,0);
        for(int i=1;i<=m;++i)
            if(ord[edge[i].a]!=ord[edge[i].b]){
                ++d[ord[edge[i].a]];
                ++d[ord[edge[i].b]];
            }
        ans=0;
        for(int i=1;i<=cnt;++i)
            if(d[i]==1) ++ans;
        if(ans==1) write(0);
        else write(max((ans+1)/2,0));
        return 0;
    }
}

（2）乘积

选择不超过$k$个$n$以内的正整数乘起来，使得乘积没有相同质因子，求方案数

考虑到每个数只有一个比$\sqrt{n}$大的质因子

然后做一个背包即可

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<iomanip>
#define mod 1000000007
using namespace std;
inline int read(){
    int i=0,f=1;
    char ch;
    for(ch=getchar();!isdigit(ch);ch=getchar())
        if(ch=='-') f=-1;
    for(;isdigit(ch);ch=getchar())
        i=(i<<3)+(i<<1)+(ch^48);
    return i*f;
}
int buf[1024];
inline void write(long long x){
    if(!x){putchar('0');return ;}
    if(x<0){putchar('-');x=-x;}
    while(x) buf[++buf[0]]=x%10,x/=10;
    while(buf[0]) putchar(buf[buf[0]--]+48);
    return ;
}
#define stan 555
#define sten 333
const int pri[8]={2,3,5,7,11,13,17,19};
int num[stan],f[stan][sten],ac[stan],rev;
int first[stan],nxt[stan],goal[stan],tot;
int T,n,k;
long long ans;
inline void addlock(int a,int b){
    nxt[++tot]=first[a];first[a]=tot;goal[tot]=b;
    return ;
}
signed main(){
    T=read();
    while(T--){
        scanf("%d%d",&n,&k);
        memset(ac,0,sizeof(ac));
        memset(first,0,sizeof(first));tot=0;
        for(register int i=1;i<=n;++i){
            num[i]=i;
            for(register int j=0;j<8;++j){
                if(num[i]%(pri[j]*pri[j])==0){
                    ac[i]=-1;
                    break;
                }
                else if(num[i]%pri[j]==0){
                    num[i]/=pri[j];
                    ac[i]|=(1<<j);
                }
            }
            if(ac[i]!=-1){
                if(num[i]==1) addlock(i,i);
                else addlock(num[i],i);
            }
        }
        memset(f,0,sizeof(f));
        f[0][0]=1;
        for(int i=1;i<=n;++i)
            if(ac[i]!=-1&&first[i])
                for(register int j=k-1;j>=0;--j)
                    for(register int p=first[i];p;p=nxt[p])
                        for(int l=ac[goal[p]],rev=255^l;;rev=(rev-1)&(255^l)){
                            if((rev&l)==0) 
                                if(f[j+1][rev|l]+f[j][rev]>mod) f[j+1][rev|l]=f[j+1][rev|l]+f[j][rev]-mod;
                                else f[j+1][rev|l]=f[j+1][rev|l]+f[j][rev];
                            if(!rev) break;
                        }
        ans=0;
        for(register int i=1;i<=k;++i)
            for(register int j=0;j<256;++j)
                ans+=f[i][j];
        write(ans%mod);puts("");
    }
    return 0;
}

（3）math
给定$a$,$n$,求有多少$b$满足$a^b\equiv b^a（\mod2^n）$
且$1\leq b\leq 2^n$

奇偶讨论找规律，偶数区间取值emm…

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<iomanip>
using namespace std;
inline int read(){
    int i=0,f=1;
    char ch;
    for(ch=getchar();!isdigit(ch);ch=getchar())
        if(ch=='-') f=-1;
    for(;isdigit(ch);ch=getchar())
        i=(i<<3)+(i<<1)+(ch^48);
    return i*f;
}
int buf[1024];
inline void write(int x){
    if(!x){putchar('0');return ;}
    if(x<0){putchar('-');x=-x;}
    while(x) buf[++buf[0]]=x%10,x/=10;
    while(buf[0]) putchar(buf[buf[0]--]+48);
    return ;
}
int T,ans,a,n;
int ksc(int a,int b,int p){
    int ret=0;
    while(b){
        if(b&1) ret=(ret+a)%p;
        b>>=1;
        a=(a+a)%p;
    }
    return ret;
}
int ksm(int a,int b,int p){
    int ret=1;
    while(b){
        if(b&1) ret=ksc(ret,a,p);
        b>>=1;
        a=ksc(a,a,p);
    }
    return ret;
}
signed main(){
    T=read();
    while(T--){
        ans=0;
        a=read();n=read();
        int maxn=(1<<n);
        if(a&1){
            puts("1");
            continue;
        }else{
            for(int i=2;i<=n;i+=2)
                if(ksm(a,i,maxn)==ksm(i,a,maxn))
                    ++ans;
            int c=(n+a-1)/a;
            int x=(1<<n)>>c;
            int t=n>>c;
            ans+=x;
            ans-=t;
            write(ans);
            puts("");
        }
    }
    return 0;
}