In the last div 4, my solution for the problem E Binary Inversions [link to problem](https://mirror.codeforces.com/contest/1760/problem/E)got skipped due to the similarity of code from the user merahijalwa/181973274.↵
first of all I don't know him and the similarity in code is due to code available in the geeks for geeks platform for counting the number of inversions in the array [link to code from geeks for geeks website](https://www.geeksforgeeks.org/inversion-count-in-array-using-merge-sort/#:~:text=Inversion%20Count%20for%20an%20array,inversion%20count%20is%20the%20maximum.) . ↵
please consider this as this is a legit case and this is fist time i am going to reach pupil rank.↵
please [user:MikeMirzayanov,2022-11-22] consider this case as my case is completely legit and nor i have use any online ides.
first of all I don't know him and the similarity in code is due to code available in the geeks for geeks platform for counting the number of inversions in the array [link to code from geeks for geeks website](https://www.geeksforgeeks.org/inversion-count-in-array-using-merge-sort/#:~:text=Inversion%20Count%20for%20an%20array,inversion%20count%20is%20the%20maximum.) . ↵
please consider this as this is a legit case and this is fist time i am going to reach pupil rank.↵
please [user:MikeMirzayanov,2022-11-22] consider this case as my case is completely legit and nor i have use any online ides.
