1139 First Contact (30 分) 模数前缀零的坑点

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=1e5+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,m,a[maxn],b[maxn];
string s,t;
vector<int> g[100005];
int solve(string s){
    if(s[0]=='-') s[0]='1';
	int ret=0;
    rep(i,0,s.size()){
        int tp=s[i]-'0';
        ret=ret*10+tp;
    }
    return ret;
}
vector<pair<int,int>> ans;
int gao(int x,int y){
    rep(i,0,g[x].size()) if(g[x][i]==y) return 1;
    return 0;
}
string f(int x){
    string ret="";
    rep(i,0,4){
        char c=(x%10)+'0';
        ret=c+ret;
        x/=10;
    }
    return ret;
}
int main(){
    cin>>n>>m;
	rep(i,0,m){
        cin>>s>>t;
        a[i]=solve(s);
        b[i]=solve(t);
        ///cout<<a[i]<<"emm"<<b[i]<<endl;
        g[a[i]].push_back(b[i]);
        g[b[i]].push_back(a[i]);
    }
    rep(i,0,100005) sort(g[i].begin(),g[i].end());
    int k;cin>>k;
    rep(i,0,k){
        ans.clear();
        cin>>s>>t;
        int x=solve(s),xx=x/10000;
        int y=solve(t),yy=y/10000;
        rep(j,0,m){
            if(x==a[j]||x==b[j]||y==a[j]||y==b[j]) continue;
            int tx=a[j]/10000;
            int ty=b[j]/10000;
            if(xx!=yy){
                if(tx==ty) continue;
                if(xx==tx){
                    if(gao(x,a[j])&&gao(y,b[j])){
                        ans.push_back(mk(a[j]%10000,b[j]%10000));
                    }
                }else if(gao(x,b[j])&&gao(y,a[j])){
                        ans.push_back(mk(b[j]%10000,a[j]%10000));
                	}
            }else if(tx==ty&&tx==xx){
                if(gao(x,a[j])&&gao(y,b[j]))
                    ans.push_back(mk(a[j]%10000,b[j]%10000));
                if(gao(x,b[j])&&gao(y,a[j]))
                    ans.push_back(mk(b[j]%10000,a[j]%10000));
            }
        }
        cout<<ans.size()<<"\n";
        sort(ans.begin(),ans.end());
        rep(j,0,ans.size()) cout<<f(ans[j].fi)<<" "<<f(ans[j].se)<<"\n";
    }
    return 0;
}