21 Days Trainging // Day 5

3. queen

My idea : enumrate

Code :

#include 
using namespace std;

int main() {
    freopen("queen.in", "r", stdin);
    freopen("queen.out", "w", stdout);
    string S, T;cin >> S >> T;
    string C;
    long long count=0;
    for (int i=0;i<S.length();i++) {
        for (int j=i;j<S.length();j++) {
            for (int k=0;k<T.length();k++) {
                for (int l=k+((j-i)&1);l<T.length();l+=2) {
                    C = S.substr(i,j-i+1)+T.substr(k,l-k+1);
                    for (int i=0;i>1;i++) {
                        if (C[i]!=C[i+C.length()/2]) goto enum_end;
                    }   
                    count++;
                    enum_end: ;
                }
            }
        }
    }
    cout << count;
    return 0;
}

Complexity : O(n^5)
Constraints :

Expected : 25/25