I have solved an NP HARD Problem

Правка en3, от Formatci, 2023-03-04 01:02:06

When I was in a lecture, my students tried to troll me and asked the question that was banned from codeforces because of being NP hard. I did not know anything about that problem and I have tried to solve it. I struggled a lot but finally, I solved the problem in O($$$N*N$$$) complexity. I will not share my full solution because I do not want to give opportunities to people who will use this solution for bad ideas. I know you will not believe me but I will share some pictures while I was solving the problem. (It is up to you to believe...) (Also I do not believe that the world is a fair place, so I know I will not gain anything if I share my solution because I am a Turkish person and it is sad, but many of the population of the world do not love Turkish people.)

UPD: This is the zoomed version of original photo.

Теги np, p=np, np hard

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский Formatci 2023-04-09 11:37:19 0 (published)
en3 Английский Formatci 2023-03-04 01:02:06 0 (saved to drafts)
en2 Английский Formatci 2023-02-09 23:35:20 135 Tiny change: ')\n\n**UPD**\nThis i' -> ')\n\n**UPD:**\nThis i'
en1 Английский Formatci 2023-02-09 23:29:50 1026 Initial revision (published)