懶人包
Let a_n:{0,1,2,3,4,5,6,7,8,9,10} → S be an increasing sequence
where S = {0, 3.12, 12.68, 20.98, 30.53, 36.84, 43.21
, 65.41, 82.96, 91.22, 100}
Then for any n€[0,9], m€[1,850], both natural numbers,
a summoner passing seal n with rank m has the following score:
score = a_n + (a_(n+1) - a_n) * (m/850)
---------------------------------------------------------------------
首先,看原始碼,抓到這列code
user_persentage = (chapter_percent + (upper_chapter_percentage -
chapter_percent) * level_percent).toFixed(2)
再去看 chapter_percent = chapter_persentage[user_chapter]
(進度百分比a_n) (進度n)
所以 chapter_persentage是list之類的東西
果不其然
chapter_persentage = [0, 3.12, 12.68, 20.98, 30.53, 36.84, 43.21, 65.41,
82.96, 91.22, 100]
接著看 upper_chapter_percentage
= chapter_persentage[parseInt(user_chapter) + 1]
其中parseInt(user_chapter)應該跟user_chapter一模一樣,應該怕你輸入非正整數
最後看 level_percent 調出 user_percentage = (level / max_level)
所以就拼湊出公式拉!(‧^ω^‧)
=================================================
乾你媽的無用頁面
--
Let a_n:{0,1,2,3,4,5,6,7,8,9,10} → S be an increasing sequence
where S = {0, 3.12, 12.68, 20.98, 30.53, 36.84, 43.21
, 65.41, 82.96, 91.22, 100}
Then for any n€[0,9], m€[1,850], both natural numbers,
a summoner passing seal n with rank m has the following score:
score = a_n + (a_(n+1) - a_n) * (m/850)
---------------------------------------------------------------------
首先,看原始碼,抓到這列code
user_persentage = (chapter_percent + (upper_chapter_percentage -
chapter_percent) * level_percent).toFixed(2)
再去看 chapter_percent = chapter_persentage[user_chapter]
(進度百分比a_n) (進度n)
所以 chapter_persentage是list之類的東西
果不其然
chapter_persentage = [0, 3.12, 12.68, 20.98, 30.53, 36.84, 43.21, 65.41,
82.96, 91.22, 100]
接著看 upper_chapter_percentage
= chapter_persentage[parseInt(user_chapter) + 1]
其中parseInt(user_chapter)應該跟user_chapter一模一樣,應該怕你輸入非正整數
最後看 level_percent 調出 user_percentage = (level / max_level)
所以就拼湊出公式拉!(‧^ω^‧)
=================================================
乾你媽的無用頁面
--
All Comments