https://mirror.codeforces.com/submissions/sinha_yash

some evidence

very AI-LIKE code, with SPACES between operators and variable names, and EMPTY LINES between parts and parts.

NO HUMAN-WRITTEN CODE in its DAILY practice, which means it performs without any practice(for human).

its performance in cfr1069 is TOO WELL comparing to other performances.

SKIPPED submissions in a round before cfr1069.

for problem F

well, i have a question: how did you directly switch to and think and then finish programming F after solving C in 17 minutes?

and WHY DID YOU NAME A VARIABLE zero_adjust WHICH IS TOO LONG FOR THESE KINDA CONTESTS?

and HOW WOULD YOU LIKE TO NAME THE VARIABLE current_sum WHICH IS ALSO TOO LONG AND AI-LIKE??

so, according to what i've said, sinha_yash is 101%(with 1% error) a cheater and should be banned.

meanwhile, it took rk5 in cfr1069 which is too unfair for other high ranking competitors lower than rk5. so its submissions should be SKIPPED and the rating should be rolled-back.

MikeMirzayanov

note: ogenus is also an AI-cheater, click here for more information.

i am looking for a website, that can detect whether a program(like the following one) is completed by ai or not. are there any good websites or apps? thank you very much!

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
using ull = unsigned long long;
 
/*
n=奇数，需要s=t；  
n=偶数长度时**，分解为 n 刨掉每个2因子这么多的块。  
XOR 操作就做同一组可逆线性变换：t = ms 对所有块内对应位置同时生效，且 m 必须可逆。  
存在可逆 m 使得 ms = t 就是s 的行空间要和 t 的行空间一样
那么我们只需要找到所有块，做 GF(2) 下的高斯消元，再把 s 的每个块在 t 的基下消元，全部化为0。
同理把 t 的每个块在 s 的基下也能化为0，代码比较好写。
*/
 
struct P {
    vector<ull> d;
    P(int len = 0) : d((len + 63) >> 6) {}
    void Xor(const P &o) {
        for (int i = 0; i < (int)d.size(); i++)
            d[i] ^= o.d[i];
    }
    bool chk(int p) const {
        return (d[p >> 6] >> (p & 63)) & 1;
    }
    void st1(int p) {
        d[p >> 6] |= (1ULL << (p & 63));
    }
    bool ck0() const {
        for (ull w : d) if (w) return 0;
        return 1;
    }
    int mx() const {
        for (int i = (int)d.size() - 1; i >= 0; i--) {
            if (d[i]) {
                int lz = __builtin_clzll(d[i]);
                return i * 64 + (63 - lz);
            }
        }
        return -1;
    }
};
int n, bl, m;
vector<P> sb, tb;
vector<pair<int, P>> S, T;
void calS() {
    vector<P> tmp = sb;  
    S.clear();
    for (auto &v : tmp) {
        for (auto &b : S) {
            if (v.chk(b.fi)) v.Xor(b.se);
        }
        if (v.ck0()) continue;
        int h = v.mx();S.emplace_back(h, v);
        sort(S.begin(), S.end(),[](auto &l, auto &r){return l.fi > r.fi;});
    }
}
void calT() {
    vector<P> tmp = tb;
    T.clear();
    for (auto &v : tmp) {
        for (auto &b : T) {
            if (v.chk(b.fi)) v.Xor(b.se);
        }
        if (v.ck0()) continue;
        int h = v.mx();
        T.emplace_back(h, v);
        sort(T.begin(), T.end(),[](auto &l, auto &r){ return l.fi > r.fi;});
    }
}
bool chkT() {
    for (auto &cr : sb) {
        P v = cr;
        for (auto &b : T) {
            if (v.chk(b.fi)) v.Xor(b.se);
        }
        if (!v.ck0()) return 0;
    }
    return 1;
}
bool chkS() {
    for (auto &cr : tb) {
        P v = cr;
        for (auto &b : S) {
            if (v.chk(b.fi)) v.Xor(b.se);
        }
        if (!v.ck0()) return 0;
    }
    return 1;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T; 
    cin >> T;
    while (T--) {
        string s, t;
        cin >> n >> s >> t;
        if (n & 1) {
            cout << (s == t ? "Yes\n" : "No\n");
            continue;
        }
        if (s == t) {
            cout << "Yes\n";
            continue;
        }
        int k = __builtin_ctz(n);
        bl = 1 << k,m = n >> k;
        sb.assign(bl, P(m));
        tb.assign(bl, P(m));
        for (int i = 0; i < bl; i++) {
            for (int j = 0; j < m; j++) {
                if (s[i*m+j] == '1') sb[i].st1(j);
                if (t[i*m+j] == '1') tb[i].st1(j);
            }
        }
        calS(),calT(),	cout << (chkT() && chkS() ? "Yes\n" : "No\n");
    }
    return 0;
}

hope_that_luogu_can_enable_my_account.png: https://mirror.codeforces.com/blog/entry/142066

no one could get the point from its mt19937 rnd(random_device{}());-generated sentences.

recent reporting post: https://mirror.codeforces.com/blog/entry/142204

zhoujiarun0216's luogu account, named zhoujiarun, had been banned since it pasted and submitted too many solutions. the user then abuse the luogu admin chen_zhe on codeforces' discussions, which it posted a meaningless blog simply to rate 0 to chen_zhe's name and 100 to its name.

and it submitted two ai-like programs during contests:

https://mirror.codeforces.com/contest/2094/submission/315417783

https://mirror.codeforces.com/contest/2094/submission/315426070

for some endlines were added between for-loops and no tabs but spaces were used.

we'll just WAIT AND SEE, will you get out from competitive programming and cheat yourself in your whole life.

please wear a pair of glasses to protect your eyes: https://mirror.codeforces.com/blog/entry/142085

RPdreamer gatrmani, they are probably the same person.

they have published too many vulgar blogs and comments, and their contribution is VERY low.

MikeMirzayanov please ban them.

and, RPdreamer has got two banned luogu accounts for it has published dangerous programs in luogu. we should stop its bad action.