Hi all,↵
I got a plagiarism match for my solution to problem [1619A](https://codeforces.me/problemset/problem/1619/A) (Round 762, Div.3).↵
↵
Here is my solution: [140025309](https://codeforces.me/contest/1619/submission/140025309)↵
↵
And here is the other guy ([Jaggar_2021](https://codeforces.me/profile/Jaggar_2021))'s code: [140079029](https://codeforces.me/contest/1619/submission/140079029)↵
↵
I don't know the other person and I have never seen his account before.↵
↵
This was our conversation after the false plagiarism detection:↵
↵
↵
↵
I agree that the code is somewhat similar, but the problem was very easy (Div.3 A) and my solution simply involved breaking the original string in half (if the length was a multiple of 2) and comparing the two halves. This was the approach that most people would have thought of. Also my code has slight differences, like I have used one more else block and I have used a typedef for long long. I also used length() function for the length of string, whereas he has used size() function.↵
↵
Tagging[~MikeMirzayanov](https://codeforces.me/profile/MikeMirzayanov),2021-12-21 , [~myav](https://codeforces.me/profile/myav),2021-12-21 , [~Gol_D](https://codeforces.me/profile/Gol_D),2021-12-21 , [~Aris_244_](https://codeforces.me/profile/Aris_244_) , [dim3x38on](https://codeforces.me/profile/dim3x38on) , [Vladosiya](https://codeforces.me/profile/Vladosiya) , [Brovko](https://codeforces.me/profile/Brovko),2021-12-21 , ~dim3x38on,2021-12-21 , ~Vladosiya,2021-12-21 , ~Brovko,2021-12-21↵
↵
Kindly resolve the issue.↵
I got a plagiarism match for my solution to problem [1619A](https://codeforces.me/problemset/problem/1619/A) (Round 762, Div.3).↵
↵
Here is my solution: [140025309](https://codeforces.me/contest/1619/submission/140025309)↵
↵
And here is the other guy ([Jaggar_2021](https://codeforces.me/profile/Jaggar_2021))'s code: [140079029](https://codeforces.me/contest/1619/submission/140079029)↵
↵
I don't know the other person and I have never seen his account before.↵
↵
This was our conversation after the false plagiarism detection:↵
↵
↵
↵
I agree that the code is somewhat similar, but the problem was very easy (Div.3 A) and my solution simply involved breaking the original string in half (if the length was a multiple of 2) and comparing the two halves. This was the approach that most people would have thought of. Also my code has slight differences, like I have used one more else block and I have used a typedef for long long. I also used length() function for the length of string, whereas he has used size() function.↵
↵
Tagging
↵
Kindly resolve the issue.↵
