Enju With math problem


图片说明
给定一个序列和一个序列 找出序列在上出现的第一个位置。





#include<bits/stdc++.h>
#define me(a,x) memset(a,x,sizeof(a))
#define IN freopen("in.txt","r",stdin);
#define OUT freopen("out.txt","w",stdout);
#define sc scanf
#define itn int
#define STR clock_t startTime = clock();
#define END clock_t endTime = clock();cout << double(endTime - startTime) / CLOCKS_PER_SEC *1000<< "ms" << endl;
using namespace std;
const int N=5e6+5;
const long long mod=1e9+7;
const long long mod2=998244353;
const int oo=0x7fffffff;
const int sup=0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it>void db(it *begin,it *end){while(begin!=end)cout<<(*begin++)<<" ";puts("");}
template <typename it>
string to_str(it n){string s="";while(n)s+=n%10+'0',n/=10;reverse(s.begin(),s.end());return s;}
template <typename it>int o(it a){cout<<a<<endl;return 0;}
inline ll mul_64(ll x,ll y,ll c){return (x*y-(ll)((long double)x/c*y)*c+c)%c;}
inline ll ksm(ll a,ll b,ll c){ll ans=1;for(;b;b>>=1,a=a*a%c)if(b&1)ans=ans*a%c;return ans;}
inline void exgcd(ll a,ll b,ll &x,ll &y){if(!b)x=1,y=0;else exgcd(b,a%b,y,x),y-=x*(a/b);}
int phi[N],tot=0;
int prime[N];
bool vis[N];
int a[105];
const int base=101107;
const int mo=41113;
struct Hash{
    ll head[mo],nt[N],cnt=0;
    ll h1[N], h2[N];
    void init(){
        me(head,0);me(nt,0);me(h1,0);me(h2,0);
    }
    void insert(ll n, ll x){
        cnt++;
        h1[cnt]=n;h2[cnt]=x;
        nt[cnt]=head[n%mo];head[n%mo]=cnt;
    }
    ll find(ll n){
        for (int i=head[n%mo];i;i=nt[i])if(h1[i]==n)return h2[i];
        return -1;
    }
}Ha;
ll ha(int x,int y,int c){
    ll ans=1LL*x*base*base+1LL*y*base+c;
    return ans;
}
void pre(){
    phi[1]=1;
    for(int i=2;i<N;i++){
        if(!vis[i])prime[++tot]=i,phi[i]=i-1;
        for(int j=1;j<=tot&&i*prime[j]<N;j++){
            vis[i*prime[j]]=1;
            if(i%prime[j]==0){
                phi[i*prime[j]]=phi[i]*prime[j];
                break;
            }else phi[i*prime[j]]=phi[i]*(prime[j]-1);
        }
    }
    for(int i=32;i<150000001;i+=32){
        int id=i/32;
        int x,y,c;
        if(id&1)x=phi[id]*16,y=phi[id+1]*32,c=phi[id+2]*16;
        else x=phi[id]*32,y=phi[id+1]*16,c=phi[id+2]*32;
        ll fg=ha(x,y,c);
        Ha.insert(fg,id);
    }
}
int euler(int n){
    if(n<N)return phi[n];
    int ans=n;
    for(int t=1;t<=tot&&prime[t]*prime[t]<=n;t++){
        int i=prime[t];
        if(n%i==0){
            ans=ans/i*(i-1);
            while(n%i==0)n/=i;
        }
    }
    if(n>1)ans=ans/n*(n-1);
    return ans;
}
bool check(int pos){
    for(int i=1;i<=100;i++){
        if(a[i]!=euler(pos+i-1))return false;
    }
    return true;
}
int main(){
    pre();
    int t;cin>>t;
    while(t--){
        for(int i=1;i<=100;i++)sc("%d",a+i);
        int pos=-1,x=0;
        for(int i=1;i<=32;i++){
            if(a[i]%16==0&&a[i+32]%16==0&&a[i+64]%16==0){
                x++;
                int id=Ha.find(ha(a[i],a[i+32],a[i+64]));
                if(id!=-1){
                    if(check(id*32-i+1)){
                        pos=id*32-i+1;
                        break;
                    }
                }
            }
        }
        if(pos!=-1){
            o("YES");
            o(pos);
        }else o("NO");
    }
}