Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<cstdio>
- long long ans=0;
- bool isok(char s[],int n){
- bool f[3];
- for(int i=0;i<n-2;i++)
- {
- f[0]=f[1]=f[2]=0;
- f[s[i]-'A']=1;
- f[s[i+1]-'A']=1;
- f[s[i+2]-'A']=1;
- if(f[0]&&f[1]&&f[2])return 0;
- }
- // s[n]='\0';
- // puts(s);
- return 1;
- }
- void solve(char s[],int n,int x){
- if(x==n){
- if(isok(s,n))ans++;
- return;
- }
- s[x]='A';
- solve(s,n,x+1);
- s[x]='B';
- solve(s,n,x+1);
- s[x]='C';
- solve(s,n,x+1);
- }
- int main(){
- char s[50];
- int n;
- printf("Enter n\n");
- scanf("%d",&n);
- solve(s,n,0);
- printf("%lld\n",ans);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement