CF 1594 C Make Them Equal

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=300005;
bool notprime[N]={
    
    };
ll prime[N],k=0;
void pr()
{
    
    
    notprime[1]=1;
    for(ll i=2;i<=300000;i++)
    {
    
    
        if(!notprime[i])prime[++k]=i;
        for(int j=1;j<=k && prime[j]*i<=300000;j++)
        {
    
    
            notprime[prime[j]*i]=1;
            if(i%prime[j]==0)break;
        }
    }
}
int main()
{
    
    
    pr();
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int T;
    cin>>T;
    for(int l=1;l<=T;l++)
    {
    
    
        int n,s,p=0;
        char c;
        string t;
        cin>>n>>c>>t;
        int cnt=0;
        for(int i=0;i<t.size();i++)
        {
    
    
            if(t[i]!=c)cnt++;
            if(t[i]==c)p=i;
        }
        for(int i=t.size()-1;i>=0;i--)
        {
    
    
            if(!notprime[i+1]){
    
    s=i;break;}
        }
        if(cnt==0)cout<<0<<endl;
        else if(cnt==1 && t[p]!=c)cout<<1<<endl<<2<<endl;
        else 
        {
    
    
            if(p<n/2)cout<<2<<endl<<s+1<<' '<<2<<endl;
            else cout<<1<<endl<<p+1<<endl;
        }
    }
    return 0;
}

猜你喜欢

转载自blog.csdn.net/Ambrumf/article/details/120668399