Completed
알고리즘 문제인데 필기체로되어있어서 번역하기어렵습니다ㅠㅠ 도와주세요ㅠㅠ
منذ ٥ أعوام
Intermediate
Deleted
for this problem taking (n log n) and O(n 125) as in n long n=- n125 n long n=- n 25 the difference is only of log n and n 25 Seeing the behaviour of functions log(n) grows slower than n 25. -> for given extreme... use.. again use.. This shows that n log n grows slower than n 125. 필기체를 써달라는 말씀이시지요? 중간에 있는 식은 따라쓰거나, 쓰지 못한것도 있습니다.
@whwlsgh1144 ^^채택 바랍니다
@EunsongBae 감사합니다 ㅠㅠ