Hi MikeMirzayanov Codeforces Round 983 (Div. 2) Problem A Submission id — 289192116 Problem B Submission id — 289214425 Problem C Submission id — 289265297

My problem A and B logic is same as authors solution just their is change in implementation. As logic was trivial their can be multiple implementation similar to mine. Earlier I had different logic with problem C in which I was applying binary search on min number of operations, you can also check by submission id 289242175. After that I had observation that rather than applying binary search on min number of operations we need to do it on longest length of subarray so I stick to that binary search logic. So my approach for binary search on longest length of subarray was correct many others can have thought of same logic but their implementation differs yet I received warning, your solution 289265297 for the problem 2032C significantly coincides with them.

Please look into matter and resolve my issue, as I participated contest individually.

Hi MikeMirzayanov Educational Codeforces Round 171 (Rated for Div. 2) Problem B Submission id — 288571058

I received warning, on my problem B solution 288571058 significantly coincides with 288566877,288559479 and 288557948. We can clearly see solution 288571058 288566877 is written by an AI tool because of names of variables and function names. As for submissions 288559479 and 288557948 their code is completely similar like entire is_possible function used for binary search and right = (ll)1e18. While my code is completely different from above 3 submission yet I received warning.

Please look into matter and resolve my issue, as I participated contest individually.

Hi MikeMirzayanov Codeforces Round 983 (Div. 2) Problem A Submission id — 289192116 Problem B Submission id — 289214425 Problem C Submission id — 289265297

My problem A and B logic is same as authors solution just their is change in implementation. As logic was trivial their can be multiple implementation similar to mine. Earlier I had different logic with problem C in which I was applying binary search on min number of operations, you can also check by submission id 289242175. After that I had observation that rather than applying binary search on min number of operations we need to do it on longest length of subarray so I stick to that binary search logic. So my approach for binary search on longest length of subarray was correct many others can have thought of same logic but their implementation differs yet I received warning, your solution 289265297 for the problem 2032C significantly coincides with them.

Please look into matter and resolve my issue, as I participated contest individually.