【jzoj2017.8.21提高组A】

太菜了，刷刷NOIP题玩玩。

今天的题好像以前有做过（雾）

A.

#include<bits/stdc++.h>
typedef long long ll;
int n,q,phi,p[],cnt;
ll x;
inline ll sqr(ll x){return x*x;}
ll fpow(ll x,ll p){
    ll ans=;
    for(;p;p>>=,x=x*x%n)if(p&)ans=(ans*x)%n;
    return ans;
}
inline ll read(){
    ll f=,x=;char ch;
    do{ch=getchar();if(ch=='-')f=-;}while(ch<''||ch>'');
    do{x=x*+ch-'';ch=getchar();}while(ch>=''&&ch<='');
    return f*x;
}
int main(){
    n=read();q=read();phi=n;int qwq=n;
    for(int i=;i*i<=n;i++){
        if(n%i==)phi=phi/i*(i-);
        while(n%i==)n/=i;
    }
    if(n!=)phi=phi/n*(n-);
    p[cnt=]=;n=qwq;
    for(int i=;i*i<=n;i++)if(phi%i==){p[++cnt]=i;if(i*i!=phi)p[++cnt]=phi/i;}
    while(q--){
        x=read();char ch='';
        if(fpow(x,phi)!=){putchar('');continue;}
        for(int j=;j<=cnt;j++)if(fpow(x,p[j])==){ch='';break;}
        putchar(ch);
    }
}

B.

#include<bits/stdc++.h>
#define N 100010
const int yql=1e9+;
typedef long long ll;
using namespace std;
struct Edge{int u,v,next;}G[*N];
int tot=,head[*N],fa[N],n;
ll ans,w[N],sumv[N];
void addedge(int u,int v){
    G[++tot].u=u;G[tot].v=v;G[tot].next=head[u];head[u]=tot;
    G[++tot].u=v;G[tot].v=u;G[tot].next=head[v];head[v]=tot;
}
inline ll read(){
    int f=,x=;char ch;
    do{ch=getchar();if(ch=='-')f=-;}while(ch<''||ch>'');
    do{x=x*+ch-'';ch=getchar();}while(ch>=''&&ch<='');
    return f*x;
}
void dfs(int u,int f){
    for(int i=head[u];i;i=G[i].next){
        int v=G[i].v;if(v==f)continue;
        fa[v]=u;dfs(v,u);
        sumv[u]=(sumv[u]+sumv[v])%yql;
    }
    ll tmp=(sumv[u]*2LL+w[u])%yql*w[u]%yql;
    for(int i=head[u];i;i=G[i].next){
        int v=G[i].v;if(v==f)continue;
        tmp=(tmp+(sumv[u]+yql-sumv[v])%yql*sumv[v])%yql;
    }
    //printf("%lld\n",tmp);
    ans=(ans+tmp*w[u])%yql;
    sumv[u]=(sumv[u]+w[u])%yql;
}
int main(){
    n=read();w[]=read();
    for(int i=;i<=n;i++){
        int u=read();w[i]=read();
        i[w]%=yql;
        addedge(u,i);
    }
    dfs(,);
    //for(int i=1;i<=n;i++)printf("%lld ",sumv[i]);puts("");
    printf("%lld\n",ans%yql);
    return ;
}

C.

#include<bits/stdc++.h>
const int N=;
using namespace std;
int n,m,fa[N],cnt=;
map<string,int> mps;
struct Edge{int u,v,w;}G[N];
char s[],p[];
bool operator <(Edge x,Edge y){return x.w<y.w;}
inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
inline int read(){
    int f=,x=;char ch;
    do{ch=getchar();if(ch=='-')f=-;}while(ch<''||ch>'');
    do{x=x*+ch-'';ch=getchar();}while(ch>=''&&ch<='');
    return f*x;
}
int main(){
    n=read();m=read();
    for(int i=;i<=m;i++){
        scanf("%d%s%s",&G[i].w,s,p);
        string qwq=string(s);
        if(mps[qwq]==)mps[qwq]=++cnt;
        G[i].u=mps[qwq];
        qwq=string(p);
        if(mps[qwq]==)mps[qwq]=++cnt;
        G[i].v=mps[qwq];
    }
    for(int i=;i<=cnt;i++)fa[i]=i;
    sort(G+,G+m+);
    for(int i=;i<=m&&n;i++){
        int x=find(G[i].u),y=find(G[i].v);
        if(x!=y){fa[x]=y;--n;printf("%d\n",G[i].w);}
    }
    for(int i=;i<=n;i++)puts("INF");
}