Submission #1687833

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

#define INF 1e9;
#define mod 1e9+7

//#define max(x,y) (x>y)?x:y
//#define min(x,y) (x<y)?x:y
#define rep(i,j,k) for(int i=j;i<k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define mi(n) (int*)malloc(sizeof(int)*n);
#define mc(n) (char*)malloc(sizeof(char)*n);

using namespace std;
void p(int x){
    printf("%d\n",x);
}

void pp(char c){
    printf("%c\n",c);
}

void ppp(char *s){
    printf("%s\n",s);
}

int main(){
   string s;
   cin>>s;
   int count=0,ans=0;
   bool judge=false;
   rep(i,0,s.length()){
       if(s[i]=='A') judge=true;
       if(judge)count++;
       if(s[i]=='Z' && judge){
        ans=max(count,ans);
       }
   }
   
   cout<<ans<<endl;
   
   

    return 0;
}

Submission Info

Judge Result