IT討論區(82) IT狗對住新老細:肅立起敬頌讚祂!!表示尊敬跪拜祂!!
素睛
1001 回覆
2 Like
0 Dislike
第 1 頁第 2 頁第 3 頁第 4 頁第 5 頁第 6 頁第 7 頁第 8 頁第 9 頁第 10 頁第 11 頁第 12 頁第 13 頁第 14 頁第 15 頁第 16 頁第 17 頁第 18 頁第 19 頁第 20 頁第 21 頁第 22 頁第 23 頁第 24 頁第 25 頁第 26 頁第 27 頁第 28 頁第 29 頁第 30 頁第 31 頁第 32 頁第 33 頁第 34 頁第 35 頁第 36 頁第 37 頁第 38 頁第 39 頁第 40 頁第 41 頁
Tcon pm 有幾錢？？
PM 幾錢？
熊貓燒香
80k左右
如果呢個位有公務員就好
pm大多都係長期位
咁就80k 做政府工一世？
其實都唔差
其實都唔差
都要有pm位比你做先得
一個部門得一個
一個部門得一個
係外國做緊FAANG 扣完稅可能人工都係咁上下高級政府工真係幾屈機
粗略睇
1. 你唔需要 nCr
2. 你想快既 唔應該對input mmap write 因為你個input mmap係MAP_PRIVATE 寫佢會copy on write
3. 個stack我自己會用pointer to top
1. 你唔需要 nCr
2. 你想快既 唔應該對input mmap write 因為你個input mmap係MAP_PRIVATE 寫佢會copy on write
3. 個stack我自己會用pointer to top
香港都有稅同強積金
最近好多agent乜工都無但又係咁chur你要同你講career plan
香港既稅小到，外國扣緊50%，香港先12%
MPF 就唔好提啦
MPF 就唔好提啦
Macroview差啲定呢間
唔記得咗t con仲有agent都要食一舊
做得agent 就係要漁翁撒網
百貨應百客 好似係
百貨應百客 好似係
兩個都係屎
我會話一樣差
我會話一樣差
連工都無得睇全部唔理
我講多次 你唔需要nCr 自己再諗下先
其實老老實實我自己就唔會求快既 唔求快就無所謂 由佢copy on write
但係你求快 就避免copy on write 唔好append個\n 而係另外用code去check
可以增加readability 至於速度 是但啦 要計既唔會快得去邊 因為你個base pointer同size應該cache埋一齊 read唔會慢得去邊
其實老老實實我自己就唔會求快既 唔求快就無所謂 由佢copy on write
但係你求快 就避免copy on write 唔好append個\n 而係另外用code去check
可以增加readability 至於速度 是但啦 要計既唔會快得去邊 因為你個base pointer同size應該cache埋一齊 read唔會慢得去邊
Junior post 可能係。Senior post未計bonus同股票已經可以高過呢個數（assume扣1/3稅）。
1. For an n-element set, the number of subset is 2^n
2. There is a trivial way to map integers in [0,1,.. 2^n-1] to a subset of an n-element set.
3. For practical reasons, I think n < 64. Homework question: if you can print one subset in 1 cycle at 3GHz. How long does it take to print out all 2^64 subset?
4. Look up the man page of ffs(). On many modern CPUs, there are instruction to find the first set bit of an integer in a few machine cycles.
5 Homework question: putting 1, 2, 3 and 4 together.
2. There is a trivial way to map integers in [0,1,.. 2^n-1] to a subset of an n-element set.
3. For practical reasons, I think n < 64. Homework question: if you can print one subset in 1 cycle at 3GHz. How long does it take to print out all 2^64 subset?
4. Look up the man page of ffs(). On many modern CPUs, there are instruction to find the first set bit of an integer in a few machine cycles.
5 Homework question: putting 1, 2, 3 and 4 together.
我估佢個output要sort by set length
應該咁講
以前 development scale 無咁大
唔少人水平只係停留寫 script / 好簡單 program
更加唔好講 system design
請人既唔會識分你係咪 technical
以前 development scale 無咁大
唔少人水平只係停留寫 script / 好簡單 program
更加唔好講 system design
請人既唔會識分你係咪 technical